-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathspell.py
70 lines (55 loc) · 1.44 KB
/
spell.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
dictionary = set()
li = set()
lis = set()
def read_dictionary_file():
global dictionary
global contents
with open("DataList.txt","r",encoding='utf-8') as f:
contents = f.read()
dictionary = set(
word
for word in contents.splitlines()
)
def is_banan_correctly(word):
read_dictionary_file()
return word in dictionary
def suggested_word(word):
global sc
max_s = 10000
global te
global li
global lis
global source
te = word
for sug in contents.splitlines():
so = sug
source_value = minimum_distance(so, te)
if source_value <= max_s:
max_s = source_value
source = so
final_value = max_s
li = set()
for sug in contents.splitlines():
so = sug
source_value = minimum_distance(so, te)
if source_value == final_value:
li.add(so)
#lis = lis.union(li)
return li
def minimum_distance(s, t):
s = ' ' + s
t = ' ' + t
d = {}
S = len(s)
T = len(t)
for i in range(S):
d[i, 0] = i
for j in range(T):
d[0, j] = j
for j in range (1, T):
for i in range(1, S):
if s[i] == t[j]:
d[i, j] = d[i-1, j-1]
else:
d[i, j] = min(d[i-1, j],d[i, j-1],d[i-1, j-1]) + 1
return d[S-1, T-1]