Fast algorithm on string cross pattern matching

This paper presented a fast string pattern matching algorithm based on extracting high frequency strings. Compared with the existing algorithms including single-pattern algorithms, such as KMP and BM algorithm, and multi-pattern matching algorithms, such as DFA, this algorithm has both lower time and space complexity when the size of Σ is large and the number of strings is far more than the max length of string in set U. As Chinese character set is large and the average length of Chinese words is much short, this algorithm is more suitable to process Chinese text.