{'fraction_non_alphanumeric': 0.022988505747126436, 'fraction_numerical': 0.0019157088122605363, 'mean_word_length': 4.811111111111111, '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 simple pattern matching algorithm for weighted sequences

Weighted sequences are widely used in various areas including information retrieval, bioinformatics, and music analysis. In this paper we show how to apply the Boyer-Moore algorithm [2] for weighted sequences. As our algorithm is based on the Boyer-Moore algorithm, it works well when the size of alphabet is huge which is the case in information retrieval. Also, we show how to handle the case with small alphabets by considering two or more characters at once.