Owing to new advances in computer hardware, large text databases have become more prevalent than ever.Automatically mining information from these databases proves to be a challenge due to slow pattern/string matching techniques. In this paper we present a new, fast multi-string pattern matching method based on the well known Aho-Chorasick algorithm. Advantages of our algorithm include:the ability to exploit the natural structure of text, the ability to perform significant character shifting, avoiding backtracking jumps that are not useful, efficiency in terms of matching time and avoiding the typical "sub-string" false positive errors.Our algorithm is applicable to many fields with free text, such as the health care domain and the scientific document field. In this paper, we apply the BSS algorithm to health care data and mine hundreds of thousands of medical concepts from a large Electronic Medical Record (EMR) corpora simultaneously and efficiently. Experimental results show the superiority of our algorithm when compared with the top of the line multi-string matching algorithms.
[1]
Martin Roesch,et al.
Snort - Lightweight Intrusion Detection for Networks
,
1999
.
[2]
Alfred V. Aho,et al.
Efficient string matching
,
1975,
Commun. ACM.
[3]
Chun-Ju Hsiao,et al.
Electronic medical record use by office-based physicians and their practices: United States, 2007.
,
2010,
National health statistics reports.
[4]
Udi Manber,et al.
A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING
,
1999
.
[5]
Beate Commentz-Walter,et al.
A String Matching Algorithm Fast on the Average
,
1979,
ICALP.