Filtering Suggested Structured Queries on Online Social Networks
First Claim
Patent Images
1. A method comprising, by a computing device:
- accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;
a first node corresponding to a first user associated with an online social network; and
a plurality of second nodes that each correspond to a concept or a second user associated with the online social network;
receiving from the first user an unstructured text query;
generating a first set of structured queries based on the text query, each structured query in the first set corresponding to a grammar of a context-free grammar model, wherein each structured query in the first set comprises one or more grammar tokens or one or more social-graph tokens, and wherein each social-graph token corresponds to a node of the plurality of nodes or an edge of the plurality of edges;
calculating, for each structured query in the first set, a quality score based on the text query and the structured query; and
filtering the first set to remove each structured query from the first set having a quality score less than a threshold quality score.
2 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, receiving from a user an unstructured text query, generating a set of structured queries based on the text query, calculating a quality score based on the text query and the structured query for each structured query in the set, and filtering the set to remove each structured query having a quality score less than a threshold score.
-
Citations
17 Claims
-
1. A method comprising, by a computing device:
-
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a first node corresponding to a first user associated with an online social network; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network; receiving from the first user an unstructured text query; generating a first set of structured queries based on the text query, each structured query in the first set corresponding to a grammar of a context-free grammar model, wherein each structured query in the first set comprises one or more grammar tokens or one or more social-graph tokens, and wherein each social-graph token corresponds to a node of the plurality of nodes or an edge of the plurality of edges; calculating, for each structured query in the first set, a quality score based on the text query and the structured query; and filtering the first set to remove each structured query from the first set having a quality score less than a threshold quality score. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
-
access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a first node corresponding to a first user associated with an online social network; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network; receive from the first user an unstructured text query; generate a first set of structured queries based on the text query, each structured query in the first set corresponding to a grammar of a context-free grammar model, wherein each structured query in the first set comprises one or more grammar tokens or one or more social-graph tokens, and wherein each social-graph token corresponds to a node of the plurality of nodes or an edge of the plurality of edges; calculate, for each structured query in the first set, a quality score based on the text query and the structured query; and filter the first set to remove each structured query from the first set having a quality score less than a threshold quality score.
-
-
17. A system comprising:
- one or more processors; and
a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising; a first node corresponding to a first user associated with an online social network; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network; receive from the first user an unstructured text query; generate a first set of structured queries based on the text query, each structured query in the first set corresponding to a grammar of a context-free grammar model, wherein each structured query in the first set comprises one or more grammar tokens or one or more social-graph tokens, and wherein each social-graph token corresponds to a node of the plurality of nodes or an edge of the plurality of edges; calculate, for each structured query in the first set, a quality score based on the text query and the structured query; and filter the first set to remove each structured query from the first set having a quality score less than a threshold quality score.
- one or more processors; and
Specification