PATTERN MATCHING MACHINES FOR REPLACING SEVERAL CHARACTER STRINGS
Setsuo Arikawa, Shuji Shiraishi · Bulletin of informatics and cybernetics · 1984
This paper presents a pattern matching machine which detects all occurrences of the longest possible keywords in a text and replaces them with the corresponding keywords. The pattern matching machine of this type is a generalized sequential machine and is constructed in nearly the same way as Aho-Corasick's pattern matching machine to locate all occurrences of keywords. We show algorithms to construct our pattern matching machine and to make the machine run on a given text string, and show the validities of them. We also consider the time complexity of the algorithms and evaluate the running time of the algorithms. Finally we discuss some applications of our pattern matching machines.