Text::Levenshtein 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. WWW: http://search.cpan.org/dist/Text-Levenshtein/ ' title='freebsd-ports-gnome Git repository'/>
aboutsummaryrefslogtreecommitdiffstats
path: root/math/matrix
Commit message (Expand)AuthorAgeFilesLines
* - Get Rid MD5 supportmiwi2011-03-201-1/+0
* BROKEN should not be quoted.erwin2010-06-13