levenshtein2 / 0.1.0
| Short description: | A metric for the amount of difference between two sequences. | |||||
|---|---|---|---|---|---|---|
| Category: | Library/Text | |||||
| Status: | beta | |||||
| Created: | 2008-07-12 11:15:45 GMT | |||||
| Last update: | 2008-07-12 11:15:45 GMT | |||||
| Owner: | Erik Veenstra (Projects of this owner) | |||||
| Homepage: | http://www.erikveen.dds.nl/levenshtein/doc/index.html | |||||
| Download: | http://rubyforge.org/projects/levenshtein/ | |||||
| License: | GPL | |||||
| Dependency: |
|
|||||
| Description: | 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 strings is given by the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character.
|
|||||
| Versions: | [0.2.1 (2012-02-11)] [0.1.0 (2008-07-12)] | |||||