Max Bachmann

This license change is not this simple. The library includes a copy of the Levenshtein implementation from https://github.com/ztane/python-Levenshtein, which is GPL licensed. As noted here: https://github.com/xdrop/fuzzywuzzy/issues/84 I maintain a complete...

> I think we could help with a port/jni wrapper ;) It seems we can allocate one person to work on this topic. Sounds good. You can find the C++...

It is not possible to use python-Levenshtein in a MIT Licensed library, which is the reason FuzzyWuzzy has the GPL license. The MIT licensed version only uses difflib (slow), but...

@Chase22 I do something similar already for Python. When using small strings with a fast similarity metric there is a relevant performance impact. However the main reason for this is...

> why does this and this return as 100 percent matched? The correct result would be 74, so a result of 100 would be a bug.

btw https://nextcloud.com/blog/encryption-in-nextcloud/ bindet auch entsprechend die Bilder ein. Da kannst du dir eine entsprechende Implementierung anschauen. Mache das gerade auch für meine Webseite ;)

> In the moment I'm struggling with strings longer 64 in the Lev, because Hyrrö doesn't describe how to take care of the carry bit. Myers does. That's why I...

> LCS had the same problem. My working Perl implementation: https://github.com/wollmers/LCS-BV/blob/master/lib/LCS/BV.pm I have an implementation for blockwise LCS here: https://github.com/maxbachmann/rapidfuzz-cpp/blob/ea90dd443b3ec40eb244e2810ec7082f73a6ab77/rapidfuzz/distance/LCSseq.impl#L127 It requires you to store the carry for `S +...

I will contact you via e-mail

> I think this wasn't a problem in python because the python find_longest_match does a weird iterative solution different from ours. Not sure whether it helps, but here is my...