4 ms·
To implement this space-efficiently, I wrote a compressed bloom filter: http://github.com/lsb/gcs http://github.com/lsb/gcs It's more space efficient than a st
by lsb 14y ago
To implement this space-efficiently, I wrote a compressed bloom filter: http://github.com/lsb/gcs http://github.com/lsb/gcs
It's more space efficient than a standard bloom filter, runs in constant memory on the server, and has pretty fast performance in Javascript in browsers too.
Check out the description of a Golomb-compressed sequence at http://algo2.iti.kit.edu/singler/publications/cacheefficientbloomfilters-wea2007.pdf http://algo2.iti.kit.edu/singler/publications/cacheefficient...
- winter_blue 14y agoI'm not sure what exactly the page does... It seems to me like a word gets greener if it's longer... What exactly does the algorithm do to computer the color?
- lsb 14y agoClicking on the word gives you more info. Blue = not found in GBooks 1grams. Green = high-entropy word. Red = very low-entropy word (<10 bits in a 1gram model). Orange = low-entropy word (<8 bits in a 2gram or 3gram model).