![]() ![]() Added specialized implementation of the Levenshtein distance for cases with a small maximum edit distance, that is even faster, than the bit-parallel implementation.Added bit-parallel implementation of the Levenshtein distance for the weights (1,1,1) and (1,1,2).increased test coverage, that already helped to fix some bugs and help to prevent regressions in the future. ![]() Implementation of the C++ Wrapper completely refactored to make it easier to add more scorers, processors and string matching algorithms in the future.all normalized string_metrics can now be used as scorer for process.extract/extractOne.significantly improve performance of rapidfuzz.string_metric.levenshtein for max performance is improved by around 10%-20%.improve performance and memory usage of rapidfuzz.string_metric.levenshtein_editops.process.cdist did raise an exception when used with a pure python scorer. ![]() deprecate rapidfuzz.string_metric (will be removed in v3.0.0).new functions will not get support for this in the first place.deprecate support to specify processor in form of a boolean (will be removed in v3.0.0).dropped support for Python2.7 and Python3.5.remove the rapidfuzz.levenshtein module which was deprecated in v1.0.0 and scheduled for removal in v2.0.0.Stop including all modules in _init_.py, since they significantly slowed down import time.Build system moved from setuptools to scikit-build.when the result of string_metric.levenshtein or string_metric.hamming is below max.add Indel distance along with the corresponding editops function.port existing distances to this new api.added new scorers in rapidfuzz.distance.*.Programming language which allows the usage of C-Apis (C/C++/Rust) ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |