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

Authors

92

  1. JM
    John M. Carroll

    Pennsylvania State University, United States

    2 publications · 92 citations

    2

    h-index

  2. MJ
    M.A. Jiménez-Montaño

    Drexel University, United States

    2 publications · 99 citations

    2

    h-index

  3. GM
    Gary Milsark

    Temple University, United States

    1 publications · 10 citations

    1

    h-index

  4. MA
    Michael A. Covington

    University of Georgia, United States

    1 publications · 223 citations

    1

    h-index

  5. NV
    N.H. van der Vliet

    1 publications · 11 citations

    1

    h-index

1–5 of 92

Venues

  1. Bulletin of Mathematical Biology

    2 publications · 99 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 122 citations

    2

    h-index

  3. Behavior Research Methods

    BRM · 1 publications · 59 citations

    1

    h-index

  4. Lingua

    1 publications · 29 citations

    1

    h-index

  5. PLoS ONE

    1 publications · 68 citations

    1

    h-index

1–5