Approximate Chinese String Matching Techniques Based on Pinyin Input Method

Bing Liu; Dan  Han; Shuang Zhang

doi:10.4028/www.scientific.net/AMM.513-517.1017

Paper Titles

Multiple-Replica Public Auditing Protocol for Cloud Storage
p.999

An Improved Watermarking-Based Algorithm of Tamper Detection for Low-Cost EPC C1G2 RFID Tags
p.1005

Development of Virtual Prototype Template File Generator
p.1009

Wireless Data Acquisition System Based on ZigBee and FPGA Technology
p.1013

Approximate Chinese String Matching Techniques Based on Pinyin Input Method
p.1017

Fast Matching of Astronomical Data within Data Warehouse Architecture
p.1021

Optimizing Online Assignment of Harvesting Jobs to Trans-Regional Combines
p.1026

Design and Implementation Based the SOPC of the 2D-FFT Processor
p.1030

Dual-Core FFT Processor Based on a High-Speed Real-Time Floating-Point Butterfly Processing Element
p.1034

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Approximate Chinese String Matching Techniques...

Approximate Chinese String Matching Techniques Based on Pinyin Input Method

Abstract:

String matching is one of the most typical problems in computer science. Previous studies mainly focused on accurate string matching problem. However, with the rapid development of the computer and Internet as well as the continuously rising of new issues, people find that it has very important theoretical value and practical meaning to research and design efficient approximate string matching algorithms. Approximate string matching is also called string matching that allows errors, which mainly aims to find the pattern string in the text and database and allows k differences between the pattern string and its occurring forms in the text. For the problem of approximate string matching, though a number of algorithms have been proposed, there are fewer studies which focus on large size of alphabet . Most of experts are interested in small or middle size of alphabet . For large size of , especially for Chinese characters and Asian phonetics, there are fewer efficient algorithms. For the above reasons, this paper focuses on the approximate Chinese strings matching problem based on the pinyin input method.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1017-1020

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1017

Citation:

Cite this paper

Online since:

February 2014

Authors:

Bing Liu*, Dan Han, Shuang Zhang

Keywords:

Approximate String Matching, Chinese String, Pinyin Input Method, Q-Gram Technique

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Navarro G, Sutinen E and Tarhio J. Index text with approximate q-gram[J], Journal of Discrete Algorithms, 2005, Vol. 3: 157-175.

DOI: 10.1016/j.jda.2004.08.003

Google Scholar

[2] Gusfield D. Algorithms on strings, trees, and sequences: computer science and computational biology [M], The Press Syndicate of The University of Cambridge, 1997, 16-67.

DOI: 10.1017/cbo9780511574931

Google Scholar

[3] Navarro G. A guided tour to approximate string matching[J], ACM computing surveys(CSUR), 2001, Vol. 33(1): 31-88.

DOI: 10.1145/375360.375365

Google Scholar

[4] Crochemore M and Rytter W. Text algorithms[M], UK, Oxford University Press, (1995).

Google Scholar

[5] Crochemore M and Rytter W. Jewels of stringology[M], Singapore, World scientific, (2002).

Google Scholar