Re:How I Trie to Make Spelling Suggestions
by raffi on Friday January 29, 2010 @02:00PM
(#1087224)
These algorithms solve a different problem. They calculate the edit distance between a string A and B. The algorithm in the post finds all strings B within an edit distance N of string A.
http://code.google.com/p/pylevenshtein/
However, I've found the Jaro-Winkler distance to be more useful than the Levenshtein. You can find good implementations for Jaro out there as well.
http://en.wikipedia.org/wiki/Jaro-Winkler_distance