Patent Document ID: 20160154861
Application ID: 14556368
Patent Status: 0

Claim One:
1. A method comprising, by one or more computing devices: receiving, from a client device of a user of an online social network, a search query comprising one or more n-grams; determining, for each n-gram, if a first bloom filter indicates the n-gram does not exist in a first set of object names associated with a first vertical; identifying, for each n-gram that does not exist in the first set of object names, one or more variant-tokens based at least on the first bloom filter and the first set of object names; generating one or more unique combinations of the n-grams and variant-tokens, wherein each unique combination comprises a variant-token corresponding to each n-gram that does not exist in the first set of object names for the n-gram; calculating a confidence score for each unique combination based at least in part on the search query and whether the unique combination exists in the first set of object names; identifying objects matching each unique combination having a confidence score greater than a threshold confidence score; and sending, to the client device of the user, a search-results page responsive to the search query, the search-results page comprising one or more references to one or more of the identified objects, respectively.