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.

Sign up for GitHub

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

Jump to bottom

Time Complexity Details of find_near_matches Function #47

Open
AAnirudh07 opened this issue Aug 9, 2024 · 0 comments
Open

Time Complexity Details of find_near_matches Function #47

AAnirudh07 opened this issue Aug 9, 2024 · 0 comments

Comments

@AAnirudh07
Copy link

AAnirudh07 commented Aug 9, 2024 •
edited
Loading

Hi @taleinat,
Thank you for creating and maintaining the fuzzysearch library! I was wondering if you could provide some information regarding the time complexity of the find_near_matches function with the levenshtein distance?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@AAnirudh07