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 paper compares the generative power of colonies with two cooperation strategies and with several types of the selection of the alphabet for the common language.
27 citations
27 Jun 1994
TL;DR: The authors define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable, which serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars.
Abstract: We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars. The class provides a normal form for TAGs that generate local sets in much the same way that regular grammars provide a normal form for CFGs that generate regular sets.
27 citations
18 Jun 1991
TL;DR: It is shown that the three principles of "adjacency", "consistency" and "inheritance" have a natural expression in a unification-based interpretation of CCG in which directional information is an attribute of the arguments of functions grounded in string position.
Abstract: The form of rules in combinatory categorial grammars (CCG) is constrained by three principles, called "adjacency", "consistency" and "inheritance". These principles have been claimed elsewhere to constrain the combinatory rules of composition and type raising in such a way as to make certain linguistic universals concerning word order under coordination follow immediately. The present paper shows that the three principles have a natural expression in a unification-based interpretation of CCG in which directional information is an attribute of the arguments of functions grounded in string position. The universals can thereby be derived as consequences of elementary assumptions. Some desirable results for grammars and parsers follow, concerning type-raising rules.
27 citations
TL;DR: The n-fold fuzzy grammars whose rules are of context-free form can be shown to generate context-sensitive languages by setting a threshold appropriately, while the Fuzzy Grammars by Lee and Zadeh with context- free rules, however, cannot generate context -sensitive languages.
27 citations
Book•
01 Jan 2003
TL;DR: This book presents a unified formal approach to various contemporary linguistic formalisms such as Government & Binding, Minimalism or Tree Adjoining Grammar and features a complete and well illustrated introduction to the connection between declarative approaches formalized in monadic second-order logic (MSO) and generative ones formalization in various forms of automata as well as of tree grammars.
Abstract: This book presents a unified formal approach to various contemporary linguistic formalisms such as Government & Binding, Minimalism or Tree Adjoining Grammar. Through a careful introduction of mathematical techniques from logic, automata theory and universal algebra, the book aims at graduate students and researchers who want to learn more about tightly constrained logical approaches to natural language syntax. Therefore it features a complete and well illustrated introduction to the connection between declarative approaches formalized in monadic second-order logic (MSO) and generative ones formalized in various forms of automata as well as of tree grammars. Since MSO logic (on trees) yields only context-free languages, and at least the last two of the formalisms mentioned above clearly belong to the class of mildly context-sensitive formalisms, it becomes necessary to deal with the problem of the descriptive complexity of the formalisms involved in another way. The proposed genuinely new two-step approach overcomes this limitation of MSO logic while still retaining the desired tightly controlled formal properties.
27 citations