A generalized parsing framework for Abstract Grammars
This work provides a unified parsing solution for computational linguists and researchers dealing with multiple grammar formalisms, but it appears incremental as it builds on existing hierarchy concepts.
The authors tackled the problem of parsing diverse grammar formalisms by developing a general framework based on Abstract Grammars, which can represent and parse multiple grammar types including Context Free Grammars and Generalized Context-free Grammars.
This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy, including Context Free Grammars, Minimalist Grammars, and Generalized Context-free Grammars. We then develop a single parsing framework which is capable of parsing grammars which are at least up to GCFGs on the hierarchy. Our parsing framework exposes a grammar interface, so that it can parse any particular grammar formalism that can be reduced to an Abstract Grammar.