Indexing methods for approximate dictionary searching, comparative analysis
From MaRDI portal
Recommendations
Cited in
(10)- Using signature hashing for approximate string matching
- Index structures for fast similarity search for symbol strings
- Compressing dictionary matching index via sparsification technique
- Dictionary compression and information source correction
- Upper and lower bounds for dynamic data structures on strings
- Indexing a Dictionary for Subset Matching Queries
- Simple, compact and robust approximate string dictionary
- Fuzzy \(k\)-minpen clustering and \(k\)-nearest-minpen classification procedures incorporating generic distance-based penalty minimizers
- Approximate similarity search under edit distance using locality-sensitive hashing
- Finding all stable matchings with couples
This page was built for publication: Indexing methods for approximate dictionary searching, comparative analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406235)