in reply to Levenshtein distance: calculating similarity of strings

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.

  • Comment on Re: Levenshtein distance: calculating similarity of strings

Replies are listed 'Best First'.
Re: Re: Levenshtein distance: calculating similarity of strings
by spurperl (Priest) on Mar 25, 2003 at 06:27 UTC
    • When I said "what else is new" I didn't refer to CPAN modules, but the general practice of not commenting. I see how I could've been misunderstood
    • http://www.merriampark.com/ld.htm#FLAVORS indeed gives a step-by-step recipe to the algorithm, but if you read carefully you see that it doesn't go a bit into explaining why things are the way they are. My code does
    • To avoid further mis-understanding, I removed the offending phrase