forked from RohanMannem/ChatbotSteve
-
Notifications
You must be signed in to change notification settings - Fork 0
/
spellCheck.py
38 lines (28 loc) · 1.46 KB
/
spellCheck.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
# Resource: Peter Norvig "How to Write a Spelling Corrector"
import re
from collections import Counter
class spellCheck:
def __init__(self):
self.WORDS = Counter(self.words(open('minecraftWords.txt').read()))
self.WORDS += Counter(self.words(open('MinecraftPlayerGuide.txt').read()))
def words(self, text):
return re.findall(r'\w+', text.lower())
def probability(self, word, N = None):
N = sum(self.WORDS.values())
return float(self.WORDS[word]) / float(N)
def correction(self, word):
return max(self.candidates(word), key=self.probability)
def candidates(self, word):
return (self.known([word]) or self.known(self.edits1(word)) or self.known(self.edits2(word)) or [word])
def known(self, words):
return set(w for w in words if w in self.WORDS)
def edits1(self, word):
letters = 'abcdefghijklmnopqrstuvwxyz'
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(self, word):
return (e2 for e1 in self.edits1(word) for e2 in self.edits1(e1))