Parsing Complexity is a computational linguistics metric that quantifies the cognitive or algorithmic difficulty associated with analyzing the syntactic structure of a sentence according to a given grammar formalism.
117
Publications
9.2K
Citations
217
Authors
98
Institutions
Publications per year
2017–2026
8
Parents
Publications
117
An efficient context-free parsing algorithm
Jay Earley · Communications of the ACM · 1970 · 817 citations · Full text
Procedure for quantitatively comparing the syntactic coverage of English grammars
Judith L. Klavans, Mark Liberman, Mitchell P. Marcus et al. · 1991 · 436 citations
1–5 of 117
Authors
217
- GS
5
h-index
- JH
4
h-index
- SA
3
h-index
- KH
3
h-index
- MN
3
h-index
1–5 of 217
Institutions
98
Cornell University
Ithaca, United States
5 h-index
8 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
5 publications
719 citations
University of Pennsylvania
Philadelphia, United States
5 h-index
9 publications
286 citations
University of Padua
Padua, Italy
3 h-index
3 publications
140 citations
Stanford University
Stanford, United States
3 h-index
5 publications
606 citations
University of Minnesota
Minneapolis, United States
3 h-index
7 publications
381 citations
Stony Brook University
Stony Brook, United States
3 h-index
5 publications
108 citations
University of Edinburgh
Edinburgh, United Kingdom
3 h-index
6 publications
1.3K citations
1–8 of 98
Venues
- Journal of Psycholinguistic Research
4 publications · 518 citations
4
h-index
- International Workshop/Conference on Parsing Technologies
Conference · 3 publications · 52 citations
3
h-index
- Journal of Memory and Language
3 publications · 1.1K citations
3
h-index
- Cognition
3 publications · 1.1K citations
3
h-index
- Computational Linguistics
3 publications · 94 citations
3
h-index
1–5