Projective Dependency Parsing

Projective Dependency Parsing is a type of syntactic parsing that constructs dependency trees in which no cross-overs occur between dependencies, ensuring that all dependencies form a contiguous subtree within the linear order of the sentence.

54

Publications

5.4K

Citations

86

Authors

49

Institutions

Publications per year

2017–2026

10

Authors

86

  1. JN
    Joakim Nivre

    Uppsala University, Sweden

    10 publications · 1.5K citations

    10

    h-index

  2. CG
    Carlos Gómez‐Rodríguez

    Universidade da Coruña, Spain

    6 publications · 167 citations

    6

    h-index

  3. GS
    Giorgio Satta

    University of Padua, Italy

    4 publications · 176 citations

    4

    h-index

  4. XM
    Xuezhe Ma

    Carnegie Mellon University, United States

    4 publications · 237 citations

    4

    h-index

  5. RM
    Ryan McDonald

    Google (United States), United States

    3 publications · 1.1K citations

    3

    h-index

1–5 of 86

Venues

  1. Computational Linguistics

    3 publications · 142 citations

    3

    h-index

  2. International Conference on Computational Linguistics

    Conference · 2 publications · 72 citations

    2

    h-index

  3. 2

    h-index

  4. 1

    h-index

  5. Edinburgh Research Explorer (University of Edinburgh)

    Repository · 1 publications · 19 citations

    1

    h-index

1–5