%0 Journal Article
%T THE LEVENSHTEIN DISTANCE
%A KOS
%A Victor
%J Debreceni M£¿szaki K£¿zlem¨¦nyek
%D 2011
%I University of Debrecen
%X Levenshtein distance is a metric for measuring the amount of difference between two sequences. A metric, in this case, measure similarity or dissimilarity (distance) between two text strings for approximate matching (fuzzy string search) or comparison. The term edit distance is often used to refer specifically to Levenshtein distance. The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character
%K Levenshtein distance
%K Edit distance
%K C# implementation of Levenshtein distance
%U http://www.eng.unideb.hu/userdir/dmk/docs/20113/11_3_02.pdf