Abstract
Approximate string matching forms an important ingredient in many information systems. Commonly employed software methods for approximate string matching are computationally expensive, frequently making use of algorithms that compare the input string with every entry in a system database or dictionary. This paper examines the structure, implementation, and performance of a special-purpose string matching microprocessor. Details are given of a Multibus interface designed to ensure an optimal performance from the device. The design utilizes a single-board, configured as a Multibus slave, containing the Proximity processor and 1 2 Mbyte of dual-ported RAM. The paper compares the performance of the dynamic programming algorithm and the Proximity processor, and highlights the speed and recall advantages of the latter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
