Dependency Parsing

Dependency Parsing is a syntactic analysis task in computational linguistics that identifies the grammatical structure of a sentence by establishing directed binary relationships between words, representing each as a dependent of another or as the root, thereby forming a tree structure that reflects grammatical dependencies rather than phrase constituents.

2.2K

Publications

160.5K

Citations

3.7K

Authors

919

Institutions

Publications per year

2017–2026

669

Authors

3.7K

  1. JN
    Joakim Nivre

    Uppsala University, Sweden

    85 publications · 12K citations

    46

    h-index

  2. CD
    Christopher D. Manning

    Stanford University, United States

    45 publications · 19.4K citations

    37

    h-index

  3. NA
    Noah A. Smith

    Carnegie Mellon University, United States

    38 publications · 3.7K citations

    27

    h-index

  4. RM
    Ryan McDonald

    Google (United States), United States

    27 publications · 7K citations

    24

    h-index

  5. WC
    Wanxiang Che

    Harbin Institute of Technology, China

    27 publications · 1.7K citations

    20

    h-index

1–5 of 3.7K

Venues

  1. arXiv (Cornell University)

    Repository · 106 publications · 6.3K citations

    36

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 37 publications · 2.3K citations

    26

    h-index

  3. Computational Linguistics

    30 publications · 3.6K citations

    23

    h-index

  4. Transactions of the Association for Computational Linguistics

    TACL · 31 publications · 1.7K citations

    20

    h-index

  5. International Conference on Computational Linguistics

    Conference · 23 publications · 1.3K citations

    17

    h-index

1–5