On Wed, 31 Dec 2003, Rich Puhek wrote: > Would something like "excessive" instances of /(\w)\1/ work?
Yes, that sounds like a good idea. Which leads back to the request I made previously for a mechanism to COUNT the number of occurences of a match, for 'excessive' use of something that is legitimate in small numbers.... > ...... Fortunatly, Bayes should eat up the double-letter obfuscations... UNfortunately, I see Bayes getting knocked down by the latest round of 'quote an online book' style of spams..... :-( - C ------------------------------------------------------- This SF.net email is sponsored by: IBM Linux Tutorials. Become an expert in LINUX or just sharpen your skills. Sign up for IBM's Free Linux Tutorials. Learn everything from the bash shell to sys admin. Click now! http://ads.osdn.com/?ad_id=1278&alloc_id=3371&op=click _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
