bloom

Definition

Two distinct referents. A Bloom filter is a compact probabilistic structure for set membership: it can say maybe present when an item is absent, but it never misses an item that is present, so it works as a cheap pre-filter in front of an expensive lookup. BLOOM in full capitals is instead the multilingual open large language model from the BigScience collaboration, and capitalisation is usually the only disambiguator.

Explainers using this term

• Probabilistic Data Structures — Counting Without CountingSpace/Time Trade-offs in Hash Coding with Allowable Errors (Bloom