An Efficient Implementation of String Pattern Matching Machines for a Finite Number of Keywords.
Jun-Ichi AoePublished in: SIGIR Forum (1989)
Keyphrases
- pattern matching
- finite number
- keywords
- regular expressions
- string matching
- bit parallel
- pattern matching algorithm
- approximate pattern matching
- arbitrarily close
- matching process
- convex sets
- matching strategy
- extreme points
- tree matching
- suffix tree
- boyer moore
- suffix array
- hamming distance
- search engine
- graph matching
- similarity measure
- information retrieval
- database