An implementation of the Levenshtein edit distance

Edit Package perl-Text-Levenshtein
http://search.cpan.org/dist/Text-Levenshtein

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. A good point to start is:

&fastdistance can be called with two scalars and is faster in most cases.

See also Text::LevenshteinXS on CPAN if you do not require a perl-only
implementation. It is extremely faster in nearly all cases.

See also Text::WagnerFischer on CPAN for a configurable edit distance, i.e. for
configurable costs (weights) for the edits.

Refresh
Refresh
Source Files
Filename Size Changed
Text-Levenshtein-0.15.tar.gz 0000015797 15.4 KB
cpanspec.yml 0000000547 547 Bytes
perl-Text-Levenshtein.changes 0000001323 1.29 KB
perl-Text-Levenshtein.spec 0000002116 2.07 KB
Latest Revision
Dominique Leuenberger's avatar Dominique Leuenberger (dimstar_suse) accepted request 1112337 from Tina Müller's avatar Tina Müller (tinita) (revision 6)
initialized devel package after accepting 1112337
Comments 0
openSUSE Build Service is sponsored by