{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:15:13Z","timestamp":1781914513536,"version":"3.54.5"},"reference-count":172,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>\n            The primary goal of this article is to survey state-of-the-art indexing methods for approximate dictionary searching. To improve understanding of the field, we introduce a taxonomy that classifies all methods into direct methods and sequence-based filtering methods. We focus on infrequently updated dictionaries, which are used primarily for retrieval. Therefore, we consider indices that are optimized for retrieval rather than for update. The indices are assumed to be associative, that is, capable of storing and retrieving auxiliary information, such as string identifiers. All solutions are lossless and guarantee retrieval of strings within a specified edit distance\n            <jats:italic>k<\/jats:italic>\n            . Benchmark results are presented for the practically important cases of\n            <jats:italic>k<\/jats:italic>\n            =1, 2, and 3. We concentrate on natural language datasets, which include synthetic English and Russian dictionaries, as well as dictionaries of frequent words extracted from the ClueWeb09 collection. In addition, we carry out experiments with dictionaries containing DNA sequences. The article is concluded with a discussion of benchmark results and directions for future research.\n          <\/jats:p>","DOI":"10.1145\/1963190.1963191","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:51:38Z","timestamp":1307361098000},"source":"Crossref","is-referenced-by-count":51,"title":["Indexing methods for approximate dictionary searching"],"prefix":"10.1145","volume":"16","author":[{"given":"Leonid","family":"Boytsov","sequence":"first","affiliation":[{"name":"North Bethesda, MD"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,5,28]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1104"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(83)90022-5"},{"key":"e_1_2_2_3_1","volume-title":"Proceedings of the 5th Annual Symposium on Pattern Matching. Springer","author":"Baeza-Yates R."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the String Processing and Information Retrieval: A South American Symposium (SPIRE'98)","author":"Baeza-Yates R."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009253"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_2"},{"key":"e_1_2_2_8_1","unstructured":"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.  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."},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of the String Processing and Information Retrieval Symposium &amp; International Workshop on Groupware (SPIRE'99)","author":"Baeza-Yates R. A."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_13"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02441-2_14"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118737.3118845"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_2_15_1","volume-title":"Proceedings of the 22th International Conference on Very Large Data Bases. Morgan Kaufmann","author":"Berchtold S."},{"key":"e_1_2_2_16_1","unstructured":"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.  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."},{"key":"e_1_2_2_17_1","volume-title":"Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences. IEEE","author":"Bieganski P."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the 6th Russian Conference on Digital Libraries (RCDL'04)","author":"Boitsov L.","year":"2004"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the 10th International Workshop on Algorithms and Data Structures. Springer","author":"Botelho F."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.3115\/1075218.1075255"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of the 13th Symposium on Combinatorial Pattern Matching (CPM'02)","author":"Burkhardt S."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_9"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2003.12.003"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_21"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011343115154"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00344-7"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the 18th International Conference on Data Engineering. IEEE","author":"Cho J."},{"key":"e_1_2_2_31_1","unstructured":"Claude F. Fari\u00f1a A. and Navarro G. 2009. Re-Pair compression of inverted lists. CoRR abs\/0911.3318.  Claude F. Fari\u00f1a A. and Navarro G. 2009. Re-Pair compression of inverted lists. CoRR abs\/0911.3318."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11880561_27"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"key":"e_1_2_2_34_1","first-page":"2009","article-title":"Definately&ast; the most misspelled word in the english language (&ast;it should be definitely)","volume":"15","author":"Collins P.","year":"2009","journal-title":"The Daily Record"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/256329.256333"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120100561601"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/363958.363994"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/253495.253521"},{"key":"e_1_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Demaine E. D. L\u00f3pez-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.   Demaine E. D. L\u00f3pez-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.","DOI":"10.1007\/3-540-44808-X_7"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194094"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01933436"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674755"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.298177"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321820"},{"key":"e_1_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Faloutsos C. 1996. Searching Multimedia Databases by Content. Kluwer Academic Publisher Dordrecht The Netherlands.   Faloutsos C. 1996. Searching Multimedia Databases by Content. Kluwer Academic Publisher Dordrecht The Netherlands.","DOI":"10.1007\/978-1-4613-1445-5"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301378"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277833"},{"key":"e_1_2_2_48_1","volume-title":"Proceedings of the 6th International Workshop on Experimental Algorithms (WEA'07)","author":"Figueroa K."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69068-9_16"},{"key":"e_1_2_2_50_1","volume-title":"Proceedings of the 8th SPIE International Conference on Document Recognition and Retrieval. SPIE","author":"Ford G."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.06.012"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.535"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.6.873"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0885-2308(03)00006-8"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183723"},{"key":"e_1_2_2_59_1","volume-title":"SPELL: Spelling check and correction program","author":"Gorin R. E.","year":"1971"},{"key":"e_1_2_2_60_1","first-page":"28","article-title":"Using q-grams in a DBMS for approximate string processing","volume":"24","author":"Gravano L.","year":"2001","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90188-9"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"e_1_2_2_63_1","unstructured":"Gusfield D. 1999. Algorithms on Strings Trees and Sequences -- Computer Science and Computational Biology. Cambridge University Press Cambridge UK.   Gusfield D. 1999. Algorithms on Strings Trees and Sequences -- Computer Science and Computational Biology. Cambridge University Press Cambridge UK."},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_2_65_1","first-page":"223","article-title":"Anwendung einer bin\u00e4ren verweiskettenmethode beim aufbau von listen","volume":"10","author":"Gwehenberger G.","year":"1968","journal-title":"Elektronische Rechenanlagen"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356830"},{"key":"e_1_2_2_67_1","unstructured":"Hellerstein J. and Pfeffer A. 1994. The RD-tree: An index structure for sets. Tech. rep. 1252 University of Wisconsin at Madison.  Hellerstein J. and Pfeffer A. 1994. The RD-tree: An index structure for sets. Tech. rep. 1252 University of Wisconsin at Madison."},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39984-1_8"},{"key":"e_1_2_2_70_1","doi-asserted-by":"crossref","unstructured":"Hyyr\u00f6 H. 2003b. Practical methods for approximate string matching. Ph.D. thesis Department of Computer Science University of Tampere Finland.  Hyyr\u00f6 H. 2003b. Practical methods for approximate string matching. Ph.D. thesis Department of Computer Science University of Tampere Finland.","DOI":"10.1007\/3-540-45452-7_18"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.006"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/361932.361940"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2010.03.007"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.5555\/246460.246475"},{"key":"e_1_2_2_75_1","volume-title":"Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science. Springer","author":"Jokinen P."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth212"},{"key":"e_1_2_2_77_1","volume-title":"Proceedings of the 27th International Conference on Very Large Databases. Morgan Kaufmann","author":"Kahveci T."},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1975.1162637"},{"key":"e_1_2_2_79_1","unstructured":"Knuth D. 1973. The Art of Computer Programming. Sorting and Searching 1st ed. vol. 3. Addison-Wesley Upper Saddle River NJ.  Knuth D. 1973. The Art of Computer Programming. Sorting and Searching 1st ed. vol. 3. Addison-Wesley Upper Saddle River NJ."},{"key":"e_1_2_2_80_1","unstructured":"Knuth D. 1997. The Art of Computer Programming. Sorting and Searching 2d ed. vol. 3. Addison-Wesley Upper Saddle River NJ.  Knuth D. 1997. The Art of Computer Programming. Sorting and Searching 2d ed. vol. 3. Addison-Wesley Upper Saddle River NJ."},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025071200644"},{"key":"e_1_2_2_82_1","unstructured":"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.  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."},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/146370.146380"},{"key":"e_1_2_2_84_1","volume-title":"Proceedings of the 3rd South American Workshop on String Processing","author":"Kurtz S.","year":"1996"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13%3C1149::AID-SPE274%3E3.0.CO;2-O"},{"key":"e_1_2_2_86_1","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"163","author":"Levenshtein V.","year":"1966","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321880"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360258"},{"key":"e_1_2_2_89_1","volume-title":"Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'90)","author":"Manber U."},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_2_2_91_1","volume-title":"Proceedings of the USENIX","author":"Manber U.","year":"1994"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.1996.546828"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)90095-7"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1162\/0891201042544938"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219427900000028"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_15"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/358728.358752"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_2_2_100_1","volume-title":"Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching. Springer","author":"Muth R."},{"key":"e_1_2_2_101_1","doi-asserted-by":"crossref","unstructured":"Myers E. 1994. A sublinear algorithm for approximate keyword searching. Algorithmica 12 4\/5 345--374.  Myers E. 1994. A sublinear algorithm for approximate keyword searching. Algorithmica 12 4\/5 345--374.","DOI":"10.1007\/BF01185432"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"e_1_2_2_103_1","volume-title":"Proceedings of the 4th South American Workshop on String Processing","author":"Navarro G.","year":"1997"},{"key":"e_1_2_2_104_1","volume-title":"Proceedings of the 4th South American Workshop on String Processing","author":"Navarro G.","year":"1997"},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.411"},{"key":"e_1_2_2_107_1","first-page":"2","article-title":"A practical q-gram index for text retrieval allowing errors","volume":"1","author":"Navarro G.","year":"1998","journal-title":"CLEI Electron. J."},{"key":"e_1_2_2_108_1","first-page":"205","article-title":"A hybrid indexing method for approximate string matching","volume":"1","author":"Navarro G.","year":"2000","journal-title":"J. Discrete Algorithms"},{"key":"e_1_2_2_109_1","first-page":"19","article-title":"Indexing methods for approximate string matching","volume":"24","author":"Navarro G.","year":"2001","journal-title":"IEEE Data Engin. Bull."},{"key":"e_1_2_2_110_1","volume-title":"Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE'02)","author":"Navarro G."},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384246"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_21"},{"key":"e_1_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.003"},{"key":"e_1_2_2_114_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6393(00)00008-X"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"key":"e_1_2_2_117_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"e_1_2_2_118_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90027-8"},{"key":"e_1_2_2_119_1","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(95)00129-8"},{"key":"e_1_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380180407"},{"key":"e_1_2_2_121_1","volume-title":"Proceedings of the 3rd IEEE Symposium on BioInformatics and BioEngineering (BIBE'03)","author":"Ozturk O."},{"key":"e_1_2_2_122_1","volume-title":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA '01)","author":"Pagh R."},{"key":"e_1_2_2_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/359038.359041"},{"key":"e_1_2_2_124_1","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6146"},{"key":"e_1_2_2_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_2_2_126_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223971"},{"key":"e_1_2_2_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_2_2_128_1","doi-asserted-by":"publisher","DOI":"10.1145\/971699.318900"},{"key":"e_1_2_2_129_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496656_10"},{"key":"e_1_2_2_130_1","volume-title":"Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN'08)","author":"Russo L. M. S."},{"key":"e_1_2_2_131_1","doi-asserted-by":"publisher","DOI":"10.3390\/a2031105"},{"key":"e_1_2_2_132_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1198-x"},{"key":"e_1_2_2_133_1","volume-title":"Proceedings of the 7th International Congress on Acoustics. 65--68","author":"Sakoe H."},{"key":"e_1_2_2_134_1","volume-title":"Modern Database Systems in The Object Model, Interoperability and Beyond","author":"Samet H."},{"key":"e_1_2_2_135_1","unstructured":"Samet H. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann San Francisco CA.   Samet H. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann San Francisco CA."},{"key":"e_1_2_2_136_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.1.41"},{"key":"e_1_2_2_137_1","doi-asserted-by":"publisher","DOI":"10.5555\/647865.736786"},{"key":"e_1_2_2_138_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564416"},{"key":"e_1_2_2_139_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(73)90011-9"},{"key":"e_1_2_2_140_1","doi-asserted-by":"publisher","DOI":"10.1137\/0126070"},{"key":"e_1_2_2_141_1","volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases (VLDB'87)","author":"Sellis T. K."},{"key":"e_1_2_2_142_1","volume-title":"Proceedings of the 6th Text REtrieval Conference. National Institute of Standard and Technology","author":"Siegler M."},{"key":"e_1_2_2_143_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220355.1220358"},{"key":"e_1_2_2_144_1","volume-title":"Encyclopedia of Algorithms. 408--410.","author":"Sung W.-K."},{"key":"e_1_2_2_145_1","volume-title":"Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM '96)","author":"Sutinen E."},{"key":"e_1_2_2_146_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"e_1_2_2_147_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80046-2"},{"key":"e_1_2_2_148_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"e_1_2_2_149_1","doi-asserted-by":"publisher","DOI":"10.5555\/647813.738278"},{"key":"e_1_2_2_150_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"e_1_2_2_151_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(70)80008-6"},{"key":"e_1_2_2_152_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00056348"},{"key":"e_1_2_2_153_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(86)90013-9"},{"key":"e_1_2_2_154_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01074755"},{"key":"e_1_2_2_155_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_2_2_156_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04205-8_17"},{"key":"e_1_2_2_157_1","volume-title":"Proceedings of the 24th International Conference on Very Large Data Bases. Morgan Kaufmann","author":"Weber R."},{"key":"e_1_2_2_158_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"e_1_2_2_159_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9002-8"},{"key":"e_1_2_2_160_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026684"},{"key":"e_1_2_2_161_1","volume-title":"Proceedings of the IEEE International Conference on Acoustic, Speech, and Signal Processing. IEEE","author":"Woodland P."},{"key":"e_1_2_2_162_1","volume-title":"Proceedings of the USENIX Winter Technical Conference. USENIX","author":"Wu S."},{"key":"e_1_2_2_163_1","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135244"},{"key":"e_1_2_2_164_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01942606"},{"key":"e_1_2_2_165_1","first-page":"2006","article-title":"Telefonica's dispute over an accented domain in Chile","volume":"30","author":"Zaliznyak M.","year":"2006","journal-title":"Multilingual Search"},{"key":"e_1_2_2_166_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(81)90044-3"},{"key":"e_1_2_2_167_1","volume-title":"Similarity Search: The Metric Space Approach (Advances in Database Systems)","author":"Zezula P.","year":"2005"},{"key":"e_1_2_2_168_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250307"},{"key":"e_1_2_2_169_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243258"},{"key":"e_1_2_2_170_1","doi-asserted-by":"publisher","DOI":"10.1145\/296854.277632"},{"key":"e_1_2_2_171_1","volume-title":"Proceedings of the 19th international Conference on Very Large Data Bases. Morgan Kaufmann","author":"Zobel J."},{"key":"e_1_2_2_172_1","doi-asserted-by":"publisher","DOI":"10.3115\/100964.100983"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963190.1963191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1963190.1963191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:02Z","timestamp":1750278362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963190.1963191"}},"subtitle":["Comparative analysis"],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":172,"alternative-id":["10.1145\/1963190.1963191"],"URL":"https:\/\/doi.org\/10.1145\/1963190.1963191","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}