The minimum edit distance technique.was first developed by Damerau (1964), to
compute the minimum number of editing operations (such as insertion, deletion,
transposition, and substitution) that are required to fix misspelled strings.
Hamming distance (H) is defined only for strings of the same length. Hamming distance
is named after Richard Hamming; it is an algorithm that measures the number
of substitutions required to change one string to the other. For strings s and t, H(s, t)
is the number of places in which the two strings differ, have different characters.
For example (http://en.wikipedia.org/wiki/Hamming_distance):
??? The Hamming distance between 1011101 and 1001001 is 2.
??? The Hamming distance between 2143896 and 2233796 is 3.
??? The Hamming distance between ???toned??? and ???roses??? is 3.
Hamming distance is used in telecommunications, signal distance, and cryptography.
For more sophisticated systems where addition, subtraction are required, Levenshtein
distance is more appropriate.
Levenshtein distance (or edit distance) is more sophisticated. It is defined for strings
of arbitrary length.
Pages:
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790