Noun
English Wikipedia has an article on:Levenshtein distanceWikipedia
Levenshtein distance (countable and uncountable, plural Levenshtein distances)
(computer science) The number of edits (replacements, deletions and insertions) required to change one string into another.
However, for comparing strings of different lengths, or strings where not just substitutions but also insertions or deletions have to be expected, a more sophisticated metric like the Levenshtein distance is more appropriate. Source: Internet