Search for several substrings
Date: 02/08/05
(Algorithms) Keywords: no keywords
What effective algorithms are there for searching for several rather similar samples in a long string? I am sure there exist far more effective ways of solving this problem than simply running KMP or an other fast algorithm for each sample.
The practical application is obvious - search for word forms or similar words, search with correction of orphograpical mistakes..
Another interesting problem is searching by several regexps. For instance, in Mathematica there is a possibility to "compile" a large table of rules to make replacements with it more effective, however this is quite a different type of regexps..
Source: http://www.livejournal.com/community/algorithms/46615.html