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: The algorithm computes a canonical representation of a simple language, converting its arbitrary simple grammar into prime normal form (PNF); a simple grammar is in PNF if all its nonterminals define primes.
15 citations
01 Sep 2007
TL;DR: This paper describes an approach to learning node replacement graph grammars based on previous research in frequent isomorphic subgraphs discovery, and describes results on several real-world tasks from chemical mining to XML schema induction.
Abstract: Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to discover knowledge from data. In this paper we describe an approach to learning node replacement graph grammars. This approach is based on previous research in frequent isomorphic subgraphs discovery. We extend the search for frequent subgraphs by checking for overlap among the instances of the subgraphs in the input graph. If subgraphs overlap by one node we propose a node replacement grammar production. We also can infer a hierarchy of productions by compressing portions of a graph described by a production and then infer new productions on the compressed graph. We validate this approach in experiments where we generate graphs from known grammars and measure how well our system infers the original grammar from the generated graph. We also describe results on several real-world tasks from chemical mining to XML schema induction. We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.
15 citations
TL;DR: This work proposes a relational and logical approach to graph grammars that allows formal verification of systems using mathematical induction and allows proving properties of systems with infinite state-spaces.
15 citations
28 Apr 2005
TL;DR: Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammARS.
Abstract: In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars
We show that DSG are weakly equivalent to Categorial Dependency Grammars (CDG) recently introduced in [6,3] In particular, these dependency grammars naturally express long distance dependencies and enjoy good mathematical properties
15 citations
22 Sep 2003
TL;DR: This paper presents techniques for the formal specification and efficient incremental implementation of spreadsheet-like tools using strong attribute grammars and first incremental results are presented.
Abstract: This paper presents techniques for the formal specification and efficient incremental implementation of spreadsheet-like tools. The spreadsheets are specified by strong attribute grammars. In this style of attribute grammar programming every single inductive computation is expressed within the attribute grammar formalism. Well-known attribute grammar techniques are used to reason about such grammars. For example, ordered scheduling algorithms can be used to statically guarantee termination of the attribute grammars and to derive efficient implementations. A strong attribute grammar for a spreadsheet is defined and the first incremental results are presented.
15 citations