{'fraction_non_alphanumeric': 0.022181146025878003, 'fraction_numerical': 0.0, 'mean_word_length': 4.587628865979381, '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 jumping string mode matching algorithm

In this paper we present a jumping string mode matching algorithm. The principle is as follows. First, we build a ‘bucket’ based on the main text. The characters in the pattern string compare with the corresponding ones in the ‘bucket’ to find out the Best Matching Character. Then we simply match from the most suitable positions. This algorithm is especially fit for the relatively stable main texts. The time complexity depends on the degree of relevancy between pattern string and the main text.