{'fraction_non_alphanumeric': 0.015056461731493099, 'fraction_numerical': 0.0, 'mean_word_length': 5.384, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Grammatical evolution guided by reinforcement

Grammatical evolution is an evolutionary algorithm able to develop, starting from a grammar, programs in any language. Starting from the point that individual learning can improve evolution, in this paper it is proposed an extension of Grammatical evolution that looks at learning by reinforcement as a learning method for individuals. This way, it is possible to incorporate the Baldwinian mechanism to the evolutionary process. The effect is widened with the introduction of the Lamarck hypothesis. The system is tested in two different domains: a symbolic regression problem and an even parity Boolean function. Results show that for these domains, a system which includes learning obtains better results than a grammatical evolution basic system.