<学術雑誌論文>
PATTERN MATCHING MACHINES FOR REPLACING SEVERAL CHARACTER STRINGS

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
Crossref DOI
概要 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.続きを見る

本文情報を非表示

p101 pdf 440 KB 275  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2020.10.22

この資料を見た人はこんな資料も見ています