Re: If anybody wants to make something in Ada but do not know what

["Tarjei T. Jensen" <tarjei@online.no>]

Randy Brukardt wrote:
> That might prevent passing spam, but it does nothing to avoid the
> overhead. The problem is in order to find out the strongest indicator,
> you have to score every 'word' in the message. When a lot of trash words
> are in the message, you have to allocate new words and new counters for
> them; and when there are a lot of such messages, the size of the DB
> grows rapidly. (We saw this happen in the search engine when we
> accidentially indexed some Unix .lib files.) That adds overhead; a lot
> of overhead for a filter like mine which gets invoked on each message
> individually. (Writing out the word list each time is expensive.)

Why not do it another way: Check all URL in the message. If they point to a
know porn/spam server, mark it as suspect. Then do some processing on what
is left of the text.

One could also obtain some sort of unique signature from the mail. Then
compare that to other messages received. If a lot of messages have the same
signature, then they are likely to be spam. Known mailing lists will of
course be excluded. The only problem is to generate a signature that is not
trivial to evade. Preferably there should be a number of signatures
algorithms to choose from, so that it becomes difficult to optimize the mail
for all of them since the spammer can't know which algorithm is used any
given day or hour. The algorithm would of course be chosen arbitrarily at
each site.

greetings,