Matching performance of binary correlation matrix memories
Transactions of the Society for Computer Simulation International - Special issue: simulation methodology in transportation systems
A technique for computer detection and correction of spelling errors
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
A Comparison of Standard Spell Checking Algorithms and a Novel Binary Neural Approach
IEEE Transactions on Knowledge and Data Engineering
A hardware-accelerated novel IR system
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
| Hi-index | 0.00 |
This article describes an approximate string matching method based on Correlation Matrix Memories (CMMs). As the measure of similarity, we use the Damerau-Levenshtein string edit distance, which is suitable for typing errors. CMMs are type of binary neural networks. They are capable of both exact and approximate matching (based on the Hamming distance). While the substitution operation can be performed by the common recalling method of CMM, the other edit operations (insertion, deletion and transposition) require enhancement of the recalling method. We incorporated a simple automaton for each of these operations into the recalling process. The proposed method preserves the advantage of this type of neural network: its simplicity. To keep both simplicity and the recalling speed, we primarily focus on approximate matching allowing a single error. Besides the edit distance problem we proposed two methods that speeds up the recalling process of CMMs.