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
••
25 Aug 2008TL;DR: A simple type of tiling is focused on, named regional, and the corresponding regional tile grammars are defined, which include both Siromoney's (or Matz's) Kolam Grammars, and their generalization by Průsa.
Abstract: Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach. The right part of a rewriting rule is formalized by a finite set of permitted tiles. We focus on a simple type of tiling, named regional, and define the corresponding regional tile grammars. They include both Siromoney's (or Matz's) Kolam grammars, and their generalization by Průsa. Regionally defined pictures can be recognized with polynomial time complexity by an algorithm extending the CKY one for strings. Regional tile grammars and languages are strictly included into the tile grammars and languages, and are incomparable with Giammarresi-Restivo tiling systems (or Wang's tilings).
17 citations
••
23 Sep 2002TL;DR: The method presented in this paper has the ability to infer attribute grammars that can generate a wide range of useful data structures such as simple and structured types, lists, concatenated strings, and natural numbers.
Abstract: This paper presents a method for inferring reversible attribute grammars from tagged natural language sentences. Attribute grammars are a form of augmented context free grammar that assign "meaning" in the form of a data structure to a string in a context free language. The method presented in this paper has the ability to infer attribute grammars that can generate a wide range of useful data structures such as simple and structured types, lists, concatenated strings, and natural numbers. The method also presents two new forms of grammar generalisation; generalisation based upon identification of optional phrases and generalisation based upon lists. The method has been applied to and tested on the task of the rapid development of spoken dialog systems.
17 citations
••
28 Jul 2007TL;DR: It has been conjectured that the ability to generate this kind of configuration is crucial to the super-context-free expressivity of minimalist grammars and this conjecture is here proven.
Abstract: Minimalist grammars offer a formal perspective on a popular linguistic theory, and are comparable in weak generative capacity to other mildly context sensitive formalism Minimalist grammars allow for the straightforward definition of so-called remnant movement constructions, which have found use in many linguistic analyses It has been conjectured that the ability to generate this kind of configuration is crucial to the super-context-free expressivity of minimalist grammars This conjecture is here proven
17 citations
••
TL;DR: This paper proposes a graph-grammar-based approach to the semantic analysis of model graphs and uses Rekers and Schürr’s Layered Graph Grammars, which may be regarded as a pure generalization of standard context-sensitive string grammars.
Abstract: In this paper, we present a method to convert a metamodel in the form of a UML class diagram into a context-sensitive graph grammar whose language comprises precisely the set of model graphs (UML object diagrams) that conform to the input metamodel. Compared to other approaches that deal with the same problem, we use a graph grammar formalism that does not employ any advanced graph grammar features, such as application conditions, precedence rules, and production schemes. Specifically, we use Rekers and Schurr's Layered Graph Grammars, which may be regarded as a pure generalization of standard context-sensitive string grammars. We show that elementary grammatical features, i.e., grammar labels and context-sensitive graph rewrite rules, suffice to represent metamodels with arbitrary multiplicities and inheritance. Inspired by attribute string grammars, we also propose a graph-grammar-based approach to the semantic analysis of model graphs.
17 citations
••
TL;DR: It is shown that every “recursively enumerable tree language” can be obtained from a recognizable dag language by such a transduction, and tree languages obtained from some subsets of recognizable dag languages by these transductions are investigated.
Abstract: Directed acyclic graphs (dags) model derivations of phrasestructure grammars analogously to the way that trees model derivations of context-free grammars.
17 citations