A Pattern Matching Algorithm for Double-Type Characters

Hai Yan Zhou

doi:10.4028/www.scientific.net/AMM.571-572.461

Paper Titles

Mobile Wireless Network Management System
p.443

Research of Mining High Power 802.11n Access Point
p.447

The Modeling Method and Analysis of Online Top-Up System Based on Open Petri Net
p.453

The Research of Auto After-Sales Service Personalized Recommendation Based on LBS
p.457

A Pattern Matching Algorithm for Double-Type Characters
p.461

Study on Design of Non-Uniform Energy Distribution Wireless Network
p.465

Manipulation of Quantum Communication Channel via Two-Level Atom Interacting with Caving Fields
p.469

Tourism Information Service Reliability under Unconventional Events
p.473

A Formal Method of Obligation Policy for Agent Interaction
p.481

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 571-572A Pattern Matching Algorithm for Double-Type...

A Pattern Matching Algorithm for Double-Type Characters

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 571-572)

Pages:

461-464

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.571-572.461

Citation:

Cite this paper

Online since:

June 2014

Authors:

Hai Yan Zhou*

Keywords:

Finite Prefix Automata, Multiple Pattern Matching, Pattern Matching

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Navarro G, Raffinot M. Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and BiologicalSequences. Cambridge: Cambridge University Press, 2002. 41-75.

DOI: 10.1017/cbo9781316135228

Google Scholar

[2] A V Aho, M J Corasick. Efficient string matching: An aid tobibliographic search. Communications of the ACM, 1975, 18(6): 333～340.

DOI: 10.1145/360825.360855

Google Scholar

[3] WU S, MANBER U. A fast algorithm for multi-pattern searching. http: /webglimpse. org/pubs/TR94-17. pdf.

Google Scholar

[4] Wei Li，Xiaohong Guan，Wenrong Tang. A fast matching algorithm based on a special cross data link table. JOURNAL OF CHINA INSTITUTE OF COMMUNICATIONS , 2004, 25(4): 38-44（In Chinese）.

Google Scholar

[5] WU S, MANBER U. A fast algorithm for multi-pattern searching. http: /webglimpse. org/pubs/TR94-17. pdf.

Google Scholar