Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing
This addresses a theoretical issue in parsing efficiency for NLP researchers, but it appears incremental as it builds on existing transition systems.
The paper tackles the problem of spurious ambiguity in transition-based dependency parsing by introducing a technique to select a canonical transition sequence for a given dependency tree, applicable to bottom-up systems like Nivre (2004) and Attardi (2006).
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).