{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:52:04Z","timestamp":1759693924724},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_21","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T23:45:05Z","timestamp":1180223105000},"page":"251-260","source":"Crossref","is-referenced-by-count":16,"title":["Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction"],"prefix":"10.1007","author":[{"given":"Agata","family":"Savary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"21_CR1","volume-title":"Ph.D. Thesis","author":"J. Daciuk","year":"1988","unstructured":"Daciuk, J.: Incremental Construction of Finite-State Automata and Transducers, and Their Use in the Natural Language Processing. Ph.D. Thesis, Politechnika Gdanska, Gdansk (1988)"},{"key":"21_CR2","first-page":"3","volume-title":"Computational Linguistics","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B., Watson, R.: Incremental Construction of Minimal Acyclic Finite State Automata. Computational Linguistics vol. 26(1). MIT Press, Massachusetts (2000) 3\u201316"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"F. J. Damerau","year":"1964","unstructured":"Damerau, F. J.: A Technique for Computer Detection and Correction of Spelling Errors. Communications of the ACM, Vol. 7(3) (1964) 171\u2013176","journal-title":"Communications of the ACM"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01185682","volume":"29","author":"M. W. Du","year":"1992","unstructured":"Du, M. W., Chang, S. C.: A model and a fast algorithm for multiple errors spelling correction. Acta Informatica, Vol. 29. Springer Verlag (1992) 281\u2013302","journal-title":"Acta Informatica"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Golding, A., Schabes, Y.: Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction. Proceedings, 34th Annual Meeting of the Association for Computational Linguistics (ACL), Santa Cruz. Association for Computational Linguistics (1996) 71\u201378","DOI":"10.3115\/981863.981873"},{"key":"21_CR6","first-page":"381","volume-title":"ACM Computing Surveys","author":"P. Hall","year":"1980","unstructured":"Hall, P., Dowling, G.: Approximate String Matching. ACM Computing Surveys, Vol. 12(4). ACM, New York. (1980) 381\u2013402"},{"key":"21_CR7","volume-title":"Computational Linguistics","author":"R. Kaplan","year":"1994","unstructured":"Kaplan, R., Kay, M.: Regular Models of Phonological Rule Systems. Computational Linguistics, Vol. 20(3). Cambridge, Massachusetts, MIT Press (1994)"},{"volume-title":"Extended Finite State Models of Language","year":"1999","key":"21_CR8","unstructured":"Kornai, A. (ed.): Extended Finite State Models of Language. Cambridge University Press, Cambridge, UK-New York, USA-Melbourne, Australia (1999)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Kukich, K.: Techniques for Automatically Correcting Words in Text. ACM Computing Surveys, Vol. 24(4) (1992)","DOI":"10.1145\/146370.146380"},{"key":"21_CR10","unstructured":"Laporte, E., Silberztein, M.: V\u00e9rification et correction orthographiques assist\u00e9es par ordinateur, Actes de la Convention IA 89 (1989)"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"R. Lowrance","year":"1975","unstructured":"Lowrance, R., Wagner, R. A.: An Extension of the String-to-String Correction Problem. Journal of the ACM, Vol. 22(2) (1975) 177\u2013183","journal-title":"Journal of the ACM"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TCOM.1982.1095395","volume":"30","author":"M. D. McIlroy","year":"1982","unstructured":"McIlroy, M. D.: Development of a Spelling List. IEEE Transactions on Communications, COM-30(1) (1982) 91\u201399","journal-title":"IEEE Transactions on Communications"},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Minimization of sequential transducers","author":"M. Mohri","year":"1994","unstructured":"Mohri, M.: Minimization of sequential transducers. Lecture Notes in Computer Science, Vol. 807. Springer Verlag. Berlin. (1994)"},{"key":"21_CR14","first-page":"73","volume-title":"Computational Linguistics","author":"K. Oflazer","year":"1996","unstructured":"Oflazer, K.: Error-tolerant finite state recognition with applications to morphological analysis and spelling correction. Computational Linguistics, Vol. 22(1). MIT Press, Cambridge, Massachusetts (1996) 73\u201389"},{"key":"21_CR15","unstructured":"Ren, X., Perrault, F.: The Typology of Unknown Words: An Experimental Study of Two Corpora. Proceedings, 15th International Conference on Computational Linguistics (COLING), Nantes. International Committee on Computational Linguistics (1992) 408\u2013414"},{"volume-title":"Finite-State Language Processing","year":"1997","key":"21_CR16","unstructured":"Roche. E., Schabes, Y. (eds.): Finite-State Language Processing. MIT Press, Cambridge, Massachusetts (1997)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"V\u00e9ronis, J.: Morphosyntactic correction in natural language interfaces. Proceedings, 13th International Conference on Computational Linguistics (COLING), Budapest. International Committee on Computational Linguistics (1988) 708\u2013713","DOI":"10.3115\/991719.991782"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M. J.: The String-to-String Correction Problem. Journal of the ACM, Vol. 21(1) (1974) 168\u2013173","journal-title":"Journal of the ACM"},{"key":"21_CR19","volume-title":"Ph.D. Thesis","author":"B. Watson","year":"1995","unstructured":"Watson, B.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. Thesis, Eindhoven University of Technology, the Netherlands (1995)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:06:54Z","timestamp":1550362014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}