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...

Full description

Saved in:
Bibliographic Details
Main Authors LEE YOFAY KARI, DUCK JOSHUA KEITH, MASCHMEYER WILLIAM R, PEIRIS KEITH L, RASMUSSEN LARS EILSTRUP
Format Patent
LanguageEnglish
Published 06.06.2013
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
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: US201213732101