Grammar model for structured search queries
US9105068B2 · kind B2 · utility
7Cited by
20References
16Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 12, 2012 |
| Grant date | Aug 11, 2015 |
| Priority date | — |
| Expiry date | Oct 4, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q50/01
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.