Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

S. B. Cohen, C. Gómez-Rodriguez, G. Satta

Research output: Working paper


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).
Original languageUndefined/Unknown
Number of pages12
Publication statusPublished - 2012

Cite this