{'fraction_non_alphanumeric': 0.0170316301703163, 'fraction_numerical': 0.0, 'mean_word_length': 4.6438356164383565, '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}}
Oracles for Binary Words

The paper proposes a solution to the problem of finding an unspecified binary sequence of known length, using an oracle. Three oracles are defined and used in construction of linear algorithms, with the aim of finding an unknown word α. These algoritms build α by by generating all its prefixes, knowing a specified subword, or using a distance defined on sequences of the same length.