{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:05Z","timestamp":1725567065365},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269731"},{"type":"electronic","value":"9783540316770"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11511854_15","type":"book-chapter","created":{"date-parts":[[2010,9,26]],"date-time":"2010-09-26T17:18:46Z","timestamp":1285521526000},"page":"166-172","source":"Crossref","is-referenced-by-count":0,"title":["Street Address Correction Based on Spelling Techniques"],"prefix":"10.1007","author":[{"given":"Patricio","family":"Mois","sequence":"first","affiliation":[]},{"given":"Marcos","family":"Sep\u00falveda","sequence":"additional","affiliation":[]},{"given":"Humberto","family":"Proschle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"F.A. Damereau","year":"1964","unstructured":"Damereau, 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":"15_CR2","unstructured":"Tillenius, M.: Efficient Generation and Ranking of Spelling Error Corrections. NADA report TRITA-NA-E9621 (1996)"},{"key":"15_CR3","unstructured":"Kann, V., Domeij, R., Hollman, J., Tillenius, M.: Implementation aspects and applicationsof a spelling correction algorithm. NADA report TRITA-NA-9813 (1998)"},{"issue":"1","key":"15_CR4","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 Survey\u00a033 (1), 31\u201388 (2001)","journal-title":"ACM Computing Survey"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"K.U. Shulz","year":"2002","unstructured":"Shulz, 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"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Survey\u00a024 (4), 377\u2013439 (1992)","journal-title":"ACM Computing Survey"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"French, C.J., Powell, A.L., Schulman, E.: 1998. Applications of Approximate Word Matching in Information Retrieval. In: French, C.J. (ed.) Proceedings of the Sixth International Conference on Knowledge and Information Management, pp. 9\u201315 (1997)","DOI":"10.1145\/266714.266721"}],"container-title":["Lecture Notes in Computer Science","Database: Enterprise, Skills and Innovation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11511854_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:36Z","timestamp":1605643476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11511854_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269731","9783540316770"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11511854_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}