Remember Levenshtein Distance: the number of changes to turn one string into another? Here’s a naͯve implementation in Clojure:
Remember Levenshtein Distance: the number of changes to turn one string into another? Here’s a naͯve implementation in Clojure: