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
22 Apr 1993
TL;DR: Experimental results shows that the genetic algorithm can infer grammars that derive neural networks for the parity, symmetry and decoder Boolean function of arbitrary large size.
Abstract: Cellular encoding is a method for encoding a family of neural networks into a set of labeled trees. Such sets of trees can be evolved by the genetic algorithm so as to find a particular set of trees that encodes a family of Boolean neural networks for computing a family of Boolean functions. Cellular encoding is presented as a graph grammar. A method is proposed for translating a cellular encoding into a set of graph grammar rewriting rules of the kind used in the 'Berlin' algebraic approach to graph rewriting. The genetic search of neural networks via cellular encoding appears as a grammatical inference process where the language to parse is implicitly specified, instead of explicitly by positive and negative examples. Experimental results shows that the genetic algorithm can infer grammars that derive neural networks for the parity, symmetry and decoder Boolean function of arbitrary large size. >
21 citations
TL;DR: It is proved that, given as input two context-free grammars, deciding non-emptiness of intersection of the two generated languages is PSPACE-complete if at least one grammar is non-recursive.
Abstract: We prove that, given as input two context-free grammars, deciding non-emptiness of intersection of the two generated languages is PSPACE-complete if at least one grammar is non-recursive. The problem remains PSPACE-complete when both grammars are non-recursive and deterministic. Also investigated are generalizations of the problem to several context-free grammars, of which a certain number are non-recursive.
21 citations
TL;DR: If it is furthermore required that each rule of the general form A->w has a nonempty w, then a substantial subfamily of conjunctive languages can be generated, yet it remains unknown whether such grammars are as powerful as conj unctive grammARS of thegeneral form.
21 citations
TL;DR: A simple portable interpreter for testing the specifications of problems is presented and specificiations are supposed to be expressed in the formalism of attribute grammars, so that the parsing can be directed by the semantics.
Abstract: A simple portable interpreter for testing the specifications of problems is presented in this paper. These specificiations are supposed to be expressed in the formalism of attribute grammars. The parsing and the semantics evaluation are carried out simultaneously, so that the parsing can be directed by the semantics. This increases the power of the grammars and context sensitive characteristics of a language can be described.
21 citations
21 citations