Indexing methods for approximate dictionary searching: Comparative analysis

ACM Journal of Experimental Algorithmics

Volumn 16, Issue , 2011, Pages

  Boytsov, Leonid ^a  

^a Unit 612   (United States)

Author keywords

Agrep; Approximate searching; Damerau Levenshtein distance; Frequency distance; Frequency vector trie; K errata tree; Levenshtein distance; Metric trees; Neighborhood generation; NR grep; Q gram; Q sample; Trie

Indexed keywords

EID: 84855336145     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1963190.1963191     Document Type: Conference Paper

References (172)

1. AMIR, A., KESELMAN, D., LANDAU, G. M., LEWENSTEIN, M., LEWENSTEIN, N., AND RODEH, M. 2000. Text indexing and dictionary matching with one error. J. Algorithms 37, 2, 309-325.
2. ANGELL, R. C., FREUND, G. E., AND WILLETT, P. 1983. Automatic spelling correction using a trigram similarity measure. Inf. Process. Manage. 19, 4, 443-453.
3. BAEZA-YATES, R., CUNTO, W., MANBER, U., AND WU, S. 1994. Proximity matching using fixed-queries trees. In Proceedings of the 5th Annual Symposium on Pattern Matching. Springer, Berlin, 198-212.
4. BAEZA-YATES, R. AND GONNET, G. 1992. A new approach to text searching. Commun. ACM 35, 10, 74-82.
5. BAEZA-YATES, R. AND NAVARRO, G. 1998. Fast approximate string matching in a dictionary. In Proceedings of the String Processing and Information Retrieval: A South American Symposium (SPIRE'98). IEEE, Los Alamitos, CA, 14-22.
6. BAEZA-YATES, R. AND NAVARRO, G. 1999. Faster approximate string matching. Algorithmica 23, 2, 127-158. (Pubitemid 129565528)
7. BAEZA-YATES, R. AND SALINGER, A. 2005. Experimental analysis of a fast intersection algorithm for sorted sequences. In Proceedings of the String Processing and Information Retrieval (SPIRE'05). Springer, Berlin, 13-24.
8. BAEZA-YATES, R. A. AND GONNET, G. H. 1990. All-against-all sequence matching: Preliminary version. http://www.dcc.uchile.cl/?rbaeza/cv/reports.html.
9. BAEZA-YATES, R. A. AND GONNET, G. H. 1999. A fast algorithm on average for all-against-all sequence matching. In Proceedings of the String Processing and Information Retrieval Symposium&InternationalWorkshop on Groupware (SPIRE'99). IEEE, Los Alamitos, CA. 16-23.
10. BARBAY, J.,LÓPEZ-ORTIZ, A., AND LU, T. 2006. Faster adaptive set intersections for text searching. In Proceedings of the 5th International Workshop on Experimental Algorithms (WEA'06). Springer, Berlin, 146-157. (Pubitemid 44070934)
11. BECKMANN, N., KRIEGEL, H., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of 1990 ACM SIGMOD International Conference on Management of Data. ACM, New York, 322-331.
12. BELAZZOUGUI, D. 2009. Faster and space-optimal edit distance 1 dictionary. In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09). Springer, Berlin, 154-167.
13. BENOIT, D., DEMAINE, E. D., MUNRO, J. I., RAMAN, R., RAMAN, V., AND RAO, S. S. 2005. Representing trees of higher degree. Algorithmica 43, 4, 275-292. (Pubitemid 43018037)
14. BENTLEY, J. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9, 509-517.
15. BERCHTOLD, S., KEIM, D. A., AND KRIEGEL, H. P. 1996. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22th International Conference on Very Large Data Bases. Morgan Kaufmann, San Francisco, CA, 28-39.
16. BERMAN, A. 1994. A new data structure for fast approximate matching. Tech. rep. 1994-03-02, Department of Computer Science and Engineering, University of Washington.
17. BIEGANSKI, P., RIEDL, J., CARTIS, J., AND RETZEL, E. 1994. Generalized suffix trees for biological sequence data: applications and implementation. In Proceedings of the Twenty-SeventhHawaii International Conference on System Sciences. IEEE, Los Alamitos, CA, 35-44.
18. BöHM, C., BERCHTOLD, S., AND KEIM, D. A. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 3, 322-373. (Pubitemid 33768486)
19. BOITSOV, L. 2004. Classification and experimental comparison of modern dictionary fuzzy search algorithms (in Russian). In Proceedings of the 6th Russian Conference on Digital Libraries (RCDL'04).
20. BOTELHO, F., PAGH, R., AND ZIVIANI, N. 2007. Simple and space-efficient minimal perfect hash functions. In Proceedings of the 10th International Workshop on Algorithms and Data Structures. Springer, Berlin, 139-150.
21. BRILL, E. ANDMOORE, R. C. 2000. An improved errormodel for noisy channel spelling correction. In Proceedings of the 38th AnnualMeeting on Association for Computational Linguistics. Association for Computational Linguistics, Stroudsburg, PA, 286-293.
22. BURKHARD, W. AND KELLER, R. 1973. Some approaches to best-match file searching. Commun. ACM 16, 4, 230-236.
23. BURKHARDT, S. AND KÄRKKÄINEN, J. 2002. One-gapped q-gram filter for Levenshtein distance. In Proceedings of the 13th Symposium on Combinatorial Pattern Matching (CPM'02). Springer, Berlin, 225-234.
24. CáNOVAS, R. AND NAVARRO, G. 2010. Practical compressed suffix trees. In Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). Springer, Berlin, 94-105.
25. CARTERETTE, B. AND CAN, F. 2005. Comparing inverted files and signature files for searching in a large lexicon. Inf. Process. Manage. 41, 3, 613-633.
26. CHAN, H.-L., LAM, T.-W., SUNG, W.-K., TAM, S.-L., AND WONG, S.-S. 2006. Compressed indexes for approximate string matching. In Proceedings of the 14th Annual European Symposium (ESA'06). Springer-Verlag, Berlin, 208-219. (Pubitemid 44699653)
27. CHáVEZ, E.,MARROQUíN, J. L., ANDNAVARRO,G. 2001. Fixed Queries Array: A fast and economical data structure for proximity searching. Multimedia Tools Appl. 14, 2, 113-135. (Pubitemid 32535790)
28. CHáVEZ, E. AND NAVARRO, G. 2003. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Inf. Process. Lett. 85, 1, 39-46. (Pubitemid 35412517)
29. CHáVEZ, E.,NAVARRO, G.,BAEZA-YATES, R., ANDMARROQUIN, J. L. 2001. Searching inmetric spaces. ACMComput. Surv. 33, 3, 273-321.
30. CHO, J. AND RAJAGOPALAN, S. 2002. A fast regular expression indexing engine. In Proceedings of the 18th International Conference on Data Engineering. IEEE, Los Alamitos, CA, 419-430. (Pubitemid 34278751)
31. CLAUDE, F., FARIÑA, A., AND NAVARRO, G. 2009. Re-Pair compression of inverted lists. CoRR abs/0911.3318.
32. COELHO, L. AND OLIVEIRA, A. 2006. Dotted Suffix Trees a structure for approximate text indexing. In Proceedings of the 13th International Conference on String Processing and Information Retrieval (SPIRE'06). Springer, Berlin, 329-336. (Pubitemid 44619019)
33. COLE, R., GOTTLIEB, L.-A., AND LEWENSTEIN, M. 2004. Dictionary matching and indexing with errors and don't cares. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM, New York, 91-100.
34. COLLINS, P. 2009. Definately* the most misspelled word in the english language (*it should be definitely). The Daily Record. June 15, 2009. http://www.dailyrecord.co.uk/news/editors-choice/2009/06/15/definatelythe- most-misspelled-word-in-the-english-language-it-should-be-definitely-86908- 21441847/.
35. COVINGTON, M. A. 1996. An algorithm to align words for historical comparison. Comput. Ling. 22, 4, 481-496. (Pubitemid 126420359)
36. DACIUK, J., MIHOV, S., WATSON, B. W., AND WATSON, R. E. 2000. Incremental construction of minimal acyclic finite-state automata. Comput. Ling. 26, 1, 3-16.
37. DAMERAU, F. 1964. A technique for computer detection and correction of spelling errors. Commun. ACM 7, 3, 171-176.
38. D'AMORE, R. J. AND MAH, C. P. 1985. One-time complete indexing of text: theory and practice. In Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'85). ACM, New York, 155-164.
39. DEMAINE, E. D., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2001. Experiments on adaptive set intersections for text retrieval systems. In Revised Papers from the 3rd International Workshop on Algorithm Engineering and Experimentation (ALENEX'01). Springer-Verlag, Berlin, 91-104. (Pubitemid 33340067)
40. DIETZFELBINGER, M., KARLIN, A.,MEHLHORN, K.,MEYER AUF DER HEIDE, F., ROHNERT, H., AND TARJAN, R. E. 1994. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23, 4, 738-761.
41. DöMöLKI, B. 1968. A universal compiler system based on production rules. BIT Numer. Math. 8, 262-275.
42. DOSTER, W. 1977. Contextual postprocessing system for cooperation with a multiple-choice characterrecognition system. IEEE Trans. Comput. 26, 1090-1101. (Pubitemid 8565241)
43. DU, M.W. AND CHANG, S. C. 1994. An approach to designing very fast approximate stringmatching algorithms. IEEE Trans. Knowl. Data Eng. 6, 4, 620-633.
44. ELIAS, P. 1974. Efficient storage and retrieval by content and address of static files. J. ACM 21, 2, 246-260.
45. FALOUTSOS, C. 1996. Searching Multimedia Databases by Content. Kluwer Academic Publisher, Dordrecht, The Netherlands.
46. FERRAGINA, P., MUTHUKRISHNAN, S., AND DE BERG, M. 1999. Multi-method dispatching: a geometric approach with applications to string matching problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99). ACM, New York, 483-491.
47. FERRAGINA, P. AND VENTURINI, R. 2007. Compressed permuterm index. In Proceedings of the 30th Annual International ACMSIGIR Conference on Research and Development in Information Retrieval (SIGIR'07). ACM, New York, 535-542. (Pubitemid 350167355)
48. FIGUEROA, K. AND FREDRIKSSON, K. 2007. Simple space-time trade-offs for AESA. In Proceedings of the 6th International Workshop on Experimental Algorithms (WEA'07). Springer, Berlin, 229-241. (Pubitemid 350259672)
49. FISCHER, J., MÄKINEN, V., AND NAVARRO, G. 2008. An(other) entropy-bounded compressed suffix tree. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM'08). Springer-Verlag, Berlin, 152-165.
50. FORD, G., HAUSE, S., LE, D. X., AND THOMA, G. R. 2001. Pattern matching techniques for correcting low confidence OCR words in a known context. In Proceedings of the 8th SPIE International Conference on Document Recognition and Retrieval. SPIE, Bellingham, WA, 241-249. (Pubitemid 32327177)
51. FREDMAN, M. L., KOMLÓS, J., AND SZEMERÉDI, E. 1984. Storing a sparse table with o(1) worst case access time. J. ACM 31, 3, 538-544.
52. FREDRIKSSON, K. 2007. Engineering efficient metric indexes. Pattern Recogn. Lett. 28, 1, 75-84. (Pubitemid 44646668)
53. FRIEDMAN, J. H., BENTLEY, J. L., AND FINKEL, R. A. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software 3, 3, 209-226.
54. GAEDE, V. AND GÜNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 170-231. (Pubitemid 128485203)
55. GIEGERICH, R., KURTZ, S., AND STOYE, J. 2003. Efficient implementation of lazy suffix trees. Softw., Pract. Exper. 33, 11, 1035-1049.
56. GILADI, E., WALKER, M. G., WANG, J. Z., AND VOLKMUTH, W. 2002. SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size. Bioinformatics 18, 6, 873-877.
57. GLASS, J. R. 2003. A probabilistic framework for segment-based speech recognition. Comput. Speech Lang. 17, 2-3, 137-152.
58. GOLLAPUDI, S. AND PANIGRAHY, R. 2006. A dictionary for approximate string search and longest prefix search. In Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM'06). ACM, New York, 768-775. (Pubitemid 47203622)
59. GORIN, R. E. 1971. SPELL: Spelling check and correction program. http://pdp-10.trailing-edge.com/decuslib10-03/01/43,50270/spell.doc.html.
60. GRAVANO, L., IPEIROTIS, P., JAGADISH, H. V., KOUDAS, N., MUTHUKRISHNAN, S., PIETARINEN, L., AND SRIVASTAVA, D. 2001. Using q-grams in a DBMS for approximate string processing. IEEE Data Eng. Bull. 24, 4, 28-34.
61. GROSSI, R. AND LUCCIO, F. 1989. Simple and efficient string matching with kmismatches. Inf. Process. Lett. 33, 3, 113-120. (Pubitemid 20624794)
62. GROSSI, R. AND VITTER, J. S. 2005. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 2, 378-407.
63. GUSFIELD, D. 1999. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK.
64. GUTTMAN, A. 1984. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, 47-57. (Pubitemid 15469534)
65. GWEHENBERGER, G. 1968. Anwendung einer binÄren verweiskettenmethode beim aufbau von listen. Elektronische Rechenanlagen 10, 223-226.
66. HALL, P. AND DOWLING, G. 1980. Approximate string matching. ACM Computing Surveys 12, 4, 381-402.
67. HELLERSTEIN, J. AND PFEFFER, A. 1994. The RD-tree: An index structure for sets. Tech. rep. 1252, University of Wisconsin at Madison.
68. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 301, 13-30.
69. HYYRö, H. 2003a. Bit-parallel approximate string matching algorithms with transposition. In Proceedings of the 10th International Symposium on String Processing. Springer-Verlag, Berlin, 95-107.
70. HYYRö, H. 2003b. Practical methods for approximate string matching. Ph.D. thesis, Department of Computer Science, University of Tampere, Finland.
71. HYYRö, H. 2005. Bit-parallel approximate string matching algorithms with transposition. J. Discrete Algorithms 3, 2-4, 215-229. (Pubitemid 40655179)
72. JAMES, E. B. AND PARTRIDGE, D. P. 1973. Adaptive correction of program statements. Commun. ACM 16, 1, 27-37.
73. JEONG, I.-S., PARK, K.-W., KANG, S.-H., AND LIM, H.-S. 2010. An efficient similarity search based on indexing in large dna databases. Comput. Biol. Chem. 34, 2, 131-136.
74. JOKINEN, P., TARHIO, J., AND UKKONEN, E. 1996. A comparison of approximate string matching algorithms. Software Pract. Exp. 26, 12, 1439-1458. (Pubitemid 126598523)
75. JOKINEN, P. AND UKKONEN, E. 1991. Two algorithms for approximate stringmatching in static texts. In Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science. Springer, Berlin, 240-248.
76. KAHVECI, T., LJOSA, V., AND SINGH, A. K. 2004. Speeding up whole-genome alignment by indexing frequency vectors. Bioinformatics 20, 13, 2122-2134. (Pubitemid 39236565)
77. KAHVECI, T. AND SINGH, A. 2001. An efficient index structure for string databases. In Proceedings of the 27th International Conference on Very Large Databases. Morgan Kaufmann, San Francisco, CA, 351-360.
78. KLOVSTAD, J. AND MONDSHEIN, L. 1975. The CASPERS linguistic analysis system. IEEE Trans. Acoust. Speech Signal Process. 23, 118-123.
79. KNUTH, D. 1973. The Art of Computer Programming. Sorting and Searching, 1st ed., vol. 3. Addison-Wesley, Upper Saddle River, NJ.
80. KNUTH, D. 1997. The Art of Computer Programming. Sorting and Searching, 2d ed., vol. 3. Addison-Wesley, Upper Saddle River, NJ.
81. KONDRAK, G. 2003. Phonetic alignment and similarity. Computers and the Humanities 37, 3, 273-291. (Pubitemid 44966841)
82. KUENNING, G., GORIN, R. E., WILLISSON, P., BUEHRING, W., AND STEVENS, K. 1988. International spell: a fast screen-oriented spelling checker. http://www.lasr.cs.ucla.edu/geoff/ispell.html.
83. KUKICH, K. 1992. Technique for automatically correcting words in text. ACM Comput. Surv. 24, 2, 377-439. (Pubitemid 23687641)
84. KURTZ, S. 1996. Approximate string searching under weighted edit distance. In Proceedings of the 3rd South American Workshop on String Processing. Carleton University Press, Ottawa, Ontario, 156-170.
85. KURTZ, S. 1999. Reducing the space requirement of suffix trees. Softw. Pract. Exper. 29, 13, 1149-1171. (Pubitemid 129303954)
86. LEVENSHTEIN, V. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR, 163, 4, 845-848.
87. LOWRANCE, R. AND WAGNER, R. 1975. An extension of the string-to-string correction problem. J. ACM 22, 2, 177-183.
88. MALY, K. 1976. Compressed tries. Commun. ACM 19, 7, 409-415.
89. MANBER, U. AND MYERS, G. 1990. Suffix arrays: a new method for on-line string searches. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'90). Society for Industrial and Applied Mathematics, Philadephia, PA, 319-327.
90. MANBER, U. AND WU, S. 1994a. An algorithm for approximate membership checking with application to password security. Inf. Process. Lett. 50, 4, 191-197. (Pubitemid 124013153)
91. MANBER, U. AND WU, S. 1994b. GLIMPSE: a tool to search through entire file systems. In Proceedings of the USENIX Winter 1994 Technical Conference (WTEC'94). USENIX, Berkeley, CA, 4-4.
92. MCCREIGHT, E. M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 2, 262-272.
93. MELICHAR, B. 1996. String matching with k differences by finite automata. In Proceedings of the International Congress on Pattern Recognition. IEEE, Los Alamitos, CA, 256-260.
94. MIC Ó, M. L., ONCINA, J., AND VIDAL-RUIZ, E. 1994. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recogn. Lett. 15, 1, 9-17.
95. MIHOV, S. AND SCHULZ, K. U. 2004. Fast approximate string search in large dictionaries. Comput. Ling. 30, 4, 451-477. (Pubitemid 41399544)
96. MOCHIZUKI, H. AND HAYASHI, Y. 2000. An efficient retrieval algorithm of compound words using extendible hashing. Int. J. Comput. Process. Oriental Lang. 13, 1, 15-33.
97. MOORE, T. AND EDELMAN, B. 2010. Measuring the perpetrators and funders of typosquatting. In Proceedings of the 14th International Conference on Financial Cryptography and Data Security. Springer, Berlin.
98. MOR, M. AND FRAENKEL, A. S. 1982. A hash code method for detecting and correcting spelling errors. Commun. ACM 25, 12, 935-938.
99. MORRISON, D. R. 1968. PATRICIA-practical algorithm to retrieve information coded in alphanumeric. J. ACM 15, 4, 514-534.
100. MUTH, R. AND MANBER, U. 1996. Approximate multiple string search. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching. Springer, Berlin, 75-86. (Pubitemid 126073711)
101. MYERS, E. 1994. A sublinear algorithm for approximate keyword searching. Algorithmica 12, 4/5, 345-374.
102. MYERS, E. 1999. A fast bit-vector algorithm for approximate stringmatching based on dynamic programming. J. ACM 46, 3, 395-415.
103. NAVARRO, G. 1997a. Multiple approximate string matching by counting. In Proceedings of the 4th South American Workshop on String Processing. Carleton University Press, Ottawa, Ontario, 95-111.
104. NAVARRO, G. 1997b. A partial deterministic automaton for approximate string matching. In Proceedings of the 4th South American Workshop on String Processing. Carleton University Press, Ottawa, Ontario, 112-124.
105. NAVARRO, G. 2001a. A guided tour to approximate string matching. ACM Comput. Surv. 33, 1, 31-88. (Pubitemid 33768480)
106. NAVARRO, G. 2001b. NR-grep: a fast and flexible pattern matching tool. Software Pract. Exp. 31, 13, 1265-1312. (Pubitemid 33074510)
107. NAVARRO, G. AND BAEZA-YATES, R. 1998. A practical q-gram index for text retrieval allowing errors. CLEI Electron. J. 1, 2.
108. NAVARRO, G. AND BAEZA-YATES, R. 2000. A hybrid indexing method for approximate string matching. J. Discrete Algorithms, 1, 1, 205-239.
109. NAVARRO, G., BAEZA-YATES, R., SUTINEN, E., AND TARHIO, J. 2001. Indexing methods for approximate string matching. IEEE Data Engin. Bull. 24, 4, 19-27.
110. NAVARRO, G., PAREDES, R., AND CHáVEZ, E. 2002. t-Spanners as a data structure for metric space searching. In Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE'02), Springer, Berlin, 195-200.
111. NAVARRO, G. AND RAFFINOT, M. 2000. Fast and flexible string matching by combining bit-parallelism and suffix automata. J. Exp. Algorithmics, 5, 4.
112. NAVARRO, G. AND SALMELA, L. 2009. Indexing variable length substrings for exact and approximate matching. In Proceedings of the 16th International Symposium on String Processing and Information Retrieval (SPIRE'09). Springer, Berlin, 214-221.
113. NAVARRO, G., SUTINEN, E., AND TARHIO, J. 2005. Indexing text with approximate q-grams. J. Discrete Algorithms 3, 2-4, 157-175. (Pubitemid 40655176)
114. NEEDLEMAN, S. B. AND WUNSCH, C. D. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 3, 443-453.
115. NG, K. AND ZUE, V.W. 2000. Subword-based approaches for spoken document retrieval. Speech Commun. 32, 3, 157-186.
116. NIEVERGELT, J.,HINTERBERGER, H., AND SEVCIK, K. C. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1, 38-71. (Pubitemid 14551881)
117. NILSSON, S. AND KARLSSON, G. 1999. IP-address lookup using LC-tries. IEEE J. Sel. Areas Commun. 17, 6, 1083-1092.
118. ORENSTEIN, J. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4, 150-157.
119. OWOLABI, O. 1996. Dictionary organizations for efficient similarity retrieval. J. Syst. Software 34, 2, 127-132. (Pubitemid 126363614)
120. OWOLABI, O. AND MCGREGOR, D. R. 1988. Fast approximate string matching. Software Pract. Exp. 18, 4, 387-393.
121. OZTURK, O. AND FERHATOSMANOGLU,H. 2003. Effective indexing and filtering for similarity search in large biosequence databases. In Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering (BIBE'03). IEEE, Los Alamitos, CA 359.
122. PAGH, R. AND RODLER, F. 2001. Cuckoo hashing. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA '01). Springer, Berlin, 121-133. (Pubitemid 33328952)
123. PETERSON, J. L. 1980. Computer programs for detecting and correcting spelling errors. Commun. ACM 23, 12, 676-687.
124. PETERSON, J. L. 1986. A note on undetected typing errors. Commun. ACM 29, 7, 633-637.
125. RAMAN, R., RAMAN, V., AND SATTI, S. R. 2007. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3, 4, 43.
126. RISEMAN, E. M. AND HANSON, A. R. 1974. A contextual postprocessing system for error correction using binary n-grams. IEEE Trans. Comput. 23, 5, 480-493.
127. ROBINSON, J. 1981. The K-D-B-Tree: A search structure for large multidimensional dynamic indexes. In Proceedings of 1981 ACM SIGMOD International Conference on Management of Data. ACM, New York, 10-18.
128. ROUSSOPOULOS, N. AND LEIFKER, D. 1985. Direct spatial search on pictorial databases using packed R-trees. SIGMOD Rec. 14, 4, 17-31. (Pubitemid 16563007)
129. RUSSO, L. AND OLIVEIRA, A. 2005. An efficient algorithm for generating super condensed neighborhoods. In Proceedings of the 16th Annual Combinatorial Pattern Matching Symposium (CPM'05). Springer, Berlin, 104-115. (Pubitemid 41422518)
130. RUSSO, L. M. S., NAVARRO, G., AND OLIVEIRA, A. L. 2008. Fully-compressed suffix trees. In Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN'08), Springer, Berlin, 362-373. (Pubitemid 351632202)
131. RUSSO, L. M. S., NAVARRO, G., OLIVEIRA, A. L., AND MORALES, P. 2009. Approximate string matching with compressed indexes. Algorithms 2, 3, 1105-1136.
132. SADAKANE, K. 2007. Compressed suffix trees with full functionality. Theor. Comp. Sys. 41, 4, 589-607.
133. SAKOE, H. AND CHIBA, S. 1971. A dynamic programming approach to continuous speech recognition. In Proceedings of the 7th International Congress on Acoustics. 65-68.
134. SAMET, H. 1995. Spatial data structures. In Modern Database Systems in The Object Model, Interoperability and Beyond. Addison-Wesley, Upper Saddle River, NJ, 361-385.
135. SAMET, H. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco, CA.
136. SANKOFF, D. 2000. The early introduction of dynamic programming into computational biology. Bioinformatics 16, 1, 41-47. (Pubitemid 30204200)
137. SCHEK,H. J. 1978. The reference string indexing method. In Proceedings of the 2nd Conference of the European Cooperation in Informatics. Springer-Verlag, Berlin, 432-459.
138. SCHOLER, F.,WILLIAMS, H. E., YIANNIS, J., AND ZOBEL, J. 2002. Compression of inverted indexes for fast query evaluation. In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in information Retrieval. ACM, New York, 222-229.
139. SCHUEGRAF, E. J. 1973. Selection of equifrequent work fragments for information retrieval. Inf. Storage Retrieval 9, 12, 697-711.
140. SELLERS, P. 1974. On the computation of evolutionary distances. SIAM J. Appl. Math. 26, 787-793.
141. SELLIS, T. K., ROUSSOPOULOS, N., AND FALOUTSOS, C. 1987. The R+-Tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th International Conference on Very LargeData Bases (VLDB'87).Morgan Kaufmann, San Francisco, CA, 507-518.
142. SIEGLER, M., WITBROCK, M. J., SLATTERY, S. T., SEYMORE, K., JONES, R. E., AND HAUPTMANN, A. G. 1997. Experiments in Spoken Document Retrieval at CMU. In Proceedings of the 6th Text REtrieval Conference. National Institute of Standard and Technology, Gaithersburg, MD, 291-302.
143. SKUT, W. 2004. Incremental construction of minimal acyclic sequential transducers from unsorted data. In Proceedings of the 20th International Conference on Computational Linguistics (COLING'04). Association for Computational Linguistics, Stroudsburg, PA, 15.
144. SUNG, W.-K. 2008. Indexed approximate string matching. In Encyclopedia of Algorithms. 408-410.
145. SUTINEN, E. AND TARHIO, J. 1996. Filtration with q-samples in approximate string matching. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM '96). Springer-Verlag, Berlin, 50-63. (Pubitemid 126073708)
146. UHLMANN, J. 1991. Satisfying general proximity similarity queries with metric trees. Inf. Process. Lett. 40, 175-179.
147. UKKONEN, E. 1985a. Algorithms for approximate string matching. Inf. Control 64, 1-3, 100-118.
148. UKKONEN, E. 1985b. Finding approximate patterns in strings. J. Algorithms 6, 1, 132-137.
149. UKKONEN, E. 1993. Approximate string matching over suffix trees. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Springer-Verlag, Berlin, 228-242.
150. UKKONEN, E. 1995. On-line construction of suffix trees. Algorithmica 14, 249-260.
151. VELICHKO, V. AND ZAGORUYKO, N. 1970. Automatic recognition of 200 words. Int. J. Man-Machine Stud. 2, 3, 223-234.
152. VERONIS, J. 1988. Computerized correction of phonographic errors. Computers and the Humanities 22, 1, 43-56.
153. VIDAL, E. 1986. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognit. Lett. 4, 3, 145-147.
154. VINTSYUK, T. 1968. Speech discrimination by dynamic programming. Cybernetics 4, 1, 52-57.
155. WAGNER, R. A. AND FISCHER, M. J. 1974. The string-to-string correction problem. J. ACM 21, 1, 168-173.
156. WANG, B., XIE, L., AND WANG, G. 2009. A two-tire index structure for approximate string matching with block moves. In Proceedings of the 2nd International Workshop on Managing Data Quality in Collaborative Information Systems and 1st International Workshop on Data and Process Provenance. Springer, Berlin, 197-211.
157. WEBER, R., SCHEK, H. J., AND BLOTT, S. 1998. A quantitative analysis and performance study for similaritysearch methods in high-dimensional spaces. In Proceedings of the 24th International Conference on Very Large Data Bases. Morgan Kaufmann, San Francisco, CA, 194-205.
158. WEINER, P. 1973. Linear pattern matching algorithms. In Proceedings the 14th IEEE Symposium on Switching and Automata Theory. IEEE, Los Alamitos, CA, 1-11.
159. WILBUR, W. J., KIM, W., AND XIE, N. 2006. Spelling correction in the PubMed search engine. Information Retrieval 9, 5, 543-564. (Pubitemid 44411752)
160. WILLET, P. 1979. Document retrieval experiments using indexing vocabularies of varying size. II. Hashing, truncation, digram and trigram encoding of index terms. J. Doc. 35, 4, 296-305.
161. WOODLAND, P., ODELL, J., VALTCHEV, V., AND YOUNG, S. 1994. Large vocabulary continuous speech recognition using HTK. In Proceedings of the IEEE International Conference on Acoustic, Speech, and Signal Processing. IEEE, Los Alamitos, CA, 3, 125-128.
162. WU, S. AND MANBER, U. 1992a. Agrep - a fast approximate matching tool. In Proceedings of the USENIX Winter Technical Conference. USENIX, Berkeley, CA, 153-162.
163. WU, S. AND MANBER, U. 1992b. Fast text searching allowing errors. Commun. ACM 35, 10, 83-91.
164. WU, S., MANBER, U., AND MYERS, E. 1996. A subquadratic algorithm for approximate limited expression matching. Algorithmica 15, 1, 50-67. (Pubitemid 126418807)
165. ZALIZNYAK, M. 2006. Telefonica's dispute over an accented domain in Chile. Multilingual Search. Sep 30, 2006. http://www.multilingual-search.com/ telefonica%C2%B4s-dispute-over-an-accented-domain-inchile/30/09/2006.
166. ZAMORA, E., POLLOCK, J., AND ZAMORA, A. 1981. The use of trigram analysis for spelling error detection. Inf. Process. Manage. 17, 6, 305-316.
167. ZEZULA, P., AMATO, G., DOHNAL, V., AND BATKO, M. 2005. Similarity Search: The Metric Space Approach (Advances in Database Systems). Springer-Verlag, Berlin.
168. ZOBEL, J. AND DART, P. 1995. Finding approximate matches in large lexicons. Software Pract. Exp. 25, 2, 331-345.
169. ZOBEL, J. AND DART, P. 1996. Phonetic string matching: lessons from information retrieval. In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, 166-172.
170. ZOBEL, J., MOFFAT, A., AND RAMAMOHANARAO, K. 1998. Inverted files versus signature files for text indexing. ACM Trans. Database Syst. 23, 4, 453-490.
171. ZOBEL, J., MOFFAT, A., AND SACKS-DAVIS, R. 1993. Searching large lexicons for partially specified terms using compressed inverted files. In Proceedings of the 19th international Conference on Very Large Data Bases. Morgan Kaufmann, San Francisco, CA, 290-301.
172. ZUE, V.,GLASS, J., PHILLIPS, M., AND SENEFF, S. 1989. The MIT SUMMIT speech recognition system: a progress report. In Proceedings of the Workshop on Speech and Natural Language (HLT '89). Association for Computational Linguistics, Morristown, NJ, 179-189.