In this paper, we present a parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from some recent linguistic work in TAGs (Abeillé: 1988a). In our approach, each elementary structure is systematically associated with a lexical head. These structures specify extended domains of locality (as compared to a context-free grammar) ...

We present a bottom-up bidirectional parser for Tree Adjoining Grammars that is an extension of the parser defined by De Vreught and Honig for Context Free Grammars. Although this parser does not improve the complexity of the parsers defined in the literature, it presents several characteristics that can be of interest for practical parsing of natural languages.

We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, val...

For the two grammar formalisms Tree{Adjoining Grammars (TAGs) and Constraint Dependency Grammars (CDGs), it is known that they are mildly context{sensitive. In both formalisms, natural{language phenomena can appropriately be speci ed. TAGs provide an adequate domain of locality by de ning trees as rules. In a CDG, more or less strictly formulated local constraints are written which must be sati...

This paper proposes a process to build semantic representation for Tree Adjoining Grammars (TAGs) analysis. Being in the derivation tree tradition, it proposes to reconsider derivation trees as abstract terms (λ-terms) of Abstract Categorial Grammars (ACGs). The latter offers a flexible tool for expliciting compositionality and semantic combination. The chosen semantic representation language h...

This paper shows how domain-specific grammars can be automatically generated from a declarative model of the lexicon-ontology interface and how those grammars can be used for question answering. We show a specific implementation of the approach using Lexicalized Tree Adjoining Grammars. The main characteristic of the generated elementary trees is that they constitute domains of locality that sp...

The introduction of the adjoining operation to context-free grammars comes at high costs: The worst case time complexity of (Earley, 1968) is O n 3 ¡ , whereas Tree Adjoining Grammars have O n 6 ¡ ((Schabes, 1990)). Thus, avoiding adjoining as far as possible seems to be a good idea for reducing costs (e.g.) address this problem more radically by restricting the adjoining operation of TAGs such...

In this paper we discuss the use of intersection as a tool for modeling syntactic phenomena and folding of biological molecules. We argue that intersection is useful but easily overestimated, because intersection coordinates grammars via their string languages, and if strong generative capacity is given priority over weak generative capacity, this kind of coordination turns out to be rather lim...

RÉSUMÉ. Cet article étudie la relation entre le formalisme TT-MCTAG et le formalisme RCG. RCG est connu pour décrire exactement la classe PTIME. TT-MCTAG a été proposé pour modéliser les langues à ordre des mots libre. Nous montrons comment une forme restreinte de TT-MCTAG peut être convertie en une RCG « simple » équivalente. Le résultat est intéressant pour des raisons théoriques (il montre q...

This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs) is too limited to deal with certain syntactic phenomena, in particular, with scrambling in freeword-order languages. The TAG variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, the article introduces an alternative extension of TAG that is based on the n...