arXiv · 1206.6735
Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing
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).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta. 2012-06-28. Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing. https://arxiv.org/abs/1206.6735
Cite the original work for its findings. Save a collection to share your selection of sources.