Bidirectional parsing of TAG without heads
نویسندگان
چکیده
We present a bottom-up bidirectional parser for Tree Adjoining Grammars that is an extension of the parser defined by De Vreught and Honig for Context Free Grammars. Although this parser does not improve the complexity of the parsers defined in the literature, it presents several characteristics that can be of interest for practical parsing of natural languages.
منابع مشابه
Non-Projective Dependency Parsing via Latent Heads Representation (LHR)
In this paper we introduce a novel approach based on a bidirectional recurrent autoencoder to perform globally optimized non-projective dependency parsing via semisupervised learning. The syntactic analysis is completed at the end of the neural process that generates a Latent Heads Representation (LHR), without any algorithmic constraint and with a linear complexity. The resulting “latent synta...
متن کاملBidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution.
متن کاملDependency Parsing as Head Selection
Conventional graph-based dependency parsers guarantee a tree structure both during training and inference. Instead, we formalize dependency parsing as the problem of independently selecting the head of each word in a sentence. Our model which we call DENSE (as shorthand for Dependency Neural Selection) produces a distribution over possible heads for each word using features obtained from a bidi...
متن کاملConnection driven parsing of Lexicalized TAG
This paper presents a new kind of algorithm for parsing lexi-calized TAG. It proceeds considering connected anchors in order to eliminate hypotheses as soon as possible during the analysis. This algorithm proceeds bottum-up in a bidirectional fashion. It has been designed to be applied to natural language and grammars of important size and permits local parsing. Even if it does not improve the ...
متن کاملHead-Corner Parsing for TAG
This paper describes a bidirectional head-corner parser for (uniication-based versions of) Lexicalized Tree Adjoining Grammars.
متن کامل