Efficiently Parsable Extensions to Tree-Local Multicomponent TAG
MetadataShow full item record
CitationNesson, 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.
AbstractRecent 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4133285
- FAS Scholarly Articles