Comment by rkagerer

4 months ago

This article ends too soon! Show me the techniques and solutions those clever programmers of old came up with. Did I miss a link somewhere to subsequent posts?

3 comments

rkagerer

Reply
ethan_smith  4 months ago

Early spellcheckers often used Bloom filters to efficiently store dictionaries in minimal memory - a probabilistic data structure that could determine if a word was "definitely not" or "possibly" in the dictionary using just a few bits per word.