Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
A very fast substring search algorithm
Communications of the ACM
An improved algorithm for approximate string matching
SIAM Journal on Computing
Information processing in dynamical systems: foundations of harmony theory
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Self-indexing inverted files for fast text retrieval
ACM Transactions on Information Systems (TOIS)
Fast and practical approximate string matching
Information Processing Letters
Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Constant-space string-matching in sublinear average time
Theoretical Computer Science
Comparison of strings belonging to the same family
Information Sciences—Informatics and Computer Science: An International Journal
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Very fast and simple approximate string matching
Information Processing Letters
Simple optimal string matching algorithm
Journal of Algorithms
Approximate string matching using factor automata
Theoretical Computer Science
A fast string searching algorithm
Communications of the ACM
Self-Organizing Maps
Derivation of a parallel string matching algorithm
Information Processing Letters
String matching in Õ(√n + √m) quantum time
Journal of Discrete Algorithms
Theoretical Computer Science
A metric index for approximate string matching
Theoretical Computer Science
Speeding up transposition-invariant string matching
Information Processing Letters
Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
Theoretical Computer Science
The wide window string matching algorithm
Theoretical Computer Science
Transposition invariant string matching
Journal of Algorithms
A novel artificial neural network for sorting
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
A novel approach to real-time string filtering of large databases is presented. The proposed approach is based on a combination of artificial neural networks and operates in two stages. The first stage employs a self-organizing map for performing approximate string matching and retrieving those strings of the database which are similar to (i.e. assigned to the same SOM node as) the query string. The second stage employs a harmony theory network for comparing the previously retrieved strings in parallel with the query string and determining whether an exact match exists. The experimental results demonstrate accurate, fast and database-size independent string filtering which is robust to database modifications. The proposed approach is put forward for general-purpose (directory, catalogue and glossary search) and Internet (e-mail blocking, intrusion detection systems, URL and username classification) applications.