Mismatch between different implementations of Levenshtein about levenshtein

[R-N]

Why don't Levenshtein library use Levenshtein for ratio?

[R-N]

Why don't Levenshtein library use Levenshtein for ratio?

The original author implemented it like this for some unknown reason and I kept it like this for backwards compatibility. I agree it is pretty confusing, so at least I made sure to mention the indel distance in the documentation.

I think it should be mentioned in the readme too, where people would read first. I mean, I would expect Levenshtein library to use Levenshtein unless specified otherwise. It's not like "Indel" is in the function name.

[maxbachmann]

Levenshtein.ratio is based upon the Indel distance and not on the Levenshtein distance. This is basically the same as the Levenshtein distance without substitutions. You can get the normalized Levenshtein distance using rapidfuzz:

>>> from rapidfuzz.distance import Levenshtein, Indel
>>> Levenshtein.normalized_similarity(a, b)
0.9375
>>> Levenshtein.normalized_similarity(a, b, weights=(1,1,2))
0.967741935483871
>>> Indel.normalized_similarity(a, b)
0.967741935483871

when processing large amounts of data I recommend using one of the processing functions in rapidfuzz.process. They are a lot faster, since they do not need to switch between Python and C++ for each string comparision.

[angelosalatino]

Thanks for the clarification and the lead. I will test this one. Thanks again

[maxbachmann]

Why don't Levenshtein library use Levenshtein for ratio?

The original author implemented it like this for some unknown reason and I kept it like this for backwards compatibility. I agree it is pretty confusing, so at least I made sure to mention the indel distance in the documentation.