Max Bachmann

@yurivict was this resolved?

I can't reproduce this on my machine. For me this gives 100 both on Windows and Linux. So to fix this I would need your help in running some tests...

Ah that explains your issue. There are two problems for you: 1) you are using the Python fallback version. Probably because you installed the package from source without a C++...

@BobLd this does not really fix the issue. It just shifts it, so it works for this explicit case. As an example ``` SequenceMatcher(None, "no", "bnonco").get_matching_blocks() ``` currently works, but...

As a note: This is not a bug, since python-Levenshtein does not provide any guarantee, that matching_blocks includes the longest common substring. It bases the matching blocks on one of...

Editops uses the normal uniform Levenshtein distance, while ratio uses the InDel Distance (no Substitutions). In this specific implementation this is achived by giving substitutions a weight of 2 which...

This is not possible in python-Levenshtein, but at least one of them can be achieved in https://github.com/maxbachmann/RapidFuzz: > changes = editops(A, B, operations=('insert', 'delete', 'replace')) `changes = rapidfuzz.distance.Levenshtein.editops(A, B)` >...

`Ratio` is based on the InDel-Distance (only allows Insertions/Deletions), while the `distance` is based on the uniform Levenshtein distance. I suppose this is done, so the results of `ratio` are...

@toastdriven can we get this merged?

closing since at this point the project seems to be unmaintained