Tree Adjoining Grammars, Language Bias, and Genetic Programming
نویسندگان
چکیده
In this paper, we introduce a new grammar guided genetic programming system called tree-adjoining grammar guided genetic programming (TAG3P+), where tree-adjoining grammars (TAGs) are used as means to set language bias for genetic programming. We show that the capability of TAGs in handling context-sensitive information and categories can be useful to set a language bias that cannot be specified in grammar guided genetic programming. Moreover, we bias the genetic operators to preserve the language bias during the evolutionary process. The results pace the way towards a better understanding of the importance of bias in genetic programming.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملGrammar Bias and Initialisation in Grammar Based Genetic Programming
Preferential language biases which are introduced when using Tree-Adjoining Grammars in Grammatical Evolution affect the distribution of generated derivation structures, and as such, present difficulties when designing initialisation methods. Similar initial populations allow for a fairer comparison between different GP methods. This work proposes methods for dealing with these biases and exami...
متن کاملA Framework For Tree-Adjunct Grammar Guided Genetic Programming
In this paper we propose the framework for a grammar-guided genetic programming system called Tree-Adjunct Grammar Guided Genetic Programming (TAGGGP). Some intuitively promising aspects of the model compared with other grammar-guided evolutionary methods are also highlighted. 1 Introduction Genetic programming (GP) is considered to be a machine learning method, which induces a population of co...
متن کاملThe Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars
The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language ...
متن کاملSome Experimental Results with Tree Adjunct Grammar Guided Genetic Programming
Tree-adjunct grammar guided genetic programming (TAG3P) [5] is a grammar guided genetic programming system that uses context-free grammars along with tree-adjunct grammars as means to set language bias for the genetic programming system. In this paper, we show the experimental results of TAG3P on two problems: symbolic regression and trigonometric identity discovery. The results show that TAG3P...
متن کامل