rubygem-levenshtein

Calculates the Levenshtein distance between two byte strings


Up to date: Yes

Gitweb repository: http://pkgs.fedoraproject.org/cgit/rubygem-levenshtein.git

SPEC file: http://pkgs.fedoraproject.org/cgit/rubygem-levenshtein.git/tree/rubygem-levenshtein.spec

Upstream url: http://www.erikveen.dds.nl/levenshtein/doc/index.html

Maintainer: mtasaka

Git Commits: 8

Last packager: Fedora Release Engineering

Last commit message: Rebuilt for https://fedoraproject.org/wiki/Fedora_23_Mass_Rebuild

Last commit date: June 18, 2015 12:00

Description: Calculates the Levenshtein distance between two byte strings. 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.

Rawhide Fedora 24 Fedora 23 Gem Version
0.2.2 0.2.2 0.2.2 0.2.2

Dependency Tree

Dependencies: 1

Package Environment Rawhide f24 f23 Upstream
rubygem-minitest development 5.8.4 5.8.4 5.3.1 5.9.0

No dependents

No bugs found!

Build ID Title
731079 rubygem-levenshtein-0.2.2-10.fc24
710835 rubygem-levenshtein-0.2.2-9.fc24
661019 rubygem-levenshtein-0.2.2-8.fc23