From <span class="searchmatch">Levenshtein</span> + <span class="searchmatch">distance</span>, after the Russian mathematician Vladimir <span class="searchmatch">Levenshtein</span>. English Wikipedia has an article on: <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span> Wikipedia...
<span class="searchmatch">Levenshtein</span> <span class="searchmatch">distances</span> plural of <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span>...
change one into the other. The string <span class="searchmatch">distance</span> between 'here' and 'there' is 1 (insertion of a t). edit <span class="searchmatch">distance</span> Hamming <span class="searchmatch">distance</span> <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span>...
[lɛvɛnsxtɛɪnova vzdaːlɛnost] Levenshteinova vzdálenost f (computer science) <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span> Declension of Levenshteinova vzdálenost (i-stem feminine)...
is "approximately equal" to a given pattern, defined in terms of <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span>, and working by means of bitmasks. Synonym: Baeza-Yates-Gonnet algorithm...
<span class="searchmatch">distance</span> in the <span class="searchmatch">distance</span> isodistance keep at a <span class="searchmatch">distance</span> keep one's <span class="searchmatch">distance</span> keyboard <span class="searchmatch">distance</span> <span class="searchmatch">Levenshtein</span> <span class="searchmatch">distance</span> linguistic <span class="searchmatch">distance</span> long-<span class="searchmatch">distance</span> long-distance...