{'fraction_non_alphanumeric': 0.014198782961460446, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
Shuffle crossover and mutual information

We introduce a crossover operator that is not dependent on the initial layout of the genome. While maintaining a low positional bias, the MISC (mutual information and shuffle crossover) algorithm is competitive with one-point crossover and works by automatically regrouping bits that are considered to be interdependent. The heuristic strategy is to derive an operator that promotes the expansion of building blocks as required by a genetic algorithm.