{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:54:58Z","timestamp":1725605698513},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642218743"},{"type":"electronic","value":"9783642218750"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21875-0_21","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:51:59Z","timestamp":1315482719000},"page":"201-210","source":"Crossref","is-referenced-by-count":0,"title":["Computation of Similarity\u2014Similarity Search as Computation"],"prefix":"10.1007","author":[{"given":"Stoyan","family":"Mihov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"C.J. Burges","year":"1998","unstructured":"Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery\u00a02(2), 121\u2013167 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11735106_6","volume-title":"Advances in Information Retrieval","author":"A. Ernst-Gerlach","year":"2006","unstructured":"Ernst-Gerlach, A., Fuhr, N.: Generating search term variants for text collections with historic spellings. In: Lalmas, M., MacFarlane, A., R\u00fcger, S.M., Tombros, A., Tsikrika, T., Yavlinsky, A. (eds.) ECIR 2006. LNCS, vol.\u00a03936, pp. 49\u201360. Springer, Heidelberg (2006)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1568296.1568309","volume-title":"AND 2009: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data","author":"A. Gotscharek","year":"2009","unstructured":"Gotscharek, A., Neumann, A., Reffle, U., Ringlstetter, C., Schulz, K.U.: Enabling information retrieval on historical document collections: the role of matching procedures and special lexica. In: AND 2009: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data, pp. 69\u201376. ACM, New York (2009), doi:10.1145\/1568296.1568309"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.7551\/mitpress\/3007.003.0013","volume-title":"Finite-State Language Processing","author":"M. Gross","year":"1997","unstructured":"Gross, M.: The Construction of Local Grammars. In: Finite-State Language Processing, pp. 329\u2013352. The MIT Press, Cambridge (1997)"},{"key":"21_CR5","volume-title":"Spoken Language Processing","author":"X. Huang","year":"2001","unstructured":"Huang, X., Acero, A., Hon, H.W.: Spoken Language Processing. Prentice Hall, New Jersey (2001)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Kukich, K.: Techniques for automatically correcting words in texts. ACM Computing Surveys, 377\u2013439 (1992)","DOI":"10.1145\/146370.146380"},{"key":"21_CR7","first-page":"282","volume-title":"Proc. 18th International Conf. on Machine Learning","author":"J. Lafferty","year":"2001","unstructured":"Lafferty, J., McCallum, A., Pereira, F.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Proc. 18th International Conf. on Machine Learning, pp. 282\u2013289. Morgan Kaufmann, San Francisco (2001)"},{"key":"21_CR8","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. (1966)"},{"issue":"4","key":"21_CR9","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 search in large dictionaries. Computational Linguistics\u00a030(4), 451\u2013477 (2004)","journal-title":"Computational Linguistics"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Mitankin, P., Mihov, S., Schulz, K.U.: Deciding word neighborhood with universal neighborhood automata. Theoretical Computer Science (in Press)","DOI":"10.1016\/j.tcs.2011.01.013"},{"key":"21_CR11","unstructured":"Mitankin, P., Mihov, S., Tinchev, T.: Large vocabulary continuous speech recognition for Bulgarian. In: Proceedings of the RANLP 2009 (2009)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/csla.1994.1001","volume":"8","author":"H. Ney","year":"1994","unstructured":"Ney, H., Essen, U., Kneser, R.: On structuring probabilistic dependencies in stochastic language modelling. Computer Speech & Language\u00a08, 1\u201338 (1994)","journal-title":"Computer Speech & Language"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1162\/089120103321337421","volume":"29","author":"F.J. Och","year":"2003","unstructured":"Och, F.J., Ney, H.: A systematic comparison of various statistical alignment models. Computational Linguistics\u00a029(1), 19\u201351 (2003)","journal-title":"Computational Linguistics"},{"issue":"1","key":"21_CR14","first-page":"73","volume":"22","author":"K. Oflazer","year":"1996","unstructured":"Oflazer, K.: Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics\u00a022(1), 73\u201389 (1996)","journal-title":"Computational Linguistics"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Rabiner, L.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. of IEEE\u00a077 (1989)","DOI":"10.1109\/5.18626"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1026034","volume":"26","author":"R. Redner","year":"1984","unstructured":"Redner, R., Walker, H.: Mixture densities, maximum likelihood and the EM algorithm. SIAM Review\u00a026(2), 195\u2013239 (1984)","journal-title":"SIAM Review"},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1289600.1289602","volume":"4","author":"C. Ringlstetter","year":"2007","unstructured":"Ringlstetter, C., Schulz, K.U., Mihov, S.: Adaptive text correction with webcrawled domain-dependent dictionaries. ACM Trans. Speech Lang. Process.\u00a04(4), 9 (2007)","journal-title":"ACM Trans. Speech Lang. Process."},{"key":"21_CR18","first-page":"471","volume-title":"ICDAR 2007: Proceedings of the Ninth International Conference on Document Analysis and Recognition","author":"K. Schulz","year":"2007","unstructured":"Schulz, K., Mihov, S., Mitankin, P.: Fast selection of small and precise candidate sets from dictionaries for text correction tasks. In: ICDAR 2007: Proceedings of the Ninth International Conference on Document Analysis and Recognition, pp. 471\u2013475. IEEE Computer Society Press, Washington, DC, USA (2007)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"K.U. Schulz","year":"2002","unstructured":"Schulz, K.U., Mihov, S.: Fast string correction with Levenshtein automata. International Journal of Document Analysis and Recognition\u00a05(1), 67\u201385 (2002)","journal-title":"International Journal of Document Analysis and Recognition"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Wagner, R., Fisher, M.: The string-to-string correction problem. Journal of the ACM (1974)","DOI":"10.1145\/321796.321811"}],"container-title":["Lecture Notes in Computer Science","Models of Computation in Context"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21875-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T04:32:09Z","timestamp":1712809929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21875-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642218743","9783642218750"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21875-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}