Patent ID: 9703871
Date: 2017-07-11
CPC Classifications: G06F

Claim:
1. A computer-implemented method comprising: receiving a query comprising a first plurality of terms in a first order; dividing the query into a plurality of combinations of n-grams, wherein each n-gram is a subset of terms of the first plurality of terms, the subset of terms being in a same order as in the first plurality of terms; for each combination of n-grams: identifying a particular combination of each combination of n-grams based on the summed probability of each combination, wherein the particular combination has a largest summed probability of the combinations; identifying first and second components of the query based on the identified particular combination, wherein each component comprises one or more of the terms of the query in order and the two components do not share a term from the query, and wherein the terms of the first component appear in the first order before the terms of the second component in the query; determining, for each of the first and second components, a plurality of different respective component refinements; and combining the component refinements to create a plurality of candidate query refinements for the query, including, for each candidate query refinement: filtering the candidate query refinements of the query to create a subset of the candidate query refinements for the query, including: providing a plurality of the subset of the candidate query refinements in response to receiving the query.