3.2 Levenshtein

The Levenshtein Distance (LD) or edit distance provides the distance or the number of edits (deletions, insertions, or substitutions) needed to transform the source string into the target string. For example, if the source string is Mohamed and the target string is Mohammed, the LD = 1 because one edit (insertion) must match the source and target strings. For more information, see the Website.