Path to this page:
./

textproc/ruby-levenshtein,

*Calculates the Levenshtein distance between two byte strings*

**Branch:** pkgsrc-2018Q3,

**Version: **0.2.2,

**Package name:** ruby24-levenshtein-0.2.2,

**Maintainer: **pkgsrc-usersThe 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.

The two sequences can be two strings, two arrays, or two other

objects responding to :each. All sequences are by generic

(fast) C code.

All objects in the sequences should respond to :hash and :eql?.

More information about the Levenshtein distance algorithm:

http://en.wikipedia.org/wiki/Levenshtein_distance .

**Required to run:**[

lang/ruby24-base]

**Required to build:**[

pkgtools/cwrappers]

### Master sites:

**SHA1:** 7408d9adc53cba7ad4b37dd82026a9b8fabb49de

**RMD160:** e75ce89b5692a0853d93eb94a6dd20242e4dec07

**Filesize:** 7.5 KB

### Version history: (Expand)

- (
**2018-10-22**) Package added to pkgsrc.se, version **ruby24-levenshtein-0.2.2** (created)