-
Notifications
You must be signed in to change notification settings - Fork 155
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Operation weights not configurable #86
Comments
You can use the Levenshtein fork for this
Which allows the following:
A future release will allow the usage of character dependent weights as well: rapidfuzz/RapidFuzz#241 |
Is there any reference on which of these functions are fastest vs. slowest? We need to sort through about 10,000 search items very quickly. Or I can experiment with them. And is there any maintenance work being done on the old version? We are supporting Python 3.4 still, and the new maintainer isn't providing backwards compatibility. Perhaps we can back port a few essentials? |
The
No only the latest version is maintained
I am this new maintainer ;)
The biggest problem is the fact, that
It is not really worth it to maintain support for other versions, since the user base is really slim and most of them can just use an older version of the projects. Python 3.4 is a special case, since it was never supported by the library. I did have support for Python 2.7 + Python 3.5 until |
It's only one query over 10k items. But fairly long items and has to be <100ms ideally. The original library Python 3.5 would be a good start. I'm not sure where the Old pip versions also don't respect |
for long items the new implementation is significantly faster: A large amount of those performance advantages did already exist prior to rapidfuzz v2.0
in case the old implementation worked for you, you can always just pin it
This function was new in v2.0.0 of rapidfuzz. v1.9.1 is the last version which supported Python 3.5. In this older version there is
Generally I mention these changes in the changelog: https://github.com/maxbachmann/RapidFuzz/blob/main/CHANGELOG.rst:
|
Hello.
Generally Lev allows configurable weights, I'd really like to see that here as using Lev as a substring "approximate" matcher doesn't work when the insert op is weighted the same as other operations. It's hard to tweak search results when the weights cannot be changed.
The text was updated successfully, but these errors were encountered: