Skip to content

Tags: agext/levenshtein

Tags

v1.2.3


    

v1.2.2

update CI settings

v1.2.1

Minor code cleanup; updated docs and ci settings

v1.2

Improved distance calculation speed when a maximum cost is set.

- Reduced complexity from O(max(|s1|,|s2|)*maxCost) to O(min(|s1|,|s2|)*maxCost).
- Bypass the calculation when distance is guaranteed to be greater than maxCost.
- Added tests for more edge cases.

v1.1

Improved distance calculation speed when a maximum cost is set.

- Reduced complexity from O(|s1|*|s2|) to O(max(|s1|,|s2|)*maxCost).
- Ignore maxCost when it would not help shorten the calculation.

v1.0

First release