Abstract
The first published LR algorithm for Tree Adjoining Grammars (TAGs [Joshi and Schabes, 1996]) was due to Schabes and Vijay-Shanker [1990] . Nederhof [1998] showed that it was incorrect (after [Kinyon, 1997]), and proposed a new one. Experimenting with his new algorithm over the XTAG English Grammar [XTAG Research Group, 1998] he concluded that LR parsing was inadequate for use with reasonably sized grammars because the size of the generated table was unmanageable. Also the degree of conflicts is too high. In this paper we discuss issues involved with LR parsing for TAGs and propose a new version of the algorithm that, by maintaining the degree of prediction while deferring the “subtree reduction”, dramatically reduces both the average number of conflicts per state and the size of the parser.- Anthology ID:
- 2000.iwpt-1.21
- Volume:
- Proceedings of the Sixth International Workshop on Parsing Technologies
- Month:
- February 23-25
- Year:
- 2000
- Address:
- Trento, Italy
- Editors:
- Alberto Lavelli, John Carroll, Robert C. Berwick, Harry C. Bunt, Bob Carpenter, John Carroll, Ken Church, Mark Johnson, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Alon Lavie, Anton Nijholt, Christer Samuelsson, Mark Steedman, Oliviero Stock, Hozumi Tanaka, Masaru Tomita, Hans Uszkoreit, K. Vijay-Shanker, David Weir, Mats Wiren
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 207–218
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.21
- DOI:
- Cite (ACL):
- Carlos A. Prolo. 2000. An Efficient LR Parser Generator for Tree Adjoining Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 207–218, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- An Efficient LR Parser Generator for Tree Adjoining Grammars (Prolo, IWPT 2000)
- PDF:
- https://preview.aclanthology.org/revert-3132-ingestion-checklist/2000.iwpt-1.21.pdf