Parsing schemata and correctness of parsing algorithms
AMiLP '95 Proceedings of the first international AMAST workshop on Algebraic methods in language processing
An efficient context-free parsing algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Unification-ID/LP Grammars: Formalization and Parsing
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
We define state transition grammars (STG) as an intermediate formalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy from the grammar formalism. This allows to define more general parsing algorithms for larger classes of grammars, including grammars where the number and order of subconstituents defined by a production may not be fixed. Various grammar formalisms are characterized in terms of properties of STG's. We define an Earley parsing schema for STG's and characterize the valid parse items. We also discuss the usability of STG's for head-corner parsing and direct parsing of sets of tree constraints.