WallBreaker - Overcoming the wall effect in similarity search

ACM International Conference Proceeding Series

Volumn , Issue , 2013, Pages 366-369

  Gerdjikov, Stefan ^a   Mihov, Stoyan ^b   Mitankin, Petar ^a   Schulz, Klaus U ^c  

^a UNIVERSITY OF SOFIA   (Bulgaria)

^b INSTITUTE OF INFORMATION AND COMMUNICATION TECHNOLOGIES   (Bulgaria)

^c UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER PATTERNS; CLASSICAL SOLUTIONS; COMPACT DIRECTED ACYCLIC WORD GRAPHS; INDEX STRUCTURE; NEW APPROACHES; SEARCH STRATEGIES; SIMILARITY SEARCH; STRING SIMILARITY;

ALIGNMENT;

ERRORS;

EID: 84876802097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2457317.2457385     Document Type: Conference Paper

References (8)

1. http://www2.informatik.hu-berlin.de/~wandelt/searchjoincompetition2013.
2. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the Association for Computing Machinery, 34(3):578-595, 1987. (Pubitemid 17653424)
3. S. Gerdjikov, S. Mihov, P. Mitankin, and K. U. Schulz. Good parts first - a new algorithm for approximate search in lexica and string databases. ArXiv e-prints, Jan. 2013.
4. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. Word Journal Of The International Linguistic Association, 146(2):1-12, 2005.
5. S. Mihov and K. U. Schulz. Fast approximate search in large dictionaries. Computational Linguistics, 30(4):451-477, 2004. (Pubitemid 41399544)
6. P. Mitankin, S. Mihov, and K. U. Schulz. Deciding word neighborhood with universal neighborhood automata. Theoretical Computer Science, 412(22):2340-2355, 2011.
7. K. U. Schulz and S. Mihov. Fast string correction with Levenshtein automata. IJDAR, 5(1):67-85, 2002.
8. E. Ukkonen. Algorithms for approximate string matching. Information Control, 64:100-18, 1985.