{'fraction_non_alphanumeric': 0.012738853503184714, 'fraction_numerical': 0.0, 'mean_word_length': 5.227722772277228, '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 Multiple Patterns Matching Method Based on Added Information

The multiple patterns matching algorithm based on added information is advanced in this paper. It can overcome language problem in some patterns matching algorithm. To reduce collision, the information of multiple continuous bytes is used in matched text. It adopts AVL tree managing index to reduce average searching times. The algorithm also makes use of specifically character of pattern collection to eliminate more collision. It adapts to matching on bigger pattern collection. This algorithm is easy to be translated into parallel pattern matching algorithm.