{'fraction_non_alphanumeric': 0.02219626168224299, 'fraction_numerical': 0.0011682242990654205, 'mean_word_length': 4.424050632911392, '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}}
Compressed String Matching in Standard Sturmian Words 1

We present a simple algorithm which for an explicitly given input string pat (a pattern) and a standard Sturmian word x described by the recurrences of size n computes, in time O(|pat| + n), the set of all occurrences of pat in x as a single arithmetic progression (modulo the length of x). The algorithm can be extended to the case when some letters of the pattern are replaced by a don’t care symbol. In this case the set of all occurrences does not need to be a single arithmetic progression and our algorithm produces linearly many (with respect to the size of pat) arithmetic progressions. It is an example of fast computations for the input given in a compressed form. In our special case the length of the standard Sturmian word x is usually exponential with respect to the size of the input.