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 Jul 2009
TL;DR: It is shown that applying linear erasing to a Petri net language yields a language generated by a non-erasing matrix grammar, which yields a reformulation of the problem of whether erasing rules in matrix grammars can be eliminated.
Abstract: It is shown that applying linear erasing to a Petri net language yields a language generated by a non-erasing matrix grammar. The proof uses Petri net controlled grammars. These are context-free grammars, where the application of productions has to comply with a firing sequence in a Petri net. Petri net controlled grammars are equivalent to arbitrary matrix grammars (without appearance checking), but a certain restriction on them (linear Petri net controlled grammars) leads to the class of languages generated by non-erasing matrix grammars.
It is also shown that in Petri net controlled grammars (with final markings and arbitrary labeling), erasing rules can be eliminated, which yields a reformulation of the problem of whether erasing rules in matrix grammars can be eliminated.
11 citations
01 Jan 1992
TL;DR: A computational grammar for French written in the formalism of lexicalized Tree Adjoining Grammars, which can be viewed as a data-base consisting of both a sizable lexicon and corresponding syntactic structures.
Abstract: We present a computational grammar for French written in the formalism of lexicalized Tree Adjoining Grammars. This can be viewed as a data-base consisting of both a sizable lexicon (3000 words) and the corresponding syntactic structures. A parser has also been designed which is currently being used for analysing and disambiguating a large range of French sentences provided by the user. A similar lexical grammar has been designed for English with approximately the same linguistic coverage. We are currently working on a transfer system that matches the corresponding entries in both languages. Although we do not present any proper educational tool, we aim at exploring the possible uses of our system for teaching French to English speaking students.
11 citations
TL;DR: This paper proposes a more general model, in which context specifications may be two-sided, that is, both the left and the right contexts can be specified by the corresponding operators.
11 citations
26 Jun 2006
TL;DR: In this paper, Bag Context (BC) is introduced as a device for regulated rewriting in tree grammars, and it is shown that the class of bc tree languages is the closure of the random context tree languages under linear top-down tree transductions.
Abstract: We introduce bag context, a device for regulated rewriting in tree grammars. Rather than being part of the developing tree, bag context (bc) evolves on its own during a derivation. We show that the class of bc tree languages is the closure of the class of random context tree languages under linear top-down tree transductions. Further, an interchange theorem for subtrees of dense trees in bc tree languages is established. This result implies that the class of bc tree languages is incomparable with the class of branching synchronization tree languages.
11 citations