Parse Tree Complexity
Parse Tree Complexity is a syntactic complexity metric that quantifies the structural intricacy of a sentence’s syntactic representation by measuring the depth, branching factor, and node diversity within its associated parse tree.
43
Publications
2.4K
Citations
92
Authors
60
Institutions
Publications per year
2017–2026
7
Parents
43
A Fundamental Algorithm for Dependency Parsing
Michael A. Covington · 2004 · 223 citations
Language Studies, Computer Science, Computational Linguistics +15
Fast and Accurate Shift-Reduce Constituent Parsing
Muhua Zhu, Yue Zhang, Wenliang Chen et al. · 2013 · 174 citations · Full text
Language Studies, Computer Science, Computational Linguistics +14
Stack-Pointer Networks for Dependency Parsing
Xuezhe Ma, Zecong Hu, Jingzhou Liu et al. · 2018 · 124 citations · Full text
Language Studies, Computer Science, Computational Linguistics +14
1–5 of 43
92
2
h-index
2
h-index
1
h-index
1
h-index
1 publications · 11 citations
1
h-index
1–5 of 92
60

University of Minnesota
Minneapolis, United States
2 h-index
6 publications
346 citations
The Ohio State University
Columbus, United States
2 h-index
3 publications
139 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
4 publications
115 citations
Universidad Veracruzana
Xalapa, Mexico
2 h-index
2 publications
99 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
259 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
3 publications
137 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
42 citations
Max Planck Institute for Human Cognitive and Brain Sciences
Leipzig, Germany
1 h-index
1 publications
30 citations
1–8 of 60
2 publications · 99 citations
2
h-index
2 publications · 122 citations
2
h-index
BRM · 1 publications · 59 citations
1
h-index
1 publications · 29 citations
1
h-index
1 publications · 68 citations
1
h-index
1–5