Abstract
This paper reports on two strategies that have been implemented for improving the efficiency and precision of wide-coverage Minimalist Grammar (MG) parsing. The first extends the formalism presented in Torr and Stabler (2016) with a mechanism for enforcing fine-grained selectional restrictions and agreements. The second is a method for factoring computationally costly null heads out from bottom-up MG parsing; this has the additional benefit of rendering the formalism fully compatible for the first time with highly efficient Markovian supertaggers. These techniques aided in the task of generating MGbank, the first wide-coverage corpus of Minimalist Grammar derivation trees.- Anthology ID:
- P18-1055
- Volume:
- Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Month:
- July
- Year:
- 2018
- Address:
- Melbourne, Australia
- Venue:
- ACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 590–600
- Language:
- URL:
- https://aclanthology.org/P18-1055
- DOI:
- 10.18653/v1/P18-1055
- Cite (ACL):
- John Torr. 2018. Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 590–600, Melbourne, Australia. Association for Computational Linguistics.
- Cite (Informal):
- Constraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars (Torr, ACL 2018)
- PDF:
- https://preview.aclanthology.org/starsem-semeval-split/P18-1055.pdf
- Data
- Penn Treebank