Transition-Based Dependency Parsing
12 papers with code • 0 benchmarks • 0 datasets
This task has no description! Would you like to contribute one?
Benchmarks
These leaderboards are used to track progress in Transition-Based Dependency Parsing
No evaluation results yet. Help compare methods by
submitting
evaluation metrics.
Most implemented papers
Graph-to-Graph Transformer for Transition-based Dependency Parsing
We propose the Graph2Graph Transformer architecture for conditioning on and predicting arbitrary graphs, and apply it to the challenging task of transition-based dependency parsing.
Algorithms for Weighted Pushdown Automata
Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing.