csua.com/?entry=faq1 -> compilers.cs.ucla.edu/%7Ekchang/motd/?entry=faq1
Comparison of entries is not simple unix diff, rather it is independent of white spaces and words. If one entry is at least 85 similar to another entry, the later entry is taken while both the responses are merged. How come entries on Kais Motd seem longer than the other primitive, RCS/CVS motd archivers?
So even if some responses are changed and/or censored, Kais Motd does its best merging new responses. Case in point, look at the following highly censored post that lasted for 6 days.
So trying to time a highly controversial troll to be archived is futile because itll most likely be deleted by other people before its polled. In addition, even if its polled and archived, other Kais Motd superusers not me will most likely delete it.
Polling is done anywhere between 1-4 times a day on a PURE RANDOM schedule. So if your entry got deleted, then it didnt get lucky enough to be polled and saved at the right time. If you want a comprehensive motd, there are other RCSed entries motd,v you can look at.
To go a step further, how would a computer categorize the following sentence: How many Republicans does it take to screw a lightbulb? Well, its easy for human beings to recognize that it is a prelude to a joke, but I know of no algorithm that could recognize this highly context sensitive sentence, reliably. If youd like to help, you can volunteer to be a Kais Motd superuser and manually categorize and/or set rules. Couldnt I break the system by totally messing up the motd entries?
In contrast my UCLA account has about 3000X more space than my CSUA account, 4X the processor speed per processor, and has 4 processors. Also I can run power hungry lexical/context matching algorithms exponential time if I seriously want to for a whole night without getting squished.
|