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
07 Jun 2004
TL;DR: The first achievement in the field of grammatical inferencing of GDPLL(k) grammars is presented: an algorithm of automatic construction of a GDPLL (k) grammar from a so-called polynomial specification of the language.
Abstract: The recent results of the research into construction of syntactic pattern recognition-based expert systems are presented. The model of syntactic pattern recognition has been defined with the use of GDPLL(k) grammars and parsers, and the model has been successfully applied as an efficient tool for inference support in several expert systems. Nevertheless, one of the main problems of practical application of GDPLL(k) grammars consists in difficulties in defining the grammar from the sample of a pattern language. In the paper we present the first achievement in the field of grammatical inferencing of GDPLL(k) grammars: an algorithm of automatic construction of a GDPLL(k) grammar from a so-called polynomial specification of the language.
16 citations
16 Nov 1998
TL;DR: In this article, a concurrent semantics for DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.
Abstract: In a recent paper, mimicking Winskel’s construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar.
16 citations
Journal Article•
TL;DR: It is demonstrated that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions.
Abstract: The present paper discusses the descriptional complexity of simple semi-conditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions.
16 citations
24 Aug 2002
TL;DR: Results of the coupling of Becker's metarules and a simple yet principled hierarchy of rule application have been successful to generate the large set of verb trees in the grammar, from a very small initial set of trees.
Abstract: We discuss a grammar development process used to generate the trees of the wide-coverage Lexicalized Tree Adjoining Grammar (LTAG) for English of the XTAG Project. Result of the coupling of Becker's metarules and a simple yet principled hierarchy of rule application, the approach has been successful to generate the large set of verb trees in the grammar, from a very small initial set of trees.
16 citations
01 Jun 2008
TL;DR: Two recent extension of the non-associative Lambek calculus are shown to generate the same class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement Grammars as an intermediate step.
Abstract: Two recent extension of the non-associative Lambek calculus, the Lambek-Grishin calculus and the multimodal Lambek calculus, are shown to generate the same class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
16 citations