hiddentao/fast-levenshtein

Investigate further optimizations of the algorithm

hiddentao opened this issue · 3 comments

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

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!

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

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