Keyword Search Queries on Online Social Networks
First Claim
1. A method comprising:
- accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, 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 a client system of a first user an unstructured text query;
parsing the text query to identify one or more n-grams, wherein at least one of the n-grams is an ambiguous n-gram;
searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each identified keyword suggestion corresponding to one or more second nodes of the plurality of second nodes;
calculating a keyword score for each identified keyword suggestion;
generating one or more suggested queries, each suggested query comprising one or more n-grams identified from the text query and one or more identified keyword suggestions having a keyword score greater than a threshold keyword score; and
sending, responsive to receiving the unstructured text query, one or more of the suggested queries to the client system of the first user for display, the suggested queries being displayed in ranked order based on the keyword scores of the identified keyword suggestions comprising each suggested query.
2 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a method includes receiving from a client system of a first user an unstructured text query. The method includes parsing the text query to identify one or more n-grams. At least one of the n-grams is an ambiguous n-gram. The method includes searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram. The method further includes calculating a keyword score for each identified keyword suggestions and generating one or more suggested queries including one or more n-grams identified from the text query. The one or more identified keyword suggestions having a keyword score greater than a threshold keyword score. The method includes sending one or more of the suggested queries to the client system of the first user for display.
89 Citations
19 Claims
-
1. A method comprising:
-
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, 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 a client system of a first user an unstructured text query; parsing the text query to identify one or more n-grams, wherein at least one of the n-grams is an ambiguous n-gram; searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each identified keyword suggestion corresponding to one or more second nodes of the plurality of second nodes; calculating a keyword score for each identified keyword suggestion; generating one or more suggested queries, each suggested query comprising one or more n-grams identified from the text query and one or more identified keyword suggestions having a keyword score greater than a threshold keyword score; and sending, responsive to receiving the unstructured text query, one or more of the suggested queries to the client system of the first user for display, the suggested queries being displayed in ranked order based on the keyword scores of the identified keyword suggestions comprising each suggested query. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. 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, 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 a client system of a first user an unstructured text query; parse the text query to identify one or more n-grams, wherein at least one of the n-grams is an ambiguous n-gram; search a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each identified keyword suggestion corresponding to one or more second nodes of the plurality of second nodes; calculate a keyword score for each identified keyword suggestion; generate one or more suggested queries, each suggested query comprising one or more n-grams identified from the text query and one or more identified keyword suggestions having a keyword score greater than a threshold keyword score; and send, responsive to receiving the unstructured text query, one or more of the suggested queries to the client system of the first user for display, the suggested queries being displayed in ranked order based on the keyword scores of the identified keyword suggestions comprising each suggested query.
-
-
19. 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, 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 a client system of a first user an unstructured text query; parse the text query to identify one or more n-grams, wherein at least one of the n-grams is an ambiguous n-gram; search a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram, each identified keyword suggestion corresponding to one or more second nodes of the plurality of second nodes; calculate a keyword score for each identified keyword suggestion; generate one or more suggested queries, each suggested query comprising one or more n-grams identified from the text query and one or more identified keyword suggestions having a keyword score greater than a threshold keyword score; and send, responsive to receiving the unstructured text query, one or more of the suggested queries to the client system of the first user for display, the suggested queries being displayed in ranked order based on the keyword scores of the identified keyword suggestions comprising each suggested query.
- one or more processors; and
Specification