levenshtein
levenshtein(
a,b):number
Compute the Levenshtein distance between two strings.
The Levenshtein distance is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.
Compares the Unicode code points of the strings as given: case, whitespace and Unicode normalization (NFC vs NFD) are not adjusted.
Parameters
Section titled “Parameters”| Parameter | Type |
|---|---|
a |
string |
b |
string |
Returns
Section titled “Returns”number