Fast Pattern Matching in Strings
Citations
3,616 citations
Cites background from "Fast Pattern Matching in Strings"
...(The corresponding automaton is in fact known as a Knuth–Morris–Pratt automaton [382]....
[...]
3,270 citations
Cites background or methods from "Fast Pattern Matching in Strings"
...Hopcroft and Karp (unpublished) have suggested a scheme similar to Algorithm 1 for finding the first occurrence of any of a finite set of keywords in a text string [13]....
[...]
...Our approach combines the ideas in the Knuth-Morris-Prat t algorithm [13] with those of finite state machines....
[...]
...[13] shows that, if there is only one keyword in K, O(logd) is the maximum number of failure transitions which can be made in one operating cycle....
[...]
...To avoid making unnecessary failure transitions we can use f ' , a generalization of the n e x t function from [13], in place of f in Algorithm 1....
[...]
...Algorithm 1 is patterned after the Knuth-Morris-Prat t algorithm for finding one keyword in a text string [13] and can be viewed as an extension of the "tr ie" search discussed in [11]....
[...]
2,723 citations
Cites background from "Fast Pattern Matching in Strings"
...Good references about the relation of approximate string matching and information retrieval are Wagner and Fisher [1974], Lowrance and Wagner [1975], Nesbit [1986], Owolabi and McGregor [1988], Kukich [1992], Zobel and Dart [1996], French et al....
[...]
2,542 citations
2,359 citations
References
9,262 citations
3,270 citations
2,542 citations
1,985 citations
819 citations