Anonymous user
Levenshtein distance/Alignment: Difference between revisions
m
whitespace cleanup
(Racket) |
m (whitespace cleanup) |
||
Line 83:
<pre>ro-settac-o-de
raisethysword-</pre>
=={{header|Racket}}==
This solution only computes the distance.
See http://blog.racket-lang.org/2012/08/dynamic-programming-versus-memoization.html
for a discussion of the code.
<lang racket>#lang racket
(define (memoize f)
Line 111 ⟶ 108:
(min (add1 (levenshtein (rest s) t))
(add1 (levenshtein s (rest t)))
(add1 (levenshtein (rest s) (rest t)))))]))))</lang>
Demonstration:
<lang racket>(levenshtein (string->list "rosettacode") ▼
(string->list "raisethysword"))</lang>▼
▲(levenshtein (string->list "rosettacode")
▲ (string->list "raisethysword"))
| |||