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.
val levenshtein = NormalizedLevenshtein()
println(levenshtein.similarity("kitten", "kirten"))Output:
0.8333333333333334