PATTERN MATCHING MACHINES FOR REPLACING SEVERAL CHARACTER STRINGS
PATTERN MATCHING MACHINES FOR REPLACING SEVERAL CHARACTER STRINGS
复制标题
用于替换多个字符串的模式匹配机
DOI：
10.5109/13361
复制
发表时间：
1984
期刊：
影响因子：
--
通讯作者：
S. Shiraishi
中科院分区：
文献类型：
--
作者：
S. Arikawa;S. Shiraishi
本文提出了一种模式匹配机，它检测文本中所有出现的最长可能的关键字，并将它们替换为相应的关键字。这种类型的模式匹配机是一个广义的顺序机，并构造在几乎相同的方式AhoCorasick的模式匹配机定位所有出现的关键字。我们展示了构造模式匹配机的算法，并使机器在给定的文本字符串上运行，并展示了它们的有效性。我们还考虑了算法的时间复杂度，并评估了算法的运行时间。最后，我们讨论了我们的模式匹配机的一些应用。
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 AhoCorasick'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.