Levenshtein distance/Alignment: Difference between revisions

m
(→‎{{header|Racket}}: Extends solution to show the alignments)
Line 310:
(cons sx (lev-s old))
(cons tx (lev-t old))))
 
(define (min/lev-n . l)
(car (sort l < #:key lev-n)))
 
(define (list-repeat n v)
Line 334 ⟶ 331:
[else
(if (equal? (first s) (first t))
(lev-add (levenshtein/list (rest s) (rest t))
0 (first s) (first t))
(min/argmin lev-n (list (lev-add (levenshtein/list (rest s) t)
1 (first s) #\-)
(lev-add (levenshtein/list s (rest t))
1 #\- (first t))
(lev-add (levenshtein/list (rest s) (rest t))
1 (first s) (first t)))))]))))
 
(define (levenshtein s t)
Anonymous user