5.2.16  Levensthein distance

The levenshtein command computes the Levenshtein distance between two words, which is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

• levenshtein takes two arguments:
  • s₁, a vector or string.
  • s₂, a vector or string.
• levenshtein(s₁,s₂) returns the minimum number n of edits required to transform s₁ into s₂.

Example