Revision as of 13:47, 30 June 2019 view source Giacomo (talk \| contribs) 124 edits →‎Iterative space optimized (even bounded) ← Older edit		Revision as of 04:59, 14 July 2019 view source rosettacode>Spoon! m →‎{{header\|Haskell}}: make the types more general Newer edit →
Line 1,653: =={{header\|Haskell}}== <lang haskell>levenshtein :: ~~String~~Eq a => [a] -> ~~String~~[a] -> Int levenshtein s1 s2 = last $ foldl transform [0 .. length s1] s2 where

Levenshtein distance: Difference between revisions