Levenshtein Distance ( http://en.wikipedia.org/wiki/Levenshtein_distance http://en.wikipedia.org/wiki/Levenshtein_distance ) is a standard algorithm taught in a

Levenshtein Distance ( http://en.wikipedia.org/wiki/Levenshtein_distance http://en.wikipedia.org/wiki/Levenshtein_distance ) is a standard algorithm taught in algorithm courses as a standard example of Dynamic Programming. Some discussion here : http://stackoverflow.com/questions/1564184/edit-distance-algorithm http://stackoverflow.com/questions/1564184/edit-distance-alg...