Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete

Abstract
An NP-hardness proof for non-local Multicomponent Tree Adjoining Grammar (MCTAG) by Rambow and Satta (1st International Workshop on Tree Adjoining Grammers 1992 ), based on Dahlhaus and Warmuth (in J Comput Syst Sci 33:456–472, 1986 ), is extended to some linguistically relevant restrictions of that formalism. It is found that there are NP-hard grammars among non-local MCTAGs even if any or all of the following restrictions are imposed: (i) lexicalization: every tree in the grammar contains a terminal; (ii) dominance links: every tree set contains at most two trees, and in every such tree set, there is a link between the foot node of one tree and the root node of the other tree, indicating that the former node must dominate the latter in the derived tree. This is the version of MCTAG proposed in Becker et al. (Proceedings of the 5th conference of the European chapter of the Association for Computational Linguistics 1991 ) to account for German long-distance scrambling. This result restricts the field of possible candidates for an extension of Tree Adjoining Grammar that would be both mildly context-sensitive and linguistically adequate
Keywords Tree Adjoining Grammar  MCTAG  NP-complete  Dominance links  Lexicalization  Mildly context-sensitive  Scrambling
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,612
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Citations of this work BETA

No citations found.

Similar books and articles
Paul Larson (1999). An Smax Variation for One Souslin Tree. Journal of Symbolic Logic 64 (1):81 - 98.
Yde Venema (1996). Tree Models and (Labeled) Categorial Grammar. Journal of Logic, Language and Information 5 (3-4):253-277.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Joel D. Velasco (2010). Species, Genes, and the Tree of Life. British Journal for the Philosophy of Science 61 (3):599-619.
Alessandro Andretta (1991). Building Iteration Trees. Journal of Symbolic Logic 56 (4):1369-1384.
Analytics

Monthly downloads

Added to index

2011-07-16

Total downloads

2 ( #344,185 of 1,098,410 )

Recent downloads (6 months)

1 ( #285,057 of 1,098,410 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.