@LVS[string1, string2] : Return the Levenshtein Distance for the two strings.
The Levenshtein Distance (aka the edit distance) between two strings is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.
See also @SIMILAR.
