distance
This distance is computed as levenshtein distance divided by the length of the longest string. The resulting value is always in the interval 0 to 1.
Compute distance as Levenshtein(s1, s2) / max(|s1|, |s2|).
Return
the computed normalized Levenshtein distance.
Parameters
first
left hand side string to compare.
second
right hand side string to compare.