Abstract not found

DTG are designed to share some of the advantages of TAG while overcoming some of its limitations. DTG involve two composition operations called subsertion and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG, there is complete uniformity in the way that the two DTG operations relate lexical items: subsertion always corresponds to complementation and sister-adjunction to modification. Furthermore, DTG, unlike TAG, can provide a uniform analysis for whmovement in English and Kashmiri, despite the fact that the wh element in Kashmiri appears in sentence-second position, and not sentence-initial position as in English.

Abstract not found

There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This paper concerns the relationship between the class of string languages generated by several such formalisms viz. Combinatory Categorial Grammars, Head Grammars, Linear Indexed Grammars and Tree Adjoining Grammars. Each of these formalisms is known to generate a larger class of languages than Context-Free Grammars. The four formalisms under consideration were developed independently and appear superficially to be quite different from one another. The result presented in this paper is that all four of the formalisms under consideration generate exactly the same class of string languages. 1 Introduction There is currently considerable interest among computational linguists in grammatical formalisms with highly restricted generative power. This is based on the argument that a grammar formalism should not merely be viewed as a notation, but as part o...

Abstract not found

In many head-final languages such as German, Hindi, Japanese, and Korean, but also in some other languages such as Russian, arguments of a verb can occur in any order. Furthermore, arguments can occur outside of their clause ("long-distance scrambling"). Long-distance scrambling presents a challenge both to linguistic theory and to formal frameworks for linguistic description because it is very unconstrained: in given sentence, there is no bound on the number of elements that can scrambled nor on the distance over which each element can scramble. We discuss two formal frameworks related to Tree Adjoining Grammar. First, we show how scrambling facts from Korean can be handled by non-local multi-component TAG (MC-TAG). Then, we argue that overt wh- movement in German makes this analysis unattractive, and suggest a new version of MC-TAG, called V-TAG, which can handle both Korean and German word order variation. Interestingly, this new version has more attractive computational properties ...

this paper is to find a formalism of the TAG family, where the derivation controller can be interpreted as a semantic dependency graph, in the sense of Meaning-Text Theory (ZM67; M88). In a previous paper (CK98), we study this interpretation of the derivation tree (DT) in the case of standard TAG. We prove that, in the general case, if the predicate-argument cooccurence principle

This paper addresses the issue of embedded zu-infinitival clauses in German from the

In this paper we will describe a polynomial time Earley-style predictive parser for D-Tree Grammars (DTG). DTG were designed to share some of the advantages of TAG while overcoming some of its limitations. In developing parsers for TAG it has turned out to be useful to make use of a direct mapping from TAG to Linear Indexed Grammars (LIG) and to develop algorithms that work with the resulting LIG. In the case of DTG we use a similarly direct mapping into what we call Linear Prioritized Multiset Grammar (LPMG). This makes it possible to give a straightforward statement of the parsing algorithm. 1. Motivation Rambow, Vijay-Shanker and Weir (1995), we define a new grammar formalism, called D-Tree Grammars (DTG), which arises from work on Tree-Adjoining Grammars (TAG) (Joshi et al., 1975). A salient feature of TAG is the extended domain of locality it provides. Each elementary structure can be associated with a lexical item (as in Lexicalized TAG (LTAG) (Joshi and Schabes, 1991)). Propert...

this paper is an example of a mixed system with both independent and synchronous parallelism.