{'fraction_non_alphanumeric': 0.013574660633484163, 'fraction_numerical': 0.004524886877828055, 'mean_word_length': 4.986486486486487, '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}}
Pattern recognition and minimal words in free groups of rank 2

Abstract We describe a linear time probabilistic algorithm to recognize Whitehead minimal elements (elements of minimal length in their automorphic orbits) in free groups of rank 2. For a non-minimal element the algorithm gives an automorphism that is most likely to reduce the length of the element. This method is based on linear regression and pattern recognition techniques.