{'fraction_non_alphanumeric': 0.025, 'fraction_numerical': 0.005, 'mean_word_length': 5.462365591397849, '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}}
GENETIC TRANPOSITION IN TREE-ADJOINING GRAMMAR GUIDED GENTIC PROGRAMMING : THE RELOCATION OPERATOR

We empirically investigate the use of relocation operator as a local search operator, in combination with genetic search, in a Tree Adjoining Grammar Guided Genetic Programming system (TAG3P). The results show that, on all the problems we tried, the use of the relocation operator as a local search operator in TAG3P outperforms TAG3P using purely crossover and mutation, and also outperforms standard genetic programming (GP). Moreover, it manages to solve problems with very small population sizes.