[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#703189: ITP: ruby-levenshtein -- calculates the Levenshtein distance between two sequences



Package: wnpp
Severity: wishlist
Owner: Jérémy Bobbio <lunar@debian.org>

* Package name    : ruby-levenshtein
  Version         : 0.2.2
  Upstream Author : Erik Veenstra <levenshtein@erikveen.dds.nl>
* URL             : http://www.erikveen.dds.nl/levenshtein/index.html
* License         : GPL-2
  Programming Lang: Ruby
  Description     : 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?.

-- 
Jérémy Bobbio                        .''`. 
lunar@debian.org                    : :Ⓐ  :  # apt-get install anarchism
                                    `. `'` 
                                      `-   

Attachment: signature.asc
Description: Digital signature


Reply to: