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

Authors

239

  1. JN
    Joakim Nivre

    Uppsala University, Sweden

    24 publications · 2.3K citations

    20

    h-index

  2. MB
    Miguel Ballesteros

    Universitat Pompeu Fabra, Spain

    9 publications · 1.5K citations

    9

    h-index

  3. YG
    Yoav Goldberg

    Bar-Ilan University, Israel

    8 publications · 921 citations

    8

    h-index

  4. CG
    Carlos Gómez‐Rodríguez

    Universidade da Coruña, Spain

    8 publications · 291 citations

    8

    h-index

  5. GS
    Giorgio Satta

    University of Padua, Italy

    7 publications · 247 citations

    7

    h-index

1–5 of 239

Venues

  1. Computational Linguistics

    8 publications · 290 citations

    8

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 6 publications · 200 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 178 citations

    6

    h-index

  4. 5

    h-index

  5. International Conference on Computational Linguistics

    Conference · 4 publications · 224 citations

    4

    h-index

1–5