Abstract
Realizations of Aho-Corasick pattern matching machines which deal with several keywords at a time are studied from the viewpoint of run-time and space complexity. New realizations by means of dividing character codes and transition tables are introduced and shown to be efficient. A time-space trade-off in such realizations is pointed out. Experimental results on run-time of our realizations are shown and compared with those of some other well-known pattern matching techniques. Applications of our realizations to sorting and searching for keywords are also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have