This can be accomplished either when initializing the spellĬheck class or after the fact. If the words that you wish to check are long, it is recommended to reduce theĭistance to 1. load_text_file ( './my_free_text_doc.txt' ) # if I just want to make sure some words are not flagged as misspelled spell.
from spellchecker import SpellChecker spell = SpellChecker () # loads default word frequency list spell. Text to generate a more appropriate list for your use case. If the Word Frequency list is not to your liking, you can add additional correction ( word )) # Get a list of `likely` options print ( spell. unknown () for word in misspelled : # Get the one `most likely` answer print ( spell. See the quickstart to find how one can change the distance parameter.Īfter installation, using pyspellchecker should be fairly straightįorward: from spellchecker import SpellChecker spell = SpellChecker () # find those words that may be misspelled misspelled = spell. Pyspellchecker allows for the setting of the Levenshtein Distance (up to two) to check.įor longer words, it is highly recommended to use a distance of 1 and not theĭefault 2. For information on how the dictionaries wereĬreated and how they can be updated and improved, please see theĭictionary Creation and Updating section of the readme!
Pyspellchecker supports multiple languages including English, Spanish, Those words that are found more often in the frequency list are Replacements, and transpositions) to known words in a word frequency It then compares all permutations (insertions, deletions, Pure Python Spell Checking based on PeterĪlgorithm to find permutations within an edit distance of 2 from the
0 kommentar(er)
