levenshtein function

Returns the Levenshtein edit distance between two strings. This equates to the minimum number of character edits (insertions, deletions or substitutions) required to change one string to another.
The Levenshtein distance is a measure of the similarity between two strings. Smaller distances mean the strings are more similar, and larger distances indicate more different strings. The distance is case sensitive.

Syntax

levenshtein(string1,string2)

Arguments

string1 → a string
string2 → a string

Example

 levenshtein('kittens','mitten') → 2

 levenshtein('Kitten','kitten') → 1

 levenshtein(upper('Kitten'),upper('kitten')) → 0