Packages not in Groups

perl-Text-Levenshtein - Implementation of the Levenshtein edit distance

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>
License:GPL or Artistic Group:Packages not in Groups
URL:http://search.cpan.org/dist/Text-Levenshtein/ Source: perl-Text-Levenshtein

Packages

Name Version Release Type Size Built
perl-Text-Levenshtein 0.05 3.fc6 noarch 8 KiB Mon Aug 28 20:44:53 2006

Changelog

* Mon Aug 28 18:00:00 2006 Steven Pritchard <steve{%}kspei{*}com> 0.05-3
- Improve Summary, description, and Source0 URL.
- Fix find option ordering.
- Don't generate license files.
* Fri Sep 16 18:00:00 2005 Steven Pritchard <steve{%}kspei{*}com> 0.05-2
- Remove core module Test::More dependency.
* Sat Aug 27 18:00:00 2005 Steven Pritchard <steve{%}kspei{*}com> 0.05-1
- Specfile autogenerated.

Listing created by RepoView-0.5.2-1.fc6 (modified)