318 search results - page 11 / 64 » A New Indexing Method for Approximate String Matching |
ECIR
2006
Springer
14 years 10 months ago
2006
Springer
Rule-based email filters mainly rely on the occurrence of critical words to classify spam messages. However, perceptive obfuscation techniques can be used to elude exact pattern ma...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
CIKM
2001
Springer
15 years 1 months ago
2001
Springer
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
LREC
2010
14 years 11 months ago
2010
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...