Max Bachmann

I will test this in my implementation. However this is directly taken from the Python implementation (and appears to be the same in your implementation as well). I would personally...

This is possible in theory, but there are a couple of instructions which will hurt: 1) bit shifts: ```cpp HN = (HN

> but it would be really nice if there is some good use of SIMD, since virtually everyone has one nowadays. For shorter sequences I use SIMD to match multiple...

As a reference here are the improvements I implemented in rapidfuzz: 1) I implemented a bit more specialized hashmap: https://github.com/maxbachmann/rapidfuzz-cpp/blob/main/rapidfuzz/details/PatternMatchVector.hpp This implementation has the following advantages over the one in...

How did you install the module?

I assume you did not build the C extension first. In your case this can be done in place using ```python python setup.py build_ext --inplace ```

At least in case you installed using ``` pip install Levenshtein ``` This issue should not occur to the best of my knowledge.

Did you check whether levenshtein_cpp exists in the directory. The installation should not succeed unless it created this file. So I am unsure how you ended up with this broken...

I think this should start off with a similar interface to the levenshtein distance: ``` distance(s1, s2, *, weights=(1,1,1)) ``` which should be extended by support for float. In addition...

> As far as I understand, the existing distance implementations work on any unicode strings? Then why limit the character range to extended ASCII? One should be able to provide...