Skip to content
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

Add score_cutoff to DamerauLevenshtein and Levenshtein #2

Open
symb10z opened this issue Nov 20, 2023 · 1 comment
Open

Add score_cutoff to DamerauLevenshtein and Levenshtein #2

symb10z opened this issue Nov 20, 2023 · 1 comment

Comments

@symb10z
Copy link

symb10z commented Nov 20, 2023

Hi, could you please add score_cutoff feature to DamerauLevenshtein and Levenshtein functions?
It would make function complete faster in case we need only word pairs having distance less or equal to score_cutoff.

score_cutoff (int, optional) – Maximum distance between s1 and s2, that is considered as a result. If the distance is bigger than score_cutoff, score_cutoff + 1 is returned instead. Default is None, which deactivates this behaviour.

See for reference: https://maxbachmann.github.io/RapidFuzz/Usage/distance/DamerauLevenshtein.html

@Mubelotix
Copy link

Send a PR

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants