I created a totally stupid game called “Word Freq”. It simply asks you which of two randomly chosen n-grams (presently, only 2-grams are included) appears more often in the Google n-gram database.

It’s kind of fun tho.

Play it here.

I’m downloading and processing the 3-grams now, but they’re really big — like several terabytes of data. Then I guess I’ll merge the 1-grams, 2-grams, and 3-grams, so that you can have interesting matchhups like “conformity” vs “the policy of”.

Next post: Projective

Previous post: Computers and law