Title
A Performance Evaluation of the Preprocessing Phase of Multiple Keyword Matching Algorithms
Abstract
Multiple keyword matching is an important problem in text processing that involves the location of all the positions of an input string where one or more keywords from a finite set occur. Modern multiple keyword matching algorithms can scan the input string in a single pass by preprocessing the keyword set, an essential phase that affects the overall performance of each algorithm. This paper presents a performance evaluation in terms of preprocessing of the well known Commentz-Walter, Wu-Manber, Set Backward Oracle Matching and Salmela-Tarhio-Kyt\"{o}joki multiple keyword matching algorithms for different types of keywords and for several problem parameters.
Year
DOI
Venue
2011
10.1109/PCI.2011.41
Panhellenic Conference on Informatics
Keywords
Field
DocType
problem parameter,multiple keyword matching,multiple keyword matching algorithms,input string,finite set,overall performance,joki multiple keyword,modern multiple keyword,performance evaluation,important problem,keyword set,preprocessing phase,algorithms,preprocessing,text analysis,string matching,biology,algorithm design and analysis,databases,pattern matching
Single pass,String searching algorithm,Data mining,Finite set,Computer science,Oracle,Artificial intelligence,Text processing,Algorithm design,Pattern recognition,Algorithm,Preprocessor,Pattern matching
Conference
ISBN
Citations 
PageRank 
978-1-61284-962-1
4
0.46
References 
Authors
4
2
Name
Order
Citations
PageRank
Charalampos S. Kouzinopoulos1324.26
Konstantinos G. Margaritis230345.46