Abstract
Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Jonathan D. Cohen
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Unresolved referenced work
Kept as external metadata until matched
Efficient Randomized Dictionary Matching Algorithms
10.1007/3-540-56024-6_21 · 1992
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Information Filtering and Retrieval: Two Sides of the Same Coin?
10.1145/138859.138861 · 1992
10.1145/800180.810247
10.1145/800180.810247
Space/Time Trade-offs in Hash Coding with Allowable Errors
10.1145/362686.362692 · 1970
A Hardware Hashing Scheme in the Design of a Multiterm String Comparator
10.1109/tc.1982.1676098 · 1982
10.6028/nist.sp.500-215.adhoc-erim
10.6028/nist.sp.500-215.adhoc-erim
10.1002/(sici)1097-4571(199504)46:33.0.co;2-6
10.1002/(sici)1097-4571(199504)46:3<162::aid-asi2>3.0.co;2-6
Recursive Hashing Functions for n-grams
10.1145/256163.256168 · 1997
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Unresolved referenced work
Kept as external metadata until matched
Gauging Similarity with n-Grams: Language-Independent Categorization of Text
10.1126/science.267.5199.843 · 1995
Access Methods for Text
10.1145/4078.4080 · 1985
Unresolved referenced work
Kept as external metadata until matched
Personalized Information Delivery: An Analysis of Information Filtering Methods
10.1145/138859.138866 · 1992
An Analysis of the Karp–Rabin String Matching Algorithm
10.1016/0020-0190(90)90135-k · 1990
Unresolved referenced work
Kept as external metadata until matched
Designing a Bloom Filter for Differential File Access
10.1145/358628.358632 · 1982
Unresolved referenced work
Kept as external metadata until matched
Implementation of the Substring Test for Hashing
10.1145/362919.362934 · 1971
Operational Characteristics of a Hardware-Based Pattern Matcher
10.1145/319830.319832 · 1983
Text Retrieval Computers
10.1109/mc.1979.1658653 · 1979
Special-Purpose Hardware for Text Searching: Past Experience, Future Potential
10.1016/0306-4573(91)90090-9 · 1991
10.1109/12.45209
10.1109/12.45209
An Introduction to Randomized Algorithms
10.1016/0166-218x(91)90086-c · 1991
Efficient Randomized Pattern-Matching Algorithms
10.1147/rd.312.0249 · 1987
Fast String Matching using an n-gram Algorithm
10.1002/spe.4380240105 · 1994
Unresolved referenced work
Kept as external metadata until matched
Techniques for Automatically Correcting Words in Text
10.1145/146370.146380 · 1992
Hashing for Dynamic and Static Internal Tables
10.1109/2.7056 · 1988
Key-to-Address Transform Techniques: A Fundamental Performance Study on Large Existing Formatted Files
10.1145/362575.362578 · 1971
TREC Routing Experiments with the TRW/Paracel Fast Data Finder
10.1016/0306-4573(94)00053-6 · 1995
10.1109/iccd.1993.393345
10.1109/iccd.1993.393345
Hardware for Character String Matching
1993
Processor Matches Text at High Speeds
1983
Hardware Algorithms for Nonnumeric Computation
10.1109/tc.1979.1675378 · 1979
A Second Look at Bloom Filters
10.1145/358161.358167 · 1983
10.1109/icde.1984.7271269
10.1109/icde.1984.7271269 · doi-reference
A High-Speed String-Search Engine
10.1109/jssc.1987.1052819 · doi-reference
Unconventional Text Retrieval Systems
10.1108/eb024418 · doi-reference
n-gram Statistics for Natural Language Understanding and Text Processing. IEEE Transactions on Pattern Analysis and Machine Intelligence
10.1109/tpami.1979.4766902 · doi-reference
Parallel Free-Text Search on the Connection Machine System
10.1145/7902.7907 · doi-reference
A Fixed-Size Bloom Filter for Searching Textual Documents
10.1093/comjnl/32.3.212 · doi-reference
Differential Files: Their Application to the Maintenance of Large Dictionaries
10.1145/320473.320484 · doi-reference
Introduction: Parallel Processing and Information Retrieval
10.1016/0306-4573(91)90083-x · doi-reference
Practical Performance of Bloom Filters and Parallel Free-Text Searching
10.1145/67933.67941 · doi-reference
10.1109/fpga.1993.279466
10.1109/fpga.1993.279466 · doi-reference
TELLTALE: Experiments in a Dynamic Hypertext Environment for Degraded and Multilingual Data
10.1002/(sici)1097-4571(199604)47:4<263::aid-asi2>3.0.co;2-v · doi-reference
Experience With a Space Efficient Way to Store a Dictionary
10.1145/358645.358654 · doi-reference
A Tale of Three Spelling Checkers
10.1002/spe.4380200607 · doi-reference
Accessing Textual Documents using Compressed Indexes of Arrays of Small Bloom Filters
10.1093/comjnl/30.4.343 · doi-reference