Parse Tree Theory
Parse Tree Theory is a formal framework in theoretical computer science that specifies the hierarchical syntactic structure of strings in a formal language by defining how they can be derived from the rules of a context-free grammar through recursive tree-like representations.
119
Publications
5.7K
Citations
266
Authors
111
Institutions
Publications per year
2017–2026
12
Parents
119
Procedure for quantitatively comparing the syntactic coverage of English grammars
Judith L. Klavans, Mark Liberman, Mitchell P. Marcus et al. · 1991 · 436 citations
A parsing theory of word order universals
John A. Hawkins · Americanae (AECID Library) · 1990 · 289 citations
1–5 of 119
266
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 266
111
Carnegie Mellon University
Pittsburgh, United States
4 h-index
10 publications
236 citations
Stanford University
Stanford, United States
4 h-index
8 publications
157 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
5 publications
175 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
5 publications
483 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
5 publications
256 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
109 citations

Hokkaido University
Sapporo, Japan
3 h-index
6 publications
102 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
41 citations
1–8 of 111
Repository · 4 publications · 90 citations
4
h-index
TPAMI · 2 publications · 99 citations
2
h-index
Conference · 2 publications · 27 citations
2
h-index
2 publications · 74 citations
2
h-index
2 publications · 251 citations
2
h-index
1–5