Transition Based Parser
Related Papers
A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of …...
A Transition-Based Parser for 2-Planar Dependency Structures
Finding a class of structures that is rich enough for adequate linguistic represen- tation yet restricted enough for efficient computational processing is an important problem for dependency parsing. In this …...
A Linear-Time Transition System for Crossing Interval Trees
We define a restricted class of non-projective trees that 1) covers many natural language sentences; and 2) can be parsed exactly with a generalization of the popular arc-eager sys- tem …...
Improved Transition-based Parsing by Modeling Characters instead of Words with LSTMs
We present extensions to a continuous- state dependency parsing method that makes it applicable to morphologically rich languages. Starting with a high- performance transition-based parser that uses long short-term memory …...
Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs
We present a transition-based parser that jointly produces syntactic and semantic dependencies. It learns a representation of the entire algorithm state, using stack long short-term memories. Our greedy in- ference …...
Old French Dependency Parsing: Results of Two Parsers Analysed from a Linguistic Point of View
AbstractThe treatment of medieval texts is a particular challenge for parsers. I compare how two dependency parsers, one graph-based, the other transition-based, perform on Old French, facing some typical problems …...
An Incremental Parser for Abstract Meaning Representation
AbstractAbstract Meaning Representation (AMR) is a semantic representation for natural language that embeds annotations related to traditional tasks such as named entity recognition, semantic role labeling, word sense disambiguation and …...
Semantic Dependency Parsing via Book Embedding
AbstractWe model a dependency graph as a book, a particular kind of topological space, for semantic dependency parsing. The spine of the book is made up of a sequence of …...
Recursive Subtree Composition in LSTM-Based Dependency Parsing
AbstractThe need for tree structure modelling on top of sequence modelling is an open issue in neural dependency parsing. We investigate the impact of adding a tree layer on top …...
Fast semantic parsing with well-typedness guarantees
AbstractAM dependency parsing is a linguistically principled method for neural semantic parsing with high accuracy across multiple graphbanks. It relies on a type system that models semantic valency but makes …...
Training a Swedish Constituency Parser on Six Incompatible Treebanks
AbstractWe investigate a transition-based parser that uses Eukalyptus, a function-tagged constituent treebank for Swedish which includes discontinuous constituents. In addition, we show that the accuracy of this parser can be …...
BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency Parsing
The combined use of neural scoring systems and BERT fine-tuning has led to very high results in many natural language processing (NLP) tasks. These high results raise two im- portant …...
Incorporating EDS Graph for AMR Parsing
AbstractAMR (Abstract Meaning Representation) and EDS (Elementary Dependency Structures) are two popular meaning representations in NLP/NLU. AMR is more abstract and conceptual, while EDS is more low level, closer to …...