Ambiguous structured search queries on online social networks
In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram, identifying nodes and edges that correspond to the ambiguous n-gram, generating a first set of structured queries correspon...
Saved in:
Main Authors | , , , , |
---|---|
Format | Patent |
Language | English |
Published |
06.08.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram, identifying nodes and edges that correspond to the ambiguous n-gram, generating a first set of structured queries corresponding to the identified second nodes and edges, receiving from the first user a selection of a first structured query form the first set, and generating a second set of structured queries based on the selected first structured query. |
---|---|
Bibliography: | Application Number: AU20130370951 |