> -----Original Message----- > From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] > Sent: Friday, November 07, 2003 2:10 AM > To: [EMAIL PROTECTED] > Subject: [SAtalk] Re: 'random' character sets > > > On Thu, 06 Nov 2003 10:58:59 -0800, Greg Webster <[EMAIL PROTECTED]> > posted to spamassassin-talk: > > A thought on spammers oft-used sets of 'random' character lists in > > emails...an example: > > > > gnqplleqhzblll > > u > > wfjmvfe upvxoi lwhm > > xqs > > flckwrtsmufx irwajksqsnw er wcfjgfmk jugxfq > *snip good stuff*
You know, the answer to this, is the answer to many questions. The solution is the much needed accumulator eval. Yes you can get some FPs on 3-5 consonants. But what if you set this rule to only hit if 4+ hits were found of this rule? That would lesson the amount of FPs greatly. Many of us are finding we hit limits with simple regex rules. To me, an accumulator eval for rules is the next logical step. Make sense? --Chris Santerre ------------------------------------------------------- This SF.net email is sponsored by: SF.net Giveback Program. Does SourceForge.net help you be more productive? Does it help you create better code? SHARE THE LOVE, and help us help YOU! Click Here: http://sourceforge.net/donate/ _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
