A bloom filter is a data structure that allows for extremely fast and memory efficient set membership tests, often using only a few tens of bytes to store information about thousands of objects. The tradeoff is that a bloom filter may produce false positives (though never false negatives). An alternative to a bloom filter is another data structure called a cuckoo filter, closely related to cuckoo hashing. Explain what a cuckoo filter is and how it works, as well as when/why you might choose to use a cuckoo filter over a bloom filter.
spam lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor creativity violence