Spell Checker

Pradnya More
112003086

WRITEUP :

AIM : To implement a spell checker by using minimum edit distance algorithm

Input : A string of words

Output : The misspelled words in the string will get replaced by their correct spells

Algorithm :

1.Take the word of the string

2.If the word is not present in the google dictionary then by comparing it against each and
every word in the dictionary we calculate the minimum edit distance else got to step one

3.Take the minimum distance from the computed once.

4.If there are more than one words then check the parameters as a length of the
string ,whether if the first few characters of the word matches with the words in the
dictionary .

5.Select the word and replace it with and the word that we just got

6.Repeat 1,2,3,4, for remaining words of the string

RESULTS :

I entered the sentence “I lovet the word euphoriat”

Which should be “I love the word euphoria “

By giving the incorrect string to the algorithm it gives the following output string :
I loves the word euphoria

Conclusion :
Minimum edit distance cannot always give the best fitting word for the given incorrect
words .For a given word there can be more than one word that have the same minimum
edit distance but are not the targeted word.