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.
This version of Levenshtein distance Android App comes with one universal variant which will work on all the Android devices.
If you are looking to download other versions of Levenshtein distance Android App, We have 1 version in our database. Please select one of them below to download.