Title :
An algorithm and architecture for approximate string matching
Author :
Smith, David ; Pierzchala, Edmund
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
Abstract :
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
Keywords :
iterative methods; parallel algorithms; parallel architectures; algorithm; approximate string matching; architecture; iterative techniques; matching substrings; parallelism; relative string similarity; Books; Databases; Equations; Hardware; Iterative algorithms; Libraries; Microprocessors; Tellurium; Text processing; Very large scale integration;
Conference_Titel :
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location :
Calgary, Alta.
Print_ISBN :
0-7803-0081-5
DOI :
10.1109/MWSCAS.1990.140825
