Syntax Analysis Complexity

Syntax Analysis Complexity is a theoretical construct in computational linguistics that characterizes the inherent difficulty of parsing natural or formal language expressions according to grammatical rules, distinguished by its focus on the algorithmic and structural factors influencing the resources required for syntactic recognition.

56

Publications

5.8K

Citations

124

Authors

70

Institutions

Publications per year

2017–2026

9

Authors

124

  1. AM
    Alexander Meduna

    Brno University of Technology, Czechia

    4 publications · 49 citations

    4

    h-index

  2. AK
    Aravind K. Joshi

    University of Pennsylvania, United States

    2 publications · 61 citations

    2

    h-index

  3. EG
    Edward Gibson

    Massachusetts Institute of Technology, United States

    2 publications · 115 citations

    2

    h-index

  4. PZ
    Paul Zeiger

    University of Colorado Boulder, United States

    2 publications · 135 citations

    2

    h-index

  5. AE
    Andrzej Ehrenfeucht

    University of Colorado Boulder, United States

    2 publications · 135 citations

    2

    h-index

1–5 of 124

Venues

  1. Journal of Computer and System Sciences

    3 publications · 142 citations

    3

    h-index

  2. Theoretical Computer Science

    3 publications · 70 citations

    3

    h-index

  3. Acta Informatica

    2 publications · 24 citations

    2

    h-index

  4. Jurnal Arsitektur ZONASI

    1 publications · 16 citations

    1

    h-index

  5. Acta Cybernetica

    1 publications · 15 citations

    1

    h-index

1–5