re: #236 klys

Dynamic programming was specifically disallowed.

Although the recursive implementation has its own elegance, as long as you don’t mind exponential runtime…

levenshtein distance is dynamic programming, and also recursive

it’s dynamic programming since it “memo-izes” to keep track of the total number of inserts, deletes, and transpositions