{'fraction_non_alphanumeric': 0.03495630461922597, 'fraction_numerical': 0.0012484394506866417, 'mean_word_length': 5.075757575757576, '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}}
The Gene Expression Messy Genetic Algorithm

Introduces the Gene Expression Messy Genetic Algorithm (GEMGA)-a new generation of messy genetic algorithms that directly search for relations among the members of the search space. GEMGA is an O[/spl Lambda//sup k/(l/sup 2/+k)] sample complexity algorithm for the class of order-k delineable problems (problems that can be solved by considering no higher than order-k relations). GEMGA is designed based on an alternate perspective of natural evolution, as proposed by the SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework, that emphasizes the role of gene expression. GEMGA uses the transcription operator to search for relations. This paper also presents test results of the GEMGA for large multimodal order-k delineable problems.