Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?

摘要: Since the late 1970s there has been vigorous activity in constructing highly constrained grammatical systems by eliminating transformational component either totally or partially. There is increasing recognition of fact that entire range dependencies grammars their various incarnations have tried to account for can be captured satisfactorily classes rules are nontransformational and at same time terms languages they define. Two types especially important: subcategorization filler-gap dependencies. Moreover, these unbounded. One motivations transformations was unbounded The so-called different ways. In a tree adjoining grammar (TAG) unboundedness achieved factoring recursion novel linguistically interesting manner. All defined on finite set basic structures (trees), which bounded. Unboundedness then corollary particular composition operation called . thus no sense. This contrast (TG), where base essentially carry out checking phrase linking (PLGs) (Peters Ritchie, 1982) lexical functional (LFGs) (Kaplan Bresnan, 1983) share this aspect TGs; is, builds up structures, some filtered TG, constraints PLG, introduced via an LFG.