Improved fast similarity search in dictionaries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6393 LNCS, Issue , 2010, Pages 173-178

  Karch, Daniel ^a   Luxen, Dennis ^a   Sanders, Peter ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DICTIONARY MATCHING; FAULT-TOLERANT; MAXIMUM DISTANCE; MEMORY CONSUMPTION; PREPROCESSING TIME; QUERY WORDS; RUNNING TIME; SIMILARITY SEARCH;

DATA STRUCTURES; TOWERS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INFORMATION RETRIEVAL;

EID: 78449310595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_16     Document Type: Conference Paper

References (12)

1. Baeza-Yates, R., Navarro, G.: Fast approximate string matching in a dictionary. In: SPIRE (1998)
2. Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Commun. ACM 16, 230-236 (1973)
3. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33, 273-321 (2001)
4. Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: 36th ACM Symposium on Theory of Computing (2004)
5. Russo, L.M.S., Navarro, G., Oliveira, A.L., Morales, P.: Approximate string matching with compressed indexes. Algorithms 2(3), 1105-1136 (2009)
6. Mihov, S., Schulz, K.U.: Fast approximate search in large dictionaries. Comput. Linguist. 30, 451-477 (2004)
7. Chan, H.L., Lam, T.W., Sung, W.K., Tam, S.L., Wong, S.S.: Compressed indexes for approximate string matching. Algorithmica (2008)
8. Burkhardt, S., Kärkkäinen, J.: Better filtering with gapped q-grams. Fundamenta Informaticae (2001)
9. Bocek, T., Hunt, E., Stiller, B.: Fast similarity search in large dictionaries. Technical report, Universität Zürich (2007), http://fastss.csg.uzh.ch/
10. Mor, M., Fraenkel, A.S.: A hash code method for detecting and correcting spelling errors. ACM Commun. 25, 935-938 (1982)
11. Motwani, G., Nair, S.G.: Search efficiency in indexing structures for similarity searching. CoRR cs.DB/0403014 (2004)
12. Hyyrö, H., Fredriksson, K., Navarro, G.: Increased bit-parallelism for approximate string matching. ACM Journal of Experimental Algorithmics 10 (2005)