A Pattern Matching Algorithm for Double-Type Characters

A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite pre...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. s 571-572; pp. 461 - 464
Main Author Zhou, Hai Yan
Format Book Chapter Journal Article
LanguageEnglish
Published Switzerland Trans Tech Publications, Limited 10.06.2014
Trans Tech Publications Ltd
Subjects
Engineering: general
Pattern Matching
Multiple Pattern Matching
Finite Prefix Automata
Online AccessGet full text
ISBN3038351393
9783038351399
ISSN1660-9336
1662-7482
1662-7482
DOI10.4028/www.scientific.net/AMM.571-572.461

Cover

More Information
Summary:A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite prefix automata to match a double-byte character, so as to solve the storage expansion problems in which the double-byte cross data link table results. The method requires less storage in comparison with double-byte cross data link table, and has the same order of magnitude in efficiency as a single-byte cross-link table approach.
Bibliography:Selected, peer reviewed papers from the International Conference on Computers and Information Processing Technologies (ICCIPT 2014), April 23-24, 2014, Shanghai, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISBN:3038351393
9783038351399
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.571-572.461