Abstract
Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.- Anthology ID:
- 2000.iwpt-1.13
- 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:
- 111–122
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.13
- DOI:
- Cite (ACL):
- Henk Harkema. 2000. A Recognizer for Minimalist Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 111–122, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- A Recognizer for Minimalist Grammars (Harkema, IWPT 2000)
- PDF:
- https://preview.aclanthology.org/revert-3132-ingestion-checklist/2000.iwpt-1.13.pdf