Comment by 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.
No comments yet
Contribute on Hacker News ↗