论文信息 - An algorithm and architecture for approximate string matching

An algorithm and architecture for approximate string matching

Approximate string matching attempts to determine how similar two strings are. An algorithm is developed for determining relative string similarity. An architecture for comparing strings using this algorithm is also developed. Using parallelism and iterative techniques, the similarity value is calculated. The length and number of matching substrings determine the amount of similarity.<<ETX>>

Edmund Pierzchala | D. Smith | E. Pierzchala | D. Smith

[1] Fred J. Damerau,et al. A technique for computer detection and correction of spelling errors , 1964, CACM.

[2] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[3] Patrick A. V. Hall,et al. Approximate String Matching , 1994, Encyclopedia of Algorithms.

[4] Robert A. Wagner,et al. On the complexity of the Extended String-to-String Correction Problem , 1975, STOC.

[5] H. D. Cheng,et al. VLSI architectures for string matching and pattern matching , 1987, Pattern Recognit..

[6] Robert A. Wagner,et al. An Extension of the String-to-String Correction Problem , 1975, JACM.

[7] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..