Levenshtein distance/Alignment: Difference between revisions
m
Promote to task, lots of examples, little controversy
Thundergnat (talk | contribs) (Rename Perl 6 -> Raku, alphabetize, minor clean-up) |
Thundergnat (talk | contribs) m (Promote to task, lots of examples, little controversy) |
||
Line 1:
{{
The [[Levenshtein distance]] algorithm returns the number of atomic operations (insertion, deletion or edition) that must be performed on a string in order to obtain an other one, but it does not say anything about the actual operations used or their order.
| |||