Use levenshtein_tabulation to be faster

ajmalsiddiqui / levenshtein-diff

A fast, generic implementation of Levenshtein's Algorithm for any kind of sequence, along with the ability to generate edits and regenerate the target sequence by applying edits to the source sequence.

MIT License

8 stars 3 forks source link

Use levenshtein_tabulation to be faster #7

Closed NickCondron closed 1 year ago

NickCondron commented 1 year ago

Benchmarks show that levenshtein_tabulation is 3-5x faster than levenshtein_memoization

ajmalsiddiqui commented 1 year ago

Let's merge this after we've merged the benchmark suite (#6 ) btw