{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T20:15:24Z","timestamp":1785442524724,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642549021","type":"print"},{"value":"9783642549038","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54903-8_43","type":"book-chapter","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T18:47:24Z","timestamp":1397846844000},"page":"519-532","source":"Crossref","is-referenced-by-count":17,"title":["State-of-the-Art in Weighted Finite-State Spell-Checking"],"prefix":"10.1007","author":[{"given":"Tommi A.","family":"Pirinen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krister","family":"Lind\u00e9n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools, vol.\u00a01009. Pearson\/Addison Wesley (2007)"},{"key":"43_CR2","unstructured":"Beesley, K.R.: Morphological analysis and generation: A first step in natural language processing. In: First Steps in Language Documentation for Minority Languages: Computational Linguistic Tools for Morphology, Lexicon and Corpus Compilation, Proceedings of the SALTMIL Workshop at LREC, pp. 1\u20138 (2004)"},{"key":"43_CR3","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications (2003)"},{"key":"43_CR4","unstructured":"Bhagat, M.: Spelling Error Pattern Analysis of Punjabi Typed Text. Master\u2019s thesis, Thapar University (2007)"},{"key":"43_CR5","unstructured":"Brants, T., Popat, A.C., Xu, P., Och, F.J., Dean, J.: Large language models in machine translation. In: EMNLP (2007)"},{"key":"43_CR6","first-page":"286","volume-title":"ACL 2000: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics","author":"E. Brill","year":"2000","unstructured":"Brill, E., Moore, R.C.: An improved error model for noisy channel spelling correction. In: ACL 2000: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, pp. 286\u2013293. Association for Computational Linguistics, Morristown (2000)"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01889984","volume":"1","author":"K.W. Church","year":"1991","unstructured":"Church, K.W., Gale, W.A.: Probability scoring for spelling correction. Statistics and Computing\u00a01, 93\u2013103 (1991)","journal-title":"Statistics and Computing"},{"issue":"3","key":"43_CR8","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\u00a07(3), 171\u2013176 (1964)","journal-title":"Communications of the ACM"},{"issue":"2","key":"43_CR9","first-page":"275","volume":"15","author":"S. Deorowicz","year":"2005","unstructured":"Deorowicz, S., Ciura, M.G.: Correcting spelling errors by modelling their causes. International Journal of Applied Mathematics and Computer Science\u00a015(2), 275 (2005)","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Huld\u00e9n, M.: Foma: a finite-state compiler and library. In: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session, pp. 29\u201332. Association for Computational Linguistics (2009)","DOI":"10.3115\/1609049.1609057"},{"issue":"4","key":"43_CR11","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 Comput. Surv.\u00a024(4), 377\u2013439 (1992)","journal-title":"ACM Comput. Surv."},{"key":"43_CR12","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics\u2014Doklady\u00a010, 707\u2013710 (1966); Translated from Doklady Akademii Nauk SSSR, 845\u2013848"},{"key":"43_CR13","unstructured":"Max, A., Wisniewski, G.: Mining naturally-occurring corrections and paraphrases from wikipedia\u2019s revision history. In: Proceedings of LREC (2010)"},{"issue":"5","key":"43_CR14","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/0306-4573(91)90066-U","volume":"27","author":"E. Mays","year":"1991","unstructured":"Mays, E., Damerau, F.J., Mercer, R.L.: Context based spelling correction. Inf. Process. Manage.\u00a027(5), 517\u2013522 (1991)","journal-title":"Inf. Process. Manage."},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Handbook of Weighted Automata, pp. 213\u2013254 (2009)","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"43_CR16","unstructured":"N\u00e9meth, L.: Hunspell manual. Electronic Software Manual (manpage) (2011)"},{"key":"43_CR17","unstructured":"Norvig, P.: How to write a spelling corrector (2010), \n                    \n                      http:\/\/norvig.com\/spell-correct.html\n                    \n                    \n                   (referred January 11, 2011)"},{"issue":"1","key":"43_CR18","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. Comput. Linguist.\u00a022(1), 73\u201389 (1996)","journal-title":"Comput. Linguist."},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-75867-9_37","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2007","author":"J. Otero","year":"2007","unstructured":"Otero, J., Gra\u00f1a, J., Vilares, M.: Contextual spelling correction. In: Moreno D\u00edaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol.\u00a04739, pp. 290\u2013296. Springer, Heidelberg (2007)"},{"key":"43_CR20","unstructured":"Pirinen, T.A., Hardwick, S.: Effects of weighted finite-state language and error models on speed and efficiency of finite-state spell-checking. In: FSMNLP 2012, pp. 6\u201314. University of the Basque Country (2012)"},{"key":"43_CR21","unstructured":"Pirinen, T.A., Lind\u00e9n, K.: Finite-state spell-checking with weighted language and error models. In: Proceedings of the Seventh SaLTMiL Workshop on Creation and Use of Basic Lexical Resources for Less-Resourced Languages, Valletta, Malta, pp. 13\u201318 (2010)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Pirinen, T.A., Lind\u00e9n, K.: Creating and weighting Hunspell dictionaries as finite-state automata. Investigationes Linguisticae\u00a021 (2010)","DOI":"10.14746\/il.2010.21.1"},{"key":"43_CR23","unstructured":"Pirinen, T.A., Silfverberg, M., Lind\u00e9n, K.: Improving finite-state spellchecker suggestions with part of speech n-grams. In: CICLING (2012)"},{"key":"43_CR24","unstructured":"Pitk\u00e4nen, H.: Hunspell-in kes\u00e4koodi 2006: Final report. Technical report (2006), \n                    \n                      http:\/\/www.puimula.org\/htp\/archive\/kesakoodi2006-report.pdf\n                    \n                    \n                   (referred on September 16)"},{"issue":"4","key":"43_CR25","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TIT.1967.1054060","volume":"13","author":"J. Raviv","year":"1967","unstructured":"Raviv, J.: Decision making in Markov chains applied to the problem of pattern recognition. IEEE Transactions on Information Theory\u00a013(4), 536\u2013551 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"key":"43_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-36390-4_21","volume-title":"Implementation and Application of Automata","author":"A. Savary","year":"2003","unstructured":"Savary, A.: Typographical nearest-neighbor search in a finite-state lexicon and its application to spelling correction. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 251\u2013260. Springer, Heidelberg (2003)"},{"key":"43_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"K. Schulz","year":"2002","unstructured":"Schulz, K., Mihov, S.: Fast string correction with Levenshtein-automata. International Journal of Document Analysis and Recognition\u00a05, 67\u201385 (2002)","journal-title":"International Journal of Document Analysis and Recognition"},{"key":"43_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communications, i and ii. Bell Syst. Tech. J.\u00a027, 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"43_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-78135-6_52","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"A. Wilcox-O\u2019Hearn","year":"2008","unstructured":"Wilcox-O\u2019Hearn, A., Hirst, G., Budanitsky, A.: Real-word spelling correction with trigrams: A reconsideration of the Mays, Damerau, and Mercer model. In: Gelbukh, A. (ed.) CICLing 2008. LNCS, vol.\u00a04919, pp. 605\u2013616. Springer, Heidelberg (2008)"},{"key":"43_CR30","unstructured":"Drobac, S., Lind\u00e9n, K., Pirinen, T., Silfverberg, M.: Heuristic Hyperminimization of Finite-State Lexicons. In: The Proceedings of LREC, Reykavik, Iceland (2014)"}],"container-title":["Lecture Notes in Computer Science","Computational Linguistics and Intelligent Text Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54903-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T16:14:47Z","timestamp":1558887287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54903-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642549021","9783642549038"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54903-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}