{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:48:24Z","timestamp":1725698904859},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321528"},{"type":"electronic","value":"9783642321535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32153-5_12","type":"book-chapter","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T09:30:43Z","timestamp":1343986243000},"page":"162-176","source":"Crossref","is-referenced-by-count":1,"title":["Super-Linear Indices for Approximate Dictionary Searching"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Boytsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Behm, A., Vernica, R., Alsubaiee, S., Ji, S., Lu, J., Jin, L., Lu, Y., Li, C.: UCI Flamingo Package 4.0 (2010)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-02441-2_14","volume-title":"Combinatorial Pattern Matching","author":"D. Belazzougui","year":"2009","unstructured":"Belazzougui, D.: Faster and Space-Optimal Edit Distance \u201c1\u201d Dictionary. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 154\u2013167. Springer, Heidelberg (2009)"},{"key":"12_CR3","unstructured":"Bocek, T., Hunt, E., Stiller, B.: Fast similarity search in large dictionaries, Technical report No. ifi-2007.02, Department of Informatics (IFI), University of Zurich (2007)"},{"key":"12_CR4","unstructured":"Botelho, F.C.: Near-Optimal Space Perfect Hashing Algorithms. PhD thesis, Graduate Program in Computer Science, Federal University of Minas Gerais, Brazil (2008)"},{"issue":"1\u20131.1","key":"12_CR5","first-page":"1","volume":"16","author":"L. Boytsov","year":"2011","unstructured":"Boytsov, L.: Indexing methods for approximate dictionary searching: Comparative analysis. J. Exp. Algorithmics 16, 1.1:1.1\u20131.1:1.91 (2011)","journal-title":"J. Exp. Algorithmics"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-03784-9_12","volume-title":"String Processing and Information Retrieval","author":"N.R. Brisaboa","year":"2009","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: Directly Addressable Variable-Length Codes. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 122\u2013130. Springer, Heidelberg (2009)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: STOC 2004: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 91\u2013100. ACM (2004)","DOI":"10.1145\/1007352.1007374"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"F. Damerau","year":"1964","unstructured":"Damerau, F.: A technique for computer detection and correction of spelling errors. Communications of the ACM\u00a07(3), 171\u2013176 (1964)","journal-title":"Communications of the ACM"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TC.1977.1674755","volume":"26","author":"W. Doster","year":"1977","unstructured":"Doster, W.: Contextual postprocessing system for cooperation with a multiple-choice character-recognition system. IEEE Trans. Comput.\u00a026, 1090\u20131101 (1977)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR10","unstructured":"Gorin, R.E.: SPELL: Spelling check and correction program, Online documentation: Describes operation of PDP-10 SPELL program (1971), \n                    \n                      http:\/\/pdp-10.trailing-edge.com\/decuslib10-03\/01\/43,50270\/spell.doc.html\n                    \n                    \n                   (accessed May 28, 2012)"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/356827.356830","volume":"12","author":"P. Hall","year":"1980","unstructured":"Hall, P., Dowling, G.: Approximate string matching. ACM Computing Surveys\u00a012(4), 381\u2013402 (1980)","journal-title":"ACM Computing Surveys"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Karch, D., Luxen, D., Sanders, P.: Improved fast similarity search in dictionaries. CoRR abs\/1008.1191 (2010)","DOI":"10.1007\/978-3-642-16321-0_16"},{"key":"12_CR13","unstructured":"Knuth, D.: The Art of Computer Programming. Sorting and Searching., 1st edn., vol.\u00a03. Addison-Wesley (1973)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich, K.: Technique for automatically correcting words in text. ACM Computing Surveys\u00a024(2), 377\u2013439 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"12_CR15","first-page":"845","volume":"163","author":"V. Levenshtein","year":"1965","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1162\/0891201042544938","volume":"30","author":"S. Mihov","year":"2004","unstructured":"Mihov, S., Schulz, K.U.: Fast approximate string search in large dictionaries. Computational Linguistics\u00a030(4), 451\u2013477 (2004)","journal-title":"Computational Linguistics"},{"issue":"12","key":"12_CR17","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/358728.358752","volume":"25","author":"M. Mor","year":"1982","unstructured":"Mor, M., Fraenkel, A.S.: A hash code method for detecting and correcting spelling errors. Communications of the ACM\u00a025(12), 935\u2013938 (1982)","journal-title":"Communications of the ACM"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0164-1212(95)00129-8","volume":"34","author":"O. Owolabi","year":"1996","unstructured":"Owolabi, O.: Dictionary organizations for efficient similarity retrieval. Journal of Systems and Software\u00a034(2), 127\u2013132 (1996)","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/bioinformatics\/16.1.41","volume":"16","author":"D. Sankoff","year":"2000","unstructured":"Sankoff, D.: The early introduction of dynamic programming into computational biology. Bioinformatics\u00a016(1), 41\u201347 (2000)","journal-title":"Bioinformatics"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Combinatorial Pattern Matching","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E.: Approximate String Matching Over Suffix Trees. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 228\u2013242. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32153-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:56:17Z","timestamp":1620114977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32153-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321528","9783642321535"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32153-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}