There is a Text::Levenshtein module on CPAN, but it totally lacks documentation (what else is new !).
That is simply not true (--). The majority of modules of cpan have documentation. Ignorance is not bliss. http://search.cpan.org/author/DREE/Text-Levenshtein-0.03/Levenshtein.pm

As for how the algorithm works, Text::Lavenshtein links to http://www.merriampark.com/ld.htm#FLAVORS which explains it rather well.


MJD says you can't just make shit up and expect the computer to know what you mean, retardo!
I run a Win32 PPM repository for perl 5.6x+5.8x. I take requests.
** The Third rule of perl club is a statement of fact: pod is sexy.


In reply to Re: Levenshtein distance: calculating similarity of strings by PodMaster
in thread Levenshtein distance: calculating similarity of strings by spurperl

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":