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: A number of algorithms are given which can be considered to produce, from a finite number of observations of the development of a particular kind of organism, a model which represents the developmental rules of that organism.
23 citations
TL;DR: It is shown that these grammars with productions having associated only words consisting of one or two symbols characterize type 0 languages.
Abstract: Each production of a generalized forbidding grammar has an associated finite set of words. Such a production can be applied only if none of its associated words is a substring of a given rewritten sentential form. It is shown that these grammars with productions having associated only words consisting of one or two symbols characterize type 0 languages
23 citations
23 citations
19 Sep 1977
TL;DR: Basing on the Church-Rosser Theorems in /EK 76b/ analysis and synthesis of parallel derivations in graph grammars are introduced, which allows specific, transparent transformations of derivation sequences, which can be used as elementary steps of algorithms acting on derivations.
Abstract: Basing on the Church-Rosser Theorems in /EK 76b/ analysis and synthesis of parallel derivations in graph grammars are introduced. This allows specific, transparent transformations of derivation sequences, which can be used as elementary steps of algorithms acting on derivations, and the calculation rules for transformations presented in this paper are needed to prove the correctness of such algorithms. One example of this kind is given: the equivalence of derivations in graph grammars is defined and canonical derivations representing the equivalence classes are specified. For graph grammars canonical derivations will be as important as leftmost derivations and respective concepts for classical Chomsky grammars to the design of correct parsing algorithms.
23 citations
TL;DR: The approach to Object Grammars is implemented as one of the foundations of the Ens?
23 citations