An Efficient Implementation of Static String Pattern Matching Machines

Authors:
Jun-ichi Aoe
Affiliations:
Univ. of Tokushima, Tokushima-City, Japan
Venue:
IEEE Transactions on Software Engineering
Year:
1989

Citing 8
Cited 6

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Automatic Derivation of Code Generators from Machine Descriptions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Peephole Optimization on Intermediate Code

ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimal perfect hash functions made simple

Communications of the ACM
Storing a sparse table

Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Computer Programs for Spelling Correction

Computer Programs for Spelling Correction

An Efficient Digital Search Algorithm by Using a Double-Array Structure

IEEE Transactions on Software Engineering
Meaningful term extraction and discriminative term selection in text categorization via unknown-word methodology

ACM Transactions on Asian Language Information Processing (TALIP)
Japanese text input system with digits

HLT '01 Proceedings of the first international conference on Human language technology research
A Table Compression Method for Extended Aho-Corasick Automaton

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A new technique of determining speaker's intention for sentences in conversation

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
A bibliography on computational molecular biology and genetics

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique for implementing a static transition table of a string pattern matching machine which locates all occurrences of a finite number of keywords in a string is described. The approach is based on S.C. Johnson's (1975) storage and retrieval method of the transition table of a finite-state machine. By restricting the transition table of the finite-state machine to that of the string pattern-matching machine, triple arrays of Johnsons's data structure can be reduced to two arrays. The retrieval program of the reduced data structure can be speeded up by a finite straight program without loops.