Browse State-of-the-Art › Transition-Based Dependency Parsing
Transition-Based Dependency Parsing
12 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
12 shown of 12 papers with code (66 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
29 May 2015 7 repositories listed Syntology ran 1 of 14 samples · 13 unverifiedWe propose a technique for learning representations of parser states in transition-based dependency parsers.
-
13 Oct 2022 1 repository listed Syntology ran 2 of 4 samples · 2 unverified · 4 pointer-only (licence)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.
-
8 Nov 2019 1 repository listedWe propose the Graph2Graph Transformer architecture for conditioning on and predicting arbitrary graphs, and apply it to the challenging task of transition-based dependency parsing.
-
17 Jul 2019 1 repository listedTraditionally, a transitionbased dependency parser processes an input sentence and predicts a sequence of parsing actions in a left-to-right manner.
-
1 Oct 2018 1 repository listedThis paper describes the system of team LeisureX in the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies.
-
1 Oct 2018 1 repository listedWe introduce tree-stack LSTM to model state of a transition based parser with recurrent neural networks.
-
29 May 2018 1 repository listedMany natural language processing tasks can be modeled into structured prediction and solved as a search problem.
-
30 Aug 2017 1 repository listedWe first present a minimal feature set for transition-based dependency parsing, continuing a recent trend started by Kiperwasser and Goldberg (2016a) and Cross and Huang (2016a) of using bi-directional LSTM features.
-
16 May 2017 1 repository listedWe present a novel neural network model that learns POS tagging and graph-based dependency parsing jointly.
-
1 Aug 2016 1 repository listed
-
1 Jan 2016 1 repository listedTransition-based approaches based on local classification are attractive for dependency parsing due to their simplicity and speed, despite producing results slightly below the state-of-the-art.
-
1 May 2015 1 repository listed
Syntology lines on 2 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections