Dynamic optimization in levenshtein distance #3
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I tried to write a more efficient implementation for levenshtein distance, forgive me if the code is a bit messy, didn't have time for aesthetics. Anyway benchmarks I ran show appreciable performance benefit:
of course there is still much room for further optimization, but I think it's a starting point!
Since computational complexity is
O(n*m)
it won't scale well on large strings, I tried on moderately long strings as pointed out in #1 and with following inputelm-benchmark
gives 92 runs/s on my laptop (i3-6006U).I added fuzz testing just to be sure there aren't uncovered edge cases.