In approximate string matching,the traditional edit distance cannot evaluate the similarity between strings very well,especially for the name and address datasets.

According to the main features of the algorithms,they are divided into the following several types: approximate string matching algorithm,tree-based algorithm,dynamic time warping algorithm,HMM-based algorithm,and other kind of the audio retrieval algorithms.

The purposes of it were to improve the efficiency of searching a string in a large-scale database by the means of approximate string matching and to provide a means to search a string with wildcards.

The two concise parallel dynamic programming algorithms for approximate string matching with k-differences on CREW-PRAM (parallel random access machine with concurrent read and exclusive write) are presented by parallel computing the edition distanc.

In many applications, the pattern needn t match the substringsof the text exactly, so people introduce the approximate string matching technology.

Network processor-based high performance string matching;

Improved multiple patterns string matching algorithm;

an Improved Collateral String Matching Algorithm;

This paper presents a high effective double hash floating pattern matching algorithm,which can be implemented on an FPGA easily.

In this paper, we present a novel pattern matching implementation using the Half Byte Comparators(HBC).