-
Notifications
You must be signed in to change notification settings - Fork 1
Iterative Levenshtein distance #21
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
Conversation
|
Can you add the benchmark first in a separate PR? |
Yes, but most of the benchmark is failing on the current master branch :/ You think that's ok? |
Nevermind then... |
|
What's missing now is a test in the default test suite to make sure no RecursiveError will be re-introduced. Edit: hmmm, the benchmark for PRs will then fail... so I guess it's in place already :) |
This makes it possible to have diffs of lists of over 200 elements, which it can't handle now because of recursion error.
Related issue: #7
Note: this is another collab between Claude Code and me. The iterative Levenshtein part went pretty well, but the padding part needed some more guidance.