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

Investigate further optimizations of the algorithm #1

Closed
hiddentao opened this issue Apr 18, 2013 · 3 comments
Closed

Investigate further optimizations of the algorithm #1

hiddentao opened this issue Apr 18, 2013 · 3 comments

Comments

@hiddentao
Copy link
Owner

We don't need to store the current row, just the last value calculated in the current row. Implement this optimization.

@wooorm
Copy link

wooorm commented Jul 9, 2014

Just wanted you to know that I've implemented this enhancement in my levenshtein module – It was a bit hard to bend by brain around, but in the end it worked out great. You should implement it too!

@hiddentao
Copy link
Owner Author

@wooorm Thanks. I've added in this optimization and imported your benchmark tests (please see the README.md for results).

@wooorm
Copy link

wooorm commented Jul 10, 2014

Nice job, although bittersweet: now I have to make my module faster! 👍

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

No branches or pull requests

2 participants