Parsing Generalized Phrase Structure Grammar with Dynamic Expansion
Navin Budhiraja, Subrata Mitra, Harish Karnick, Rajeev Sangal
Abstract
A parser is described here based on the Cocke-Young-Kassami algorithm which uses immediate dominance and linear precedence rules together with various feature inheritance conventions. The meta rules in the grammar are not applied beforehand but only when needed. This ensures that the rule set is kept to a minimum. At the same time, determining what rule to expand by applying which meta-rule is done in an efficient manner using the meta-rule reference table. Since this table is generated during “compilation” stage, its generation does not add to parsing time.- Anthology ID:
- W89-0247
- Volume:
- Proceedings of the First International Workshop on Parsing Technologies
- Month:
- August
- Year:
- 1989
- Address:
- Pittsburgh, Pennsylvania, USA
- Editor:
- Masaru Tomita
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Carnegy Mellon University
- Note:
- Pages:
- 458–467
- Language:
- URL:
- https://aclanthology.org/W89-0247
- DOI:
- Cite (ACL):
- Navin Budhiraja, Subrata Mitra, Harish Karnick, and Rajeev Sangal. 1989. Parsing Generalized Phrase Structure Grammar with Dynamic Expansion. In Proceedings of the First International Workshop on Parsing Technologies, pages 458–467, Pittsburgh, Pennsylvania, USA. Carnegy Mellon University.
- Cite (Informal):
- Parsing Generalized Phrase Structure Grammar with Dynamic Expansion (Budhiraja et al., IWPT 1989)
- PDF:
- https://preview.aclanthology.org/emnlp-22-attachments/W89-0247.pdf