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
01 Jan 2016
TL;DR: This is a book that will show you even new to old thing, and when you are really dying of grammatical framework programming with multilingual grammars, just pick this book; it will be right for you.
Abstract: It's coming again, the new collection that this site has. To complete your curiosity, we offer the favorite grammatical framework programming with multilingual grammars book as the choice today. This is a book that will show you even new to old thing. Forget it; it will be right for you. Well, when you are really dying of grammatical framework programming with multilingual grammars, just pick it. You know, this book is always making the fans to be dizzy if not to find.
110 citations
TL;DR: It is shown that any deterministic algorithm which solves the circularity problem for a grammar must for infinitely many cases use an exponential amount of time.
Abstract: Attribute grammars are an extension of context-free grammars devised by Knuth as a mechanism for including the semantics of a context-free language with the syntax of the language. The circularity problem for a grammar is to determine whether the semantics for all possible sentences (programs) in fact will be well defined. It is proved that this problem is, in general, computationally intractable. Specifically, it is shown that any deterministic algorithm which solves the problem must for infinitely many cases use an exponential amount of time. An improved version of Knuth's circularity testing algorithm is also given, which actually solves the problem within exponential time.
108 citations
01 Apr 1997
TL;DR: Graph languages are sets of labeled graphs that can be generated by graph grammars, and in particular by context-free graph gramMars, which can be used to generate string languages and tree languages.
Abstract: Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph grammars. There are several types of context-free graph grammars, depending, e.g., on whether (hyper)edges or nodes are rewritten by graphs. Basic properties of the main types of context-free graph grammars are discussed. Other, equivalent, ways of defining context-free graph languages are: generating graph expressions by regular tree grammars, and translating trees into graphs by formulas of monadic second-order logic. Context-free graph grammars can be used to generate string languages and tree languages.
108 citations
01 May 1986
TL;DR: Some new results for TAG's are described, especially in the following areas: parsing complexity of TAG's, some closure results forTAG's, and the relationship to Head grammars.
Abstract: Tree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has been carried out in [Kroch and Joshi, 1985]. In this paper, we will describe some new results for TAG's, especially in the following areas: (1) parsing complexity of TAG's, (2) some closure results for TAG's, and (3) the relationship to Head grammars.
107 citations
Journal Article•
TL;DR: A scheme to extend a recognition algorithm for Context-Free Grammars that can be used to derive polynomial-time recognition algorithms for a set of for-malisms that generate a superset of languages generated by CFG is presented.
Abstract: In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive polynomial-time recognition algorithms for a set of for-malisms that generate a superset of languages generated by CFG. We describe the scheme by developing a Cocke-Kasami-Younger (CKY)-like pure bottom-up recognition algorithm for Linear Indexed Grammars and show how it can be adapted to give algorithms for Tree Adjoining Grammars and Combinatory Categorial Grammars. This is the only polynomial-time recognition algorithm for Combinatory Categorial Grammars that we are aware of.The main contribution of this paper is the general scheme we propose for parsing a variety of formalisms whose derivation process is controlled by an explicit or implicit stack. The ideas presented here can be suitably modified for other parsing styles or used in the generalized framework set out by Lang (1990).
106 citations