Publication: Efficiently Parsable Extensions to Tree-Local Multicomponent TAG
Open/View Files
Date
2009
Authors
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computational Linguistics
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Nesson, Rebecca, and Stuart M. Shieber. Efficiently parsable extensions to tree-local multicomponent TAG. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics: May 31 - June 5, 2009, Boulder, Colorado, 92-100. Stroudsburg, P.A.: Association for Computational Linguistics.
Research Data
Abstract
Recent applications of Tree-Adjoining Grammar (TAG) to the domain of semantics as well as new attention to syntactic phenomena have given rise to increased interested in more expressive and complex multicomponent TAG formalisms (MCTAG). Although many constructions can be modeled using tree-local MCTAG (TL-MCTAG), certain applications require even more flexibility. In this paper we suggest a shift in focus from constraining locality and complexity through tree- and set-locality to constraining locality and complexity through restrictions on the derivational distance between trees in the same tree set in a valid derivation. We examine three formalisms, restricted NS-MCTAG, restricted Vector-TAG and delayed TL-MCTAG, that use notions of derivational distance to constrain locality and demonstrate how they permit additional expressivity beyond TL-MCTAG without increasing complexity to the level of set local MCTAG.
Description
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service