Topic
Tree-adjoining grammar
About: Tree-adjoining grammar is a research topic. Over the lifetime, 2491 publications have been published within this topic receiving 57813 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This article presents a formalism for non-projective dependency grammar in the framework of linear context-free rewriting systems, and shows that parsing with unrestricted grammars is intractable, and defines a class of “mildly” non- projective dependency Grammars that can be parsed in polynomial time.
Abstract: Syntactic representations based on word-to-word dependencies have a long-standing tradition in descriptive linguistics, and receive considerable interest in many applications. Nevertheless, dependency syntax has remained something of an island from a formal point of view. Moreover, most formalisms available for dependency grammar are restricted to projective analyses, and thus not able to support natural accounts of phenomena such as wh-movement and cross-serial dependencies. In this article we present a formalism for non-projective dependency grammar in the framework of linear context-free rewriting systems. A characteristic property of our formalism is a close correspondence between the non-projectivity of the dependency trees admitted by a grammar on the one hand, and the parsing complexity of the grammar on the other. We show that parsing with unrestricted grammars is intractable. We therefore study two constraints on non-projectivity, block-degree and well-nestedness. Jointly, these two constraints define a class of "mildly" non-projective dependency grammars that can be parsed in polynomial time. An evaluation on five dependency treebanks shows that these grammars have a good coverage of empirical data.
53 citations
••
07 Jun 1988TL;DR: The structural descriptions produced by Combinatory Categorial Grammars are discussed and compared to those of grammar formalisms in the class of Linear Context-Free Rewriting Systems.
Abstract: Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages. We discuss the structural descriptions produced by Combinatory Categorial Grammars and compare them to those of grammar formalisms in the class of Linear Context-Free Rewriting Systems. We also discuss certain extensions of Combinatory Categorial Grammars and their effect on the weak generative capacity.
53 citations
01 Jan 2005
TL;DR: This article investigated drawings as models of syntactic structure and showed that well-nested drawings allow for efficient processing by defining a simple constraint language for them and presenting an algo-rithm that decides in polynomial time whether a formula in that con-straint language is satisfiable on a well nested drawing.
Abstract: This paper investigates drawings (totally ordered forests) as models of syntactic structure. It oers a new model-based perspective on lexicalised Tree Adjoining Grammar by characterising a class of drawings structurally equivalent to tag derivations. The drawings in this class are distinguished by a restricted form of non-projectivity (gap degree at most one) and the absence of interleaving substructures (well-nestedness). We demonstrate that well-nested drawings allow for ecient processing by defining a simple constraint language for them and presenting an algo- rithm that decides in polynomial time whether a formula in that con- straint language is satisfiable on a well-nested drawing.
52 citations
••
TL;DR: The result obtained is that the even linear grammars are, among others, able to generate every regular event.
Abstract: The aim of our work is to define a family of linear grammars which we shall call even linear grammars and to show that the languages generated by them have mathematical properties analogous to those of regular events. In Section I we give the definition and the basic properties of these grammars. In Section II we introduce equivalence relations with a certain symmetry property and a family of devices which are interrelated in an analogous way as right invariant equivalence relations and finite automata. These devices turn out to be more powerful than finite automata. In Section I I I we shall prove that the languages acceptable by these devices are just the languages generable by even linear grammars. Consequently, the result obtained, which is by no means obvious, is tha t the even linear grammars are, among others, able to generate every regular event.
52 citations
••
16 Feb 2009TL;DR: The present paper introduces and illustrates the basics of grammar convergence, and to transform the grammars until they become syntactically identical.
Abstract: Grammar convergence is a lightweight verification method for establishing and maintaining the correspondence between grammar knowledge ingrained in all kinds of software artifacts, e.g., object models, XML schemas, parser descriptions, or language documents. The central idea is to extract grammars from diverse software artifacts, and to transform the grammars until they become syntactically identical. The present paper introduces and illustrates the basics of grammar convergence.
52 citations