Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

2012/06/28 by Shay B. Cohen, Cohen, Shay B., Carlos Gómez-Rodríguez +3 · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #Computation and Language (cs.CL) #FOS: Computer and information sciences #cs.AI #cs.CL

paper · pdf · doi:10.48550/arxiv.1206.6735

arxiv created 2012/06/28 · arxiv updated 2012/06/29

Abstract

We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006).

Cited by

• Type-Compliant Adaptation Cascades: Adapting Programmatic LM Workflows to Data

Related

• Notes About a More Aware Dependency Parser
• Inherent Dependency Displacement Bias of Transition-Based Algorithms
• Transition-Based Dependency Parsing using Perceptron Learner
• A Unifying Theory of Transition-based and Sequence Labeling Parsing
• Dependency Language Models for Transition-based Dependency Parsing