Wed, 11 Nov 2026 16:25:02 UTC Log in
Calculates the Levenshtein distance between two byte strings 23.43 KB built 2026-10-17 21:05:07 GMT

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.

Dependencies

9 total
Requires7
  • gcc
  • rpmlib(CompressedFileNames) <= 3.0.4-1
  • rpmlib(FileDigests) <= 4.6.0-1
  • ruby(release)
  • ruby-devel
  • rubygem(test-unit)
  • rubygems-devel
Provides2
  • rubygem-levenshtein = 0.2.2-44.fc45
  • rubygem-levenshtein-doc = 0.2.2-44.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances

Files

2
Files 1–2 of 2

Component of

buildroots that installed this RPM

No Buildroots