This was my April fools post – the paper was autogenerated using SCIgen (who has fooled quite a few in the past). It uses hand-written context-free grammar to put the paper together. The link to the paper is temporary which is why it expired. The abstract is complete poppycock, it even contradicts itself. The rest of the paper was very amusing and made no sense either.
Do go and generate your own – it’s funny.
On the quiet for the past 6 months together with Steve Gerenscer, David Harry, James Morris and Samir Balwani, I have been writing a paper called “A case for online algorithms”
. After much much work involving trawling through vast quantities of data and spending many hours evaluating our findings, we are ready to unleash our work on you.
We are all very excited about it and hope that you will benefit from the information and insight offered. As an SEO you will have a far greater understanding of online algorithms than you ever had the opportunity to before. Obviously you will not get a gold ticket to the secrets of the search engines and so on, but…it’s pretty close.
The main topic area as you may have guessed from the title is online algorithms. We have covered everything from PageRank to Twitter metrics and tested them all against each in their respective functions of course.
We will remove the paper from its online home soon so if the link is now dead, get in touch and we’ll arrange for you to have a copy.
I won’t hide the fact that it is pretty heavy going but you can of course approach any of the authors and they will happily fill you in:
Abstract:
“Checksums and active networks, while confusing in theory, have not until recently been considered intuitive. In fact, few physicists would disagree with the natural unification of model checking and congestion control. We use flexible configurations to argue that the famous wireless algorithm for the understanding of replication by F. Sasaki is Turing complete. Of course, this is not always the case.”
Enjoy the ride 
Nice paper! Definitely a must-read for everybody in the field of online algorithms
lol
I found the comparison of the simple and complex Bayesian filters combined with the Spearmand and Jaccard indexes to be the best allegory to the difference between Yahoo and Google’s algorithm.
Very telling and insightful looks at what’s really going under the hood of those sneaky search engines.
I really wish you guys did a deeper dive on the handling of the Anaphora Resolution and the tokenization of the Named Entity Recognition with comparison to the Live / Powerset algo.
I must say, a very excellent read! Also it was written so simply that even my grandma who barely knows how to check her “Hotmail” understood all the concepts.
Thank you, we did strive to write for the layman, in fact we tested it on a group of grandma’s.
Could i have a copi of the report?
Thank you
hi, it seems the link doesn’t work. could you provide me a working one?
ohh no, i don’t believe it
damn april 1! 
Brilliant. You totally had me fooled. The abstract was baffling, but then I expected to be baffled.
fantastic blog this is what ive been looking for cheers SEO
Great site, I have been looking into google algorithms and i am glad I found this. Keep up the great work! All the best
Thank you, I’m glad it’s useful to you.