Debian logoDebian Screenshots >


calculates the Levenshtein distance between two sequences


The Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance). The Levenshtein distance between two sequences is given by the minimum number of operations needed to transform one sequence into the other, where an operation is an insertion, deletion, or substitution of a single element.

This Ruby library can work on strings, arrays or any other objects provided the sequences respond to :each and the objects to :hash and :eql?.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.



809 other people were interested in this package here. The newest known version of this software is 0.2.2-2+b12 (Information last updated 1 day ago.)