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
Parents
54
Non-projective dependency parsing using spanning tree algorithms
Ryan McDonald, Fernando Pereira, Kiril Ribarov et al. · 2005 · 862 citations · Full text
A non-projective dependency parser
Pasi Tapanainen, Timo Järvinen · 1997 · 370 citations · Full text
Language Studies, Computer Science, Natural Language Processing +15
Pseudo-projective dependency parsing
Joakim Nivre, Jens Nilsson · 2005 · 291 citations · Full text
Language Studies, Computer Science, Computational Linguistics +16
Experiments with a Higher-Order Projective Dependency Parser
Xavier Carreras · 2007 · 239 citations
1–5 of 54
86
10
h-index
6
h-index
4
h-index
4
h-index
3
h-index
1–5 of 86
49

Universidade da Coruña
A Coruña, Spain
6 h-index
6 publications
167 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
18 publications
2.1K citations

Uppsala University
Uppsala, Sweden
5 h-index
7 publications
500 citations

University of Padua
Padua, Italy
4 h-index
5 publications
206 citations
Växjö Kommun
Vaxjo, Sweden
3 h-index
6 publications
1.3K citations
University of Pennsylvania
Philadelphia, United States
3 h-index
7 publications
2.1K citations
California University of Pennsylvania
California, United States
2 h-index
4 publications
2K citations

Harbin Institute of Technology
Harbin, China
2 h-index
11 publications
264 citations
1–8 of 49
3 publications · 142 citations
3
h-index
Conference · 2 publications · 72 citations
2
h-index
TACL · 2 publications · 53 citations
2
h-index
Conference · 1 publications · 40 citations
1
h-index
Repository · 1 publications · 19 citations
1
h-index
1–5