Grammar model for structured search queries

Grammar Model for Structured Search Queries 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. ACCESSING A SOCIAL GRAPH COMPRISING 510 A PLURALITY OF NODES AND A PLURALITY OF EDGES CONNECTING THE NODES RECEIVING FROM A FIRST USER A 520 SUBS TANTIALLY UNSTRUCTURED TEXT QUERY COMPRISING ONE OR MORE N-GRAMIS IDENTIFYING ONE OR MORE EDGES OR N E OR MORE NODES, EACH OF THE IDENTIFIED 530 EDGES OR IDENTIFIED NODES CORRESPONDING TO AT LEAST ONE OF THE N-GRAMS ACCESSING A CONTEXT-FREE GRAMMAR MODEL COMPRISING A PLURAI1Y OF 54 GRAMMARS, EACH CRAMMAR COMPRISING ONE OR MORE GUR-Y TOKENS IDENTIFYING GRAMARS HAVING QUERY TOKENS CORRESPONDING TO AT LEAST ONE OF THE IDENTIFIED SECOND NODES OR IDENTIFIED EDGES DETERMINING A F IRST SCORE FOR EACH I DENT IED GRAMMAR 560 GENERATING ONE OR MORE STRUCTURED QUERIS, EACH STUCTUR ED QUERY CORRESPONDING TO AN IDENTIFIED 570 rRAMMAR HAVING FIRST SCORE GREATER THAN A GRAIM MAR-THRESHOLD SCORE