Hardware-assisted algorithm for full-text large-dictionary string matching using n-gram hashing
- 31 July 1998
- journal article
- Published by Elsevier BV in Information Processing & Management
- Vol. 34 (4), 443-464
- https://doi.org/10.1016/s0306-4573(98)00011-9
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Recursive hashing functions for n -gramsACM Transactions on Information Systems, 1997
- Highlights: Language- and domain-independent automatic indexing terms for abstractingJournal of the American Society for Information Science, 1995
- Gauging Similarity with n -Grams: Language-Independent Categorization of TextScience, 1995
- Personalized information deliveryCommunications of the ACM, 1992
- Information filtering and information retrievalCommunications of the ACM, 1992
- Efficient randomized dictionary matching algorithmsLecture Notes in Computer Science, 1992
- Access methods for textACM Computing Surveys, 1985
- A Hardware Hashing Scheme in the Design of a Multiterm String ComparatorInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1982
- Associative/parallel processors for searching very large textual data basesPublished by Association for Computing Machinery (ACM) ,1977
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970