Levenshtein distance
This is a straightforward, but inefficient, recursive Haskell implementation of a codice_1 function that takes two strings, "s" and "t", together with their lengths, and returns the Levenshtein distance between them: