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")
(edit-distance "same" "sand")
(edit-distance "Saturday" "Sunday")
(find-nearest-edits str str-ls [max-distance])
Returns a list of strings in
with the smallest
edit distance to
, preserving order. If
is provided and positive, only return if
the edits are less or equal to that distance.