calculates the Levenshtein distance between two sequences
DescriptionThe 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?.
541 other people were interested in this package here. The newest known version of this software is 0.2.2-2+b9 (Information last updated 7 days ago.)
Upload new screenshots
Thanks for uploading more screenshots. Please note:
- Your screenshot should contain a typical scene when working with it.
- Your screenshots must be in PNG format.
- You can upload multiple images at once.
- Screenshots are made public and can freely be used by anyone.