Transition-based Dependency Parsing
Transition-Based Dependency Parsing is a deterministic parsing method that constructs a syntactic dependency structure for a sentence through a sequence of discrete transitions applied to a configuration stack and buffer, distinguishing itself from graph-based or neural approaches by modeling parsing as a state-space search guided by incremental actions.
135
Publications
10.9K
Citations
239
Authors
108
Institutions
Publications per year
2017–2026
41
Parents
135
Transition-Based Dependency Parsing with Stack Long Short-Term Memory
Chris Dyer, Miguel Ballesteros, Austin Matthews et al. · 2015 · 560 citations · Full text
1–5 of 135
239
20
h-index
9
h-index
8
h-index
8
h-index
7
h-index
1–5 of 239
108

Uppsala University
Uppsala, Sweden
20 h-index
30 publications
2.3K citations
Google (United States)
Mountain View, United States
11 h-index
26 publications
2.4K citations

Universidade da Coruña
A Coruña, Spain
9 h-index
12 publications
351 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
24 publications
5.6K citations

Universitat Pompeu Fabra
Barcelona, Spain
7 h-index
10 publications
3.1K citations

Peking University
Beijing, China
7 h-index
27 publications
705 citations

University of Padua
Padua, Italy
7 h-index
10 publications
334 citations
University of Stuttgart
Stuttgart, Germany
6 h-index
9 publications
713 citations
1–8 of 108
8 publications · 290 citations
8
h-index
Conference · 6 publications · 200 citations
6
h-index
Repository · 6 publications · 178 citations
6
h-index
TACL · 5 publications · 683 citations
5
h-index
Conference · 4 publications · 224 citations
4
h-index
1–5