{'fraction_non_alphanumeric': 0.011627906976744186, 'fraction_numerical': 0.0, 'mean_word_length': 5.4392523364485985, '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}}
Derived Trees Evolution for Tree Adjoining Grammars Parsing

Starting from the model proposed by means of Grammatical Evolution, we extended the applicability of the parallel and cooperative searching processes of Evolutionary Algorithms to a new topic, Tree Adjoining Grammars parsing. We evolved derived trees using a string-tree-representation. We also could use a linear matching function to compare the yield of a derived tree with a given input and the running tests present several encouraging results. Due to the higher degree of intrinsic parallelism Evolutionary Algorithms represent a new alternative to the highly complex classical methods used in Formal Computational Models.