Before revision: Bloom filters are well-known space-efficient data structures that answer set membership queries with some probability of false positives.
After revision: Bloom filters are well-known space-efficient data structure that answers set membership queries with some probability of false positives.