Description
Build a spelling corrector based on the Levenshtein distance.
Your spelling correction function:
• should accept a word and return the corrected word.
• may use only standard libraries and numpy.
• may use this English word list/frequency data.
Document some specific cases in which the Levenshtein-distance spelling corrector works well and in which it works poorly. Why is it working poorly and how could it be improved?
You may work in a group of 1 or 2. Submissions will be graded without regard for the group size. You should turn in a document (.txt, .md, or .pdf) answering all of the red items above. You should also turn in Python scripts (.py) for each of the blue items.
Page 1 of 1
