Package : perl-Text-Levenshtein > RPM : perl-Text-Levenshtein-0.150.0-1.mga9.src.rpm
Basic items
| Name | perl-Text-Levenshtein |
| Version | 0.150.0 |
| Release | 1.mga9 |
| URL | https://metacpan.org/release/Text-Levenshtein |
| Group | Development/Perl |
| Summary | An implementation of the Levenshtein edit distance |
| Size | 19KB |
| Arch | noarch |
| License | GPL+ or Artistic |
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. A good point to start is:
<http://www.merriampark.com/ld.htm>
&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.
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:
<http://www.merriampark.com/ld.htm>
&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.
Media information
| Distribution release | Mageia cauldron |
| Media name | core-release |
| Media arch | i586 |
Advanced items
| Source RPM | NOT IN DATABASE ?! |
| Build time | 2022-04-19 11:10:08 |
| Changelog | View in Sophie |
| Files | View in Sophie |
| Dependencies | View in Sophie |