Tag-based modularity in tree-based genetic programming

Abstract

Several techniques have been developed for allowing genetic programming systems to produce programs that make use of subroutines, macros, and other modular program structures. A recently proposed technique, based on the "tagging" and tag-based retrieval of blocks of code, has been shown to have novel and desirable features, but this was demonstrated only within the context of the PushGP genetic programming system. Following a suggestion in the GECCO-2011 publication on this technique we show here how tag-based modules can be incorporated into a more standard tree-based genetic programming system. We describe the technique in detail along with some possible extensions, outline arguments for its simplicity and potential power, and present results obtained using the technique on problems for which other modularization techniques have been shown to be useful. The results are mixed; substantial benefits are seen on the lawnmower problem but not on the Boolean even-4-parity problem. We discuss the observed results and directions for future research.

Evolving event-driven programs with SignalGP

“…Inspired by John Holland's concept of a "tag" ( [11][12][13][14]) as a mechanism for matching, binding, and aggregation, Spector et al [29][30][31] introduced and demonstrated the value of tag-based referencing in the context of GP. In this context, a tag-based reference always links to a tagged entity with its closest match.…”

“…functions). SignalGP augments the tag-based referencing techniques demonstrated by Spector et al [29][30][31] to specify which function is triggered by a signal, allowing the relationships between signals and functions to evolve over time. The SignalGP implementation presented here is demonstrated in the context of linear GP, wherein programs are represented as linear sequences of instructions; however, the ideas underpinning SignalGP are generalizable across a variety of genetic programming representations.…”

Context-Free Grammar Analysis for Arabic Sentences

“…On other word, the parse tree is a graphical representation of a derivation which represents the hierarchical structure of the language [15] [17].…”

“…To do that, an efficient Context-Free Grammar (CFG), which defines the language, is extremely necessary step. Furthermore, a robust syntactical analysis system to check whether the parser input sentence may generate by a given CFG is also very important step, which requires an efficient Part-Of-Speech (POS) tagging system to assign the syntactic category (noun, verb, and particle) to each word in the input sentence [6] [17]. This paper presents a simple parser to parse Arabic sentences.…”

What else is in an evolved name? Exploring evolvable specificity with SignalGP

“…Inspired by John Holland's use of "tags" (Holland, 1987(Holland, , 1990(Holland, , 1993(Holland, , 2006) as a mechanism for matching, binding, and aggregation, Spector et al (Spector et al, 2011b(Spector et al, ,a, 2012 introduced and demonstrated a tag-based naming scheme for GP where tags are used to name and reference program modules. Tags are evolvable labels that are mutable, and the similarity (or dissimilarity) between any two possible tags is quantifiable.…”