normalizedLevenshtein
normalizedLevenshtein(
a,b):number
Compute the normalized Levenshtein similarity between two strings.
1 - levenshtein(a, b) / max(length of a, length of b), counted in
characters. Returns a value between 0.0 (completely different) and 1.0
(identical).
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