On Tue, 20 Jan 2004, Marcus Frischherz wrote: > But there is: there exists (at least in PHP) a function called > levenshtein, which calculates the similarity between two words. Surely > there must exist a perl equivalent to it. see: > http://at.php.net/manual/en/function.levenshtein.php
I wonder if agrep could be helpfull : http://www.tgries.de/agrep/ AGREP is a powerful tool for fast searching a file or many files for a string or regular expression, with approximate matching capabilities and user-definable records. It was developed 1989-1991 by Udi Manber and Sun Wu at the University of Arizona and many others (please read CONTRIB.TXT and MANUAL.DOC). AGREP is similar to egrep (or grep or fgrep), but it is much more general and usually faster. It also supports many kinds of queries including arbitrary wild cards, sets of patterns, and in general, regular expressions. It supports most of the options supported by the GREP family plus several more (but it is not 100% compatible with grep) Ahh -- and there is a perl module String::Approx that uses the same algorithm. http://search.cpan.org/src/JHI/String-Approx-3.23/README ========================================================== Chris Candreva -- [EMAIL PROTECTED] -- (914) 967-7816 WestNet Internet Services of Westchester http://www.westnet.com/ ------------------------------------------------------- The SF.Net email is sponsored by EclipseCon 2004 Premiere Conference on Open Tools Development and Integration See the breadth of Eclipse activity. February 3-5 in Anaheim, CA. http://www.eclipsecon.org/osdn _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
