Probabilistic Data Structure Showdown: Cuckoo Filters vs. Bloom Filters
<p><pre><code>  > Since it’s possible to hash multiple items to the same 
  > indices, a membership test returns either false or maybe.
</code></pre>
As someone who perpetually has trouble keeping the terminology of {false|no false} {positives|negatives} straight, I just wanted to remark that this is a very intuitive and straightforward way of explaining the guarantees of lookup in a Bloom filter.