view release on metacpan or  search on metacpan

README  view on Meta::CPAN

    documents.

    XML::Similarity

    ** Between images

    Image::Similar

    ** Between strings/texts

    Similarity between two text can be calculated using Levenshtein edit
    distance. There are several levenshtein modules on CPAN, among others:
    Text::Levenshtein, Text::Levenshtein::XS, Text::Levenshtein::Flexible,
    Text::LevenshteinXS, Text::Fuzzy. For more details, see
    Bencher::Scenario::LevenshteinModules.

    Soundex can also be used. Some example soundex moduless: Text::Soundex,
    Text::Phonetic::Soundex.

    Algorithm::HowSimilar uses Algorithm::Diff to calculate similarity
    between two strings. It's roughly similar in speed to pure-perl

lib/Acme/CPANModules/Similarity.pm  view on Meta::CPAN

<pm:XML::Similarity>


** Between images

<pm:Image::Similar>


** Between strings/texts

Similarity between two text can be calculated using Levenshtein edit distance.
There are several levenshtein modules on CPAN, among others:
<pm:Text::Levenshtein>, <pm:Text::Levenshtein::XS>,
<pm:Text::Levenshtein::Flexible>, <pm:Text::LevenshteinXS>, <pm:Text::Fuzzy>.
For more details, see <pm:Bencher::Scenario::LevenshteinModules>.

Soundex can also be used. Some example soundex moduless: <pm:Text::Soundex>,
<pm:Text::Phonetic::Soundex>.

<pm:Algorithm::HowSimilar> uses Algorithm::Diff to calculate similarity between
two strings. It's roughly similar in speed to pure-perl Levenshtein modules, and

lib/Acme/CPANModules/Similarity.pm  view on Meta::CPAN

documents.

L<XML::Similarity>

** Between images

L<Image::Similar>

** Between strings/texts

Similarity between two text can be calculated using Levenshtein edit distance.
There are several levenshtein modules on CPAN, among others:
L<Text::Levenshtein>, L<Text::Levenshtein::XS>,
L<Text::Levenshtein::Flexible>, L<Text::LevenshteinXS>, L<Text::Fuzzy>.
For more details, see L<Bencher::Scenario::LevenshteinModules>.

Soundex can also be used. Some example soundex moduless: L<Text::Soundex>,
L<Text::Phonetic::Soundex>.

L<Algorithm::HowSimilar> uses Algorithm::Diff to calculate similarity between
two strings. It's roughly similar in speed to pure-perl Levenshtein modules, and