Efficient implementation of Aho - Corasick pattern matching automata using Unicode

Software - Practice and Experience

Volumn 37, Issue 6, 2007, Pages 669-690

  Nieminen, Janne ^a   Kilpeläinen, Pekka ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Aho Corasick; Implementation; String pattern matching; Transition function

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CODES (SYMBOLS); JAVA PROGRAMMING LANGUAGE; TREES (MATHEMATICS);

LINKED LIST; TRANSITION FUNCTIONS; UNICODE TEXT;

PATTERN MATCHING;

EID: 34248546283     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.785     Document Type: Article

References (26)

1. Aho A, Corasick M. Efficient string matching: An aid to bibliographic search. Communications of the ACM 1975; 18(6):333-340.
2. Knuth D, Morris J, Pratt V. Fast pattern matching in strings. SIAM Journal of Computing 1977; 6(2):323-350.
3. Wu S, Manber U. A fast algorithm for multi-pattern searching. Technical Report TR-94-17, Department of Computer Science, University of Arizona, 1994.
4. Allauzen C, Raffinot M. Factor oracle of a set of words. Technical Report 99-11, Institut Gaspard-Monge, Universitè de Marne-la- Vallèe, 1999.
5. Commenz-Walter B. A string matching algorithm fast on the average. Proceedings of the 6th International Colloquium on Automata, Languages and Programming (Lecture Notes in Computer Science, vol. 71). Springer: Berlin, 1979; 118-132.
6. Boyer R, Moore J. A fast string searching algorithm. Communications of the ACM 1977; 10(10):62-72.
7. Navarro G, Raffinot M. Flexible Pattern Matching in Strings. Cambridge University Press: Cambridge, 2002.
8. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press: New York, 1997.
9. Fredman M, Komlós J, Szemerédi E. Storing a sparse table with O(1) worst case access time. Journal of the ACM 1984; 31(3):538-544.
10. Aho A, Sethi R, Ullman J. Compilers: Principles, Techniques and Tools. Addison-Wesley: Reading. MA, 1986.
11. Aoe J. A practical method for implementing string pattern matching machines. Information Sciences 1992; 64(1-2): 95-114.
12. Arikawa S, Shinohara T. A run-time efficient realization of Aho-Corasick pattern matching machines. New Generation Computing 1984; 2(2): 171-186.
13. Ngassam E, Watson B, Kourie D. A framework for the dynamic implementation of finite automata for performance enhancement. International Journal of Foundations of Computer Science 2005; 16(6): 1193-1206.
14. The Unicode Consortium, Massachusetts, U.S.A. The Unicode Standard Version 4.0, 2003.
15. Lecroq T. Experiments on string matching in memory structures. Software: Practice and Experience 1998; 28(5):561-568.
16. Maosong S, Tianshun Y, Chunfa Y (eds.). Advances in computation of oriental languages. Proceedings of the 20th International Conference on Computer Processing of Oriental Languages. Tsinghua University Press, 2003.
17. Cormen T, Leiserson C, Rivest R, Stein C. Introduction to Algorithms (2nd edn). The MIT Press: Cambridge, MA, 2001.
18. Sprungnoli R. Perfect hashing functions: A single probe retrieving method for static sets. Communications of the ACM 1977; 20(11):841-850.
19. Cichelli R. Minimal perfect hash functions made simple. Communications of the ACM 1980; 23(1):17-19.
20. Carter J, Wegman M. Universal classes of hash functions. Journal of Computer and System Sciences 1979; 18(2): 143-154.
21. Motwani R, Raghavan P. Randomized Algorithms. Cambridge University Press: Cambridge, 1995.
22. Tarjan R, Yao A. Storing a sparse table. Communications of the ACM 1979; 22(11):606-611.
23. Sun Developer Network. Bug 4669519, 2002. http://bugs.sun.com/ bugdatabase/view_bug.do?bug_id=4669519 [12 September 2006].
24. Bill McGinnis Ministries. King James Bible, 2002. http://www.patriot.net/ users/bmcgin/ministries.html [12 September 2006].
25. Iglewicz B, Hoaglin DC. How To Detect and Handle Outliers. ASQC Quality Press: Milwaukee, WI, 1993.
26. Dietzfelbinger M, Karlin A, Mehlnorn K, Meyer auf der Heide F, Rohnert H, Tarjan R. Dynamic perfect hashing: Upper and lower bounds. Proceedings of the 29th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press: Los Alamitos, CA, 1988; 524-531.