Binary package “ruby-levenshtein” in ubuntu noble
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-3build2 in amd64 (Release)
- ruby-levenshtein 0.2.2-3build4 in amd64 (Proposed)
- ruby-levenshtein 0.2.2-3build4 in amd64 (Release)
- ruby-levenshtein 0.2.2-3build2 in arm64 (Release)
- ruby-levenshtein 0.2.2-3build4 in arm64 (Proposed)
- ruby-levenshtein 0.2.2-3build4 in arm64 (Release)
- ruby-levenshtein 0.2.2-3build2 in armhf (Release)
- ruby-levenshtein 0.2.2-3build4 in armhf (Proposed)
- ruby-levenshtein 0.2.2-3build4 in armhf (Release)
- ruby-levenshtein 0.2.2-3build2 in ppc64el (Release)
- ruby-levenshtein 0.2.2-3build4 in ppc64el (Proposed)
- ruby-levenshtein 0.2.2-3build4 in ppc64el (Release)
- ruby-levenshtein 0.2.2-3build2 in riscv64 (Release)
- ruby-levenshtein 0.2.2-3build4 in riscv64 (Proposed)
- ruby-levenshtein 0.2.2-3build4 in riscv64 (Release)
- ruby-levenshtein 0.2.2-3build2 in s390x (Release)
- ruby-levenshtein 0.2.2-3build4 in s390x (Proposed)
- ruby-levenshtein 0.2.2-3build4 in s390x (Release)