Abstract
Ambiguity packing is a well known technique for enhancing the efficiency of context-free parsers. However, in the case of unification-augmented context-free parsers where parsing is interleaved with feature unification, the propagation of feature structures imposes difficulties on the ability of the parser to effectively perform ambiguity packing. We demonstrate that a clever heuristic for prioritizing the execution order of grammar rules and parsing actions can achieve a high level of ambiguity packing that is provably optimal. We present empirical evaluations of the proposed technique, performed with both a Generalized LR parser and a chart parser, that demonstrate its effectiveness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alshawi, H., editor (1992). The Core Language Engine. ACL-MIT Series in Natural Language Processing. MIT Press, Cambridge, MA.
Billot, S. and Lang, B. (1989). The Structure of Shared Forests in Ambiguous Parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (ACL’89), Vancouver, BC, Canada, pages 143–151.
Briscoe, T. and Carroll, J. (1993). Generalized Probabilistic LR Parsing of Natural Language (Corpora) with Unification-Based Grammars. Computational Linguistics, 19(1):25–59.
Carroll, J. (1993). Practical Unification-Based Parsing of Natural Language. PhD thesis, University of Cambridge, Cambridge, UK. Computer Laboratory Technical Report 314.
Eisele, A. and Dorre, J. (1988). Unification of DisjunctiveFeature Descriptions. In Proceedings of the 26th Annual Meeting of the ACL (ACL-88), Buffalo, NY, pages 286–294.
Gazdar, G., Klein, E., Pullum, G., and Sag, I. (1985). Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, MA.
Hopcroft, J. E. and Ullman, J. D. (1979). Introduction to Automata Theory, Languages and Computation, chapter 4.4, page 90. Addison-Wesley.
Kiefer, B., Krieger, H.-U., Carroll, J., and Malouf, R. (1999). A Bag of Useful Techniques for Efficient and Robust Parsing. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL’99), pages 473–480, College Park, MD.
Lavie, A. (1994). An Integrated Heuristic Scheme for Partial Parse Evaluation. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics (ACL-94), pages 316–318, Las Cruces, New Mexico.
Lavie, A. (1996a). GLR *: A Robust Grammar-Focused parser for Spontaneously Spoken Language. PhD thesis, School of Computer Science, Carnegie Mellon University. Technical Report CMU-CS-96-126.
Lavie, A. (1996b). GLR*: A Robust Parser for Spontaneously Spoken Language. In Proceedings of ESSLLI-96 Workshop on Robust Parsing.
Lavie, A., Gates, D., Gavalda, M., Mayfield, L., Waibel, A., and Levin, L. (1996). Multi-lingual Translation of Spontaneously Spoken Language in a Limited Domain. In Proceedings of International Conference on Computational Linguistics (COLING’96), pages 442–447, Copenhagen, Denmark.
Maxwell, J. T. and Kaplan, R. M. (1991). A Method for Disjunctive Constraint Satisfaction. In Tomita, M., editor, Current Issues in Parsing Technology. Kluwer Academic Press.
Maxwell, J. T. and Kaplan, R. M. (1993). The Interface between Phrasal and Functional Constraints. Computational Linguistics, 19(4):571–590.
Miyao, Y. (1999). Packing of Feature Structures for Efficient Unification of Disjunctive Feature Structures. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL’99), pages 579–584, College Park, MD.
Nederhof, M.-J. and Satta, G. (1996). Efficient Tabular LR Parsing. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics (ACL’96), pages 239–246.
Placeway, P. (2002). High-Performance Multi-Pass Unification Parsing. PhD thesis, Carnegie Mellon University, Pittsburgh, PA. Technical Report CMU-LTI-02-172.
Rosé, C. P. and Lavie, A. (2001). Balancing Robustness and Efficiency in Unification-augmented Context-Free Parsers for Large Practical Applications. In van Noord and Junqua, editors, Robustness in Language and Speech Technology, ELSNET. Kluwer Academic Press.
Schabes, Y. (1991). Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars. In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics (ACL’91), pages 106–113.
Shieber, S. M. (1986). An Introduction to Unification-based Approaches to Grammar. Number 4 in CSLI Lecture Notes. CSLI Stanford Univerity, Stanford, CA.
Tomita, M. (1987). An Efficient Augmented Context-free Parsing Algorithm. Computational Linguistics, 13(1–2):31–46.
Tomita, M. (1990). The Generalized LR Parser/Compiler — Version 8.4. In Proceedings of International Conference on Computational Linguistics (COL-ING’90), pages 59–63, Helsinki, Finland.
van Noord, G. (1997). An Efficient Implementation of the Head-Corner Parser. Computational Linguistics, 23(3):425–56.
Younger, D. (1967). Recognition and Parsing of Context-Free Languages in Time n 3. Information and Control, 10(2):189–208.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Lavie, A., Rosé, C.P. (2004). Optimal Ambiguity Packing in Context-Free Parsers with Interleaved Unification. In: Bunt, H., Carroll, J., Satta, G. (eds) New Developments in Parsing Technology. Text, Speech and Language Technology, vol 23. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2295-6_15
Download citation
DOI: https://doi.org/10.1007/1-4020-2295-6_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2293-7
Online ISBN: 978-1-4020-2295-1
eBook Packages: Humanities, Social Sciences and Law