On Wednesday 25 June 2003 11:32, Per Björklund wrote: > Wouldn't it be possible to expand all tests so that they can match all > those p0rn, rem0ve and g1rls and so on, like the example I created below?
Listing every possible permutation could be quite difficult. How about "normalizing" the text as well as the patterns? Something like soundex, but adapted for 133+sp34k. And for rules searching for words the score could be modified by some function of the weighted levensthein (sp?) distance. I'm sure this would at least squeeze some decipoints out of the message, but I've no idea whether it'd be worthwile and how much it'd impact server load. MfG, Ulrich -- Heinz Ulrich Stille / Tel.: +49-541-9400463 / Fax: +49-541-9400450 design_d gmbh / Lortzingstr. 2 / 49074 Osnabrück / www.design-d.de ------------------------------------------------------- This SF.Net email is sponsored by: INetU Attention Web Developers & Consultants: Become An INetU Hosting Partner. Refer Dedicated Servers. We Manage Them. You Get 10% Monthly Commission! INetU Dedicated Managed Hosting http://www.inetu.net/partner/index.php _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
