{'fraction_non_alphanumeric': 0.0021231422505307855, 'fraction_numerical': 0.0, 'mean_word_length': 5.12987012987013, '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}}
A Study of Fixed-Length Subset Recombination

While bit based order based and real valued genetic algorithms have been well studied in the literature the xed length subset representation has received rela tively little attention We discuss various crossover operators for this representation and the pitfalls associated with each In particular we explore the ratio of the sub set size to the set size This important ratio is a major contributor to the rate of convergence