Tree Adjoining Grammars (TAG) are known not to be powerful enough to deal with scrambling in free word order languages. The TAGvariants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, an alternative extension of TAG is introduced based on the notion of node sharing. Considering data from German and Korean, it is shown that this TAG-extension can adequa...

Vijay-Shanker and Weir 1990 have shown that the most basic form of Tree-adjoining grammars (TAG) and Combinatory Categorial Grammars (CCG) are weakly equivalent. Nevertheless, actual grammars and analyses for fragments of natural languages in the two frameworks appear very diierent. In particular , in order to capture coordination, unbounded dependency, and intonation structure, CCG and a numbe...

The development of wide-coverage grammars is at the core of robust NLP systems. This paper addresses the problem of grammar extraction from treebanks with respect to the issue of broad coverage along three dimensions: the grammar formalism (contextfree grammar, dependency grammar, lexicalized tree adjoining grammar), the domain of the annotated corpus (press reports, civil law) and the language...

In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a \stapler" has a...

Parsing efficiency within the context of tree adjoining grammars (TAGs) depends not only on the size of the input sentence but also, linearly, on the size of the input TAG, which can attain several thousands of elementary trees. We propose a factorized, finite-state TAG representation which copes with this combinatorial explosion. The associated parsing algorithm substantially increases the par...

Modeling language at the syntactic or semantic level is a key problem in natural languageprocessing, and involves a challenging set of structured prediction problems. In this talkI’ll describe work on machine learning approaches for syntax and semantics, with a particu-lar focus on lexicalized grammar formalisms such as dependency grammars, tree adjoininggrammars, and catego...

We build on our previous feasibility studies [18,20], which demonstrated the impact of evaluation during development in the DEVTAG system, and here present a fullfledged developmental system – Developmental Tree Adjoining Grammar Guided Genetic Programming(DTAG3P) with developmental evaluation, based on Tree-Adjoining Grammars (TAG). While DEVTAG used only a trivial developmental process, DTAG3...

A? algorithms enable efficient parsing within the context of large grammars and/or complex syntactic formalisms. Besides, it has been shown that promoting multiword expressions (MWEs) is a beneficial strategy in dealing with syntactic ambiguity. The state-of-the-art A? heuristic for promoting MWEs in tree-adjoining grammar (TAG) parsing has certain drawbacks: it is not monotonic and it composes...

This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high eeciency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architectures for alg...

There have been many attempts to give a coherent formulation of a hierarchical progression that would lead to a refined partition of the vast area stretching from the context-free to the context-sensitive languages. The purpose of this note is to describe a theory that seems to afford a promising method of interpreting the tree adjoining languages as the natural third step in a hierarchy that s...