conorevans / levenshtein-distance Goto Github PK
View Code? Open in Web Editor NEWThe Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.