Sat, 21 Nov 2026 13:24:24 UTC Log in
Implementation of the Levenshtein edit distance 35.24 KB built 2026-10-17 01:53:11 GMT

Description

This module implements the Levenshtein edit distance. The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. To learn more about the Levenshtein metric, have a look at the Wikipedia page <http://en.wikipedia.org/wiki/Levenshtein_distance>.

Dependencies

18 total
Requires17
  • make
  • perl(Carp)
  • perl(Exporter)
  • perl(ExtUtils::MakeMaker) >= 6.76
  • perl(List::Util)
  • perl(Test::More) >= 0.88
  • perl(Unicode::Collate) >= 1.04
  • perl(lib)
  • perl(open)
  • perl(parent)
  • perl(strict)
  • perl(utf8)
  • perl(warnings)
  • perl-generators
  • perl-interpreter
  • rpmlib(CompressedFileNames) <= 3.0.4-1
  • rpmlib(FileDigests) <= 4.6.0-1
Provides1
  • perl-Text-Levenshtein = 0.15-13.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