-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
45 lines (27 loc) · 1.08 KB
/
main.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
import re
from collections import Counter
def words(text):
return re.findall(r'\w+', text.lower())
WORDS = Counter(words(open('big.txt').read()))
def P(word, n=sum(WORDS.values())):
return WORDS[word] / n
def correction(word):
return max(candidates(word), key=P)
def candidates(word):
return known([word]) or known(edits1(word)) or known(edits2(word)) or [word]
def known(words):
return set(w for w in words if w in WORDS)
def edits1(word):
letters = 'abcdefighijklmnopqrstuvxyz'
splits = [(word[:i], word[i:]) for i in range(len(word) + 1)]
deletes = [L + R[1:] for L,R in splits if R]
transposes = [L + R[1] + R[0] + R[2:] for L,R in splits if len(R)>1]
replaces = [L + c + R[1:] for L,R in splits if R for c in letters]
inserts = [L + c + R for L,R in splits for c in letters]
return set(deletes + transposes + replaces + inserts)
def edits2(word):
return (e2 for e1 in edits1(word) for e2 in edits1(e1))
if __name__ == '__main__':
print(correction('speeling'))
print(correction('speling'))
print(correction('ecerxise'))