About Levenshtein distance
In information theory and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. It is named after Vladimir Levenshtein, who considered this distance in 1965.
Download and install
Levenshtein distance version 1.0 on your
Android device!
Downloaded 100+ times, content rating: Not rated
Android package:
pl.essentialapps.levenshteindistance.app, download Levenshtein distance.apk
by T####:
I like the app. Shouldn't there be a substitution cost of 2 rather than 1 as in your app ?