For starters, Levenshtein's distance is the number of edits you need to make to a string A to transform it to string B. The edits could be: removal of a character to A to change it to B, addition of a character to A to change it to B or simply substituting character in A to the one in B.
Application: Spell Checker
Not many sources explain this algorithm well but I happened to find one that explains it really superbly.
Check this out:
http://oldfashionedsoftware.com/tag/levenshtein-distance/
Application: Spell Checker
Not many sources explain this algorithm well but I happened to find one that explains it really superbly.
Check this out:
http://oldfashionedsoftware.com/tag/levenshtein-distance/
No comments:
Post a Comment