- edit-distance s1 s2procedure
Returns the levenshtein distance between s1 and s2 - a cost of 1 per character insertion, deletion, or update. Runs in quadratic time and linear memory.
(edit-distance "same" "same") ; => 0 (edit-distance "same" "sand") ; => 2 (edit-distance "Saturday" "Sunday") ; => 3