Levenshtein distance runs into stackoverflow error for longer strings

[rbuchmann]

I used it to compare strings of around 130 characters length. The clj-fuzzy implementation doesn't crash and yields a distance of around 40.

[rm-hull]

Can you provide a simple test case please?

[rbuchmann]

Sure:

(def s "some pretty long string with ")
(def e " uuids in the middle")

(defn t [n]
  (str s (str/join "," (repeatedly n #(str (java.util.UUID/randomUUID)))) e))

(levenshtein/distance (t 2) (t 2))