1968
For approximate results , Bloom filters , another probabilistic data structure based on hashing , store a set of keys by encoding the keys using a bit array and multiple hash functions .
 person: Bloom
Please list all entity words in the text that fit the category.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 person: Bloom