A method of parsing ambiguous grammar includes pre-compiling the grammar into a binary format, parsing a query, outputting a graph by combining the parsed query and the binary format of the grammar and outputting a frame representation of potential parses in the graph.JANE WEN CHANG...
CFGs are discussed in Chapter “Language and grammar” by Gudivada and Rao of this volume. A CFG is ambiguous if more than one parse tree can be constructed for a sentence. In probabilistic CGFs, a real value is associated with each production rule. These values help to break ties, should...
摘要: This chapter contains sections titled: Introduction Principles of Bottom-up parsing Parsing with right- versus left-recursive Grammars Bottom-up parsing with Ambiguous Grammars Do-not-reduce Rule SLR(1) Parsing Shift/Reduce Conflicts Reduce/Reduce Conflicts LR(1) Parsing Problems 关键词: bottom...
(1987a) Garden-Path Theory Based on the assumptions that processing resources are limited and that syntactic 77 categories are the only information used in parsing, Frazier's (1987a) Garden-Path Theory (GPT) allows the parser to only construct one structure for an ambiguous sentence being ...
Latent learning of subactions: Specifying a full parse tree in learning can be expensive or ambiguous. In our sce- nario, we are given video streams with action labels for each frame, without any subaction labels. We denote the action labels for video n as An. In this setting, we ...
Efficient parsing of highly ambiguous context-free grammars with bit vectors For inside-outside estimation, we used Bitpar (=-=Schmid 2004-=-), which inputs and outputs frequency grammars and lexicons in a simple text format. The frequency transformations were implemented in Perl. The resulting...
On the other hand, when incorporating the proposed tri-synchronous grammar to generate paraphrases and verify them with a language model, we find that it is possible to recover the loss of accuracy, resulting in a model that is able to parse the ambiguous input with signif- icantly better ...
The model is trained with a combination of a reconstruction loss, two adversarial losses and a semantic parsing loss, which ensures pixel faithfulness and ... Y Li,S Liu,J Yang,... 被引量: 79发表: 2017年 Generative alignment and semantic parsing for learning from ambiguous supervision We pr...
Builds a parse-tree (AST) automagically, based on the structure of the grammar Earleyparser Can parse all context-free grammars Full support for ambiguous grammars LALR(1)parser Fast and light, competitive with PLY Can generate a stand-alone parser (read more) ...
Type-Driven Incremental Semantic Parsing with Polymorphism [paper (short)] [slides] [code] Kai Zhao and Liang Huang. NAACL-2015. Imitation Learning of Agenda-based Semantic Parsers [paper] [code] Jonathan Berant and Percy Liang. TACL-2015. Semantic Parsing of Ambiguous Input through Paraphrasing...