An Improved Wu-Manber Multiple-pattern Matching Algorithm and Its Application

The Wu-Manber multiple-pattern matching algorithm does not work well when some patterns are suffix of other patterns.To solve the problem,an improved algorithm is introduced which reduces the number of comparisons during pattern matching and leads to a faster matching algorithm.The text retrieval experiments use 52,067 passages which are randomly selected from TREC2000.Three algorithms including the Wu-Manber algorithm,the improved algorithm and the algorithm simply breaks halfway,are compared and the results show that the improved algorithm can steadily reduce the number of character comparisons and thus work more efficiently.