Grammar Simplification
Grammar Simplification is a formal method in computational linguistics that systematically reduces the complexity of context-free grammars by eliminating redundant or unreachable productions while preserving the generated language.
39
Publications
3K
Citations
88
Authors
60
Institutions
Publications per year
2017–2026
10
Parents
39
Graph-grammars: An algebraic approach
Hartmut Ehrig, Michael Pfender · 1973 · 488 citations
Combinatory grammars and parasitic gaps
Mark Steedman · Natural Language & Linguistic Theory · 1987 · 294 citations
1–5 of 39
88
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 88
60
Stanford University
Stanford, United States
3 h-index
7 publications
695 citations
University of Sheffield
Sheffield, United Kingdom
3 h-index
6 publications
258 citations

University of Aberdeen
Aberdeen, United Kingdom
2 h-index
3 publications
111 citations

University of Wolverhampton
Wolverhampton, United Kingdom
2 h-index
2 publications
248 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
3 publications
650 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
1 h-index
1 publications
488 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
3 publications
75 citations
University of South Carolina
Columbia, United States
1 h-index
1 publications
25 citations
1–8 of 60
2 publications · 69 citations
2
h-index
IJACSA · 1 publications · 192 citations
1
h-index
1 publications · 49 citations
1
h-index
Repository · 1 publications · 20 citations
1
h-index
1 publications · 17 citations
1
h-index
1–5