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
So I guess the question is, how 'expensive' would it be in terms of processing power. We would have to have some sort of limits, so that it only checks certain frequently obfuscated words..... - C ------------------------------------------------------- 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
