Efficiently Parsable Extensions to Tree-Local Multicomponent TAG

DSpace/Manakin Repository

Efficiently Parsable Extensions to Tree-Local Multicomponent TAG

Show simple item record

dc.contributor.author Nesson, Rebecca
dc.contributor.author Shieber, Stuart M.
dc.date.accessioned 2010-05-24T20:37:50Z
dc.date.issued 2009
dc.identifier.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. en_US
dc.identifier.isbn 978-1-932432-41-1 en_US
dc.identifier.uri http://nrs.harvard.edu/urn-3:HUL.InstRepos:4133285
dc.description.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. en_US
dc.description.sponsorship Engineering and Applied Sciences en_US
dc.language.iso en_US en_US
dc.publisher Association for Computational Linguistics en_US
dc.relation.isversionof doi:10.3115/1620754.1620768 en_US
dc.relation.hasversion http://www.aclweb.org/anthology-new/N/N09/N09-1011.pdf en_US
dash.license OAP
dc.title Efficiently Parsable Extensions to Tree-Local Multicomponent TAG en_US
dc.type Conference Paper en_US
dc.description.version Version of Record en_US
dc.relation.journal Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics en_US
dash.depositing.author Shieber, Stuart M.
dc.date.available 2010-05-24T20:37:50Z
dc.identifier.orcid ORCID  0000-0002-7733-8195 *

Files in this item

Files Size Format View
nesson-2009-EPE.pdf 462.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

 
 

Search DASH


Advanced Search
 
 

Submitters