edit distance algorithm in Haskell - performance tuning

Question

I\'m trying to implement the levenshtein distance (or edit distance) in Haskell, but its performance decreases rapidly when the string lenght increases.

I\'m still q

Answer 1

You need to memoize editDistance'. There are many ways of doing this, e.g., a recursively defined array.