{'fraction_non_alphanumeric': 0.011725293132328308, 'fraction_numerical': 0.0, 'mean_word_length': 4.805825242718447, '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}}
Improved algorithm of pattern matching based on BMHS

Pattern matching is often used in intrusion detection system. On the basis of analyzing four kinds of typical pattern matching algorithms, an improved algorithm based on BMHS is presented. The algorithm uses a matching way that is from right to left. In the algorithm, the movement distance of a pattern is decided by the greater one of two movement value which is calculated by two characters. Experiments show that the improved algorithm could reduce the times of comparing and moving and it could enhance the efficiency of pattern matching.