Binary package “ruby-levenshtein” in ubuntu jammy
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?.
Source package
Published versions
- ruby-levenshtein 0.2.2-2build9 in amd64 (Release)
- ruby-levenshtein 0.2.2-2build11 in amd64 (Proposed)
- ruby-levenshtein 0.2.2-2build11 in amd64 (Release)
- ruby-levenshtein 0.2.2-2build9 in arm64 (Release)
- ruby-levenshtein 0.2.2-2build11 in arm64 (Proposed)
- ruby-levenshtein 0.2.2-2build11 in arm64 (Release)
- ruby-levenshtein 0.2.2-2build9 in armhf (Release)
- ruby-levenshtein 0.2.2-2build11 in armhf (Proposed)
- ruby-levenshtein 0.2.2-2build11 in armhf (Release)
- ruby-levenshtein 0.2.2-2build9 in ppc64el (Release)
- ruby-levenshtein 0.2.2-2build11 in ppc64el (Proposed)
- ruby-levenshtein 0.2.2-2build11 in ppc64el (Release)
- ruby-levenshtein 0.2.2-2build9 in riscv64 (Release)
- ruby-levenshtein 0.2.2-2build11 in riscv64 (Proposed)
- ruby-levenshtein 0.2.2-2build11 in riscv64 (Release)
- ruby-levenshtein 0.2.2-2build9 in s390x (Release)
- ruby-levenshtein 0.2.2-2build11 in s390x (Proposed)
- ruby-levenshtein 0.2.2-2build11 in s390x (Release)