{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:13:06Z","timestamp":1773655986051,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642343988","type":"print"},{"value":"9783642343995","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-34399-5_1","type":"book-chapter","created":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T06:13:55Z","timestamp":1352182435000},"page":"3-25","source":"Crossref","is-referenced-by-count":1,"title":["Using HFST for Creating Computational Linguistic Applications"],"prefix":"10.1007","author":[{"given":"Krister","family":"Lind\u00e9n","sequence":"first","affiliation":[]},{"given":"Erik","family":"Axelson","sequence":"additional","affiliation":[]},{"given":"Senka","family":"Drobac","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Hardwick","sequence":"additional","affiliation":[]},{"given":"Miikka","family":"Silfverberg","sequence":"additional","affiliation":[]},{"given":"Tommi A.","family":"Pirinen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0129054109006772","volume":"20","author":"C. Allauzen","year":"2009","unstructured":"Allauzen, C., Mohri, M.: N-way composition of weighted finite-state transducers. International Journal of Foundations of Computer Science\u00a020, 613\u2013627 (2009)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-76336-9_3","volume-title":"Implementation and Application of Automata","author":"C. Allauzen","year":"2007","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst: A General and Efficient Weighted Finite-State Transducer Library. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 11\u201323. Springer, Heidelberg (2007), http:\/\/www.openfst.org"},{"key":"1_CR3","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI publications (2003)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Brants, T.: TnT - a statistical part-of-speech tagger. In: Proceedings of the Sixth Applied Natural Language Processing (ANLP 2000), Seattle, WA (2000)","DOI":"10.3115\/974147.974178"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"286","DOI":"10.3115\/1075218.1075255","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":"1_CR6","unstructured":"\u00c7\u00f6ltekin, \u00c7.: A freely available morphological analyzer for Turkish. In: Proceedings of the 7th International Conference on Language Resources and Evaluation, LREC 2010 (2010)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Gerdemann, D., van Noord, G.: Transducers from re-write rules with backreferences. In: Proceedings of the EACL Conference, pp. 126\u2013133 (1999)","DOI":"10.3115\/977035.977053"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hal\u00e1csy, P., Kornai, A., Oravecz, C.: Hunpos\u2014an open source trigram tagger. In: ACL 2007, Prague, Czech Republic (2007)","DOI":"10.3115\/1557769.1557830"},{"key":"1_CR9","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-23138-4_1","volume-title":"Systems and Frameworks for Computational Morphology","author":"L. Karttunen","year":"2011","unstructured":"Karttunen, L.: Beyond morphology: Pattern matching with FST. In: Mahlow, C., Piotrowski, M. (eds.) SFCM 2011. CCIS, vol.\u00a0100, pp. 1\u201313. Springer, Heidelberg (2011)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kempe, A., Karttunen, L.: Parallel replacement in finite state calculus. In: The Proceedings of the 16th International Conference on Computational Linguistics, pp. 622\u2013627 (1996)","DOI":"10.3115\/993268.993277"},{"key":"1_CR11","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-23138-4_5","volume-title":"Systems and Frameworks for Computational Morphology","author":"K. Lind\u00e9n","year":"2011","unstructured":"Lind\u00e9n, K., Axelson, E., Hardwick, S., Pirinen, T.A., Silfverberg, M.: HFST\u2014Framework for Compiling and Applying Morphologies. In: Mahlow, C., Piotrowski, M. (eds.) SFCM 2011. CCIS, vol.\u00a0100, pp. 67\u201385. Springer, Heidelberg (2011)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lind\u00e9n, K., Carlson, L.: Finnwordnet\u2014wordnet p\u00e5 finska via \u00f6vers\u00e4ttning. LexicoNordica\u00a017 (2010)","DOI":"10.7146\/ln.v0i17.18627"},{"key":"1_CR13","unstructured":"Lind\u00e9n, K., Pirinen, T.: Weighting finite-state morphological analyzers using hfst tools. In: FSMNLP 2009 (2009)"},{"key":"1_CR14","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-04131-0_3","volume-title":"State of the Art in Computational Morphology","author":"K. Lind\u00e9n","year":"2009","unstructured":"Lind\u00e9n, K., Silfverberg, M., Pirinen, T.: HFST Tools for Morphology \u2013 An Efficient Open-Source Package for Construction of Morphological Analyzers. In: Mahlow, C., Piotrowski, M. (eds.) SFCM 2009. CCIS, vol.\u00a041, pp. 28\u201347. Springer, Heidelberg (2009)"},{"issue":"5","key":"1_CR15","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":"1_CR16","unstructured":"Norvig, P.: How to write a spelling corrector. Web Page (2010), http:\/\/norvig.com\/spell-correct.html (visited February 28, 2010)"},{"issue":"1","key":"1_CR17","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":"1_CR18","unstructured":"Oravecz, C., Dienes, P.: Efficient stochastic part-of-speech tagging for Hungarian. In: Proceedings of the Third International Conference on Language Resources and Evaluation, Las Palmas, pp. 710\u2013717 (2002)"},{"key":"1_CR19","unstructured":"Pirinen, T.: Suomen kielen \u00e4\u00e4rellistilainen automaattinen morfologinen analyysi avoimen l\u00e4hdekoodin menetelmin. Master\u2019s thesis, Helsingin Yliopisto (2008), http:\/\/www.helsinki.fi\/~tapirine\/gradu\/"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Pirinen, T.A., Lind\u00e9n, K.: Creating and weighting hunspell dictionaries as finite-state automata. Investigationes Linguisticae\u00a019 (2010)","DOI":"10.14746\/il.2010.21.1"},{"key":"1_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 Languagages, Valletta, Malta, pp. 13\u201318 (2010)"},{"key":"1_CR22","unstructured":"Pirinen, T.A., Silfverberg, M., Lind\u00e9n, K.: Context-sensitive spelling correction. In: Gelbukh, A. (ed.) International Conference on Intelligent Text Processing and Computational Linguistics, New Delhi, India (2012)"},{"key":"1_CR23","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":"1_CR24","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Conflict resolution using weighted rules in hfst-twolc. In: Proceedings of the 17th Nordic Conference of Computational Linguistics NODALIDA 2009, pp. 174\u2013181. Nealt (2009)"},{"key":"1_CR25","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Hfst runtime format\u2014a compacted transducer format allowing for fast lookup. In: Watson, B., Courie, D., Cleophas, L., Rautenbach, P. (eds.) FSMNLP 2009 (July 13, 2009), http:\/\/www.ling.helsinki.fi\/~klinden\/pubs\/fsmnlp2009runtime.pdf"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Part-of-speech tagging using parallel weighted finite-state transducers. In: Proceedings of the 7th International Conference on NLP, IceTAL 2010 (2010)","DOI":"10.1007\/978-3-642-14770-8_40"},{"key":"1_CR27","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Combining statistical models for POS tagging using finite-state calculus. In: Proceedings of the 18th Conference on Computational Linguistics, NODALIDA 2011, pp. 183\u2013190 (2011)"},{"key":"1_CR28","unstructured":"Tzoukermann, E., Radev, D.: Using word class for part-of-speech disambiguation. In: Proceedings, Fourth Workshop on Very Large Corpora WVLC 1996, Copenhagen, Denmark (1996)"},{"key":"1_CR29","unstructured":"Yli-Jyr\u00e4, A.: Transducers from parallel replace rules and modes with generalized lenient composition. In: Finite-State Methods and Natural Language Processing (2008), http:\/\/www.ling.helsinki.fi\/users\/aylijyra\/all\/YliJyra-2008b:trafropar:inp.pdf"},{"key":"1_CR30","unstructured":"Zanchetta, E., Baroni, M.: Morph-it! a free corpus-based morphological resource for the Italian language. Corpus Linguistics\u00a01(1) (2005)"},{"key":"1_CR31","first-page":"224","volume-title":"Proceeding of the 2009 Conference on Finite-State Methods and Natural Language Processing: Post-Proceedings of the 7th International Workshop FSMNLP 2008","author":"A. Zielinski","year":"2009","unstructured":"Zielinski, A., Simon, C.: Morphisto \u2013 an open source morphological analyzer for German. In: Proceeding of the 2009 Conference on Finite-State Methods and Natural Language Processing: Post-Proceedings of the 7th International Workshop FSMNLP 2008, pp. 224\u2013231. IOS Press, Amsterdam (2009)"}],"container-title":["Studies in Computational Intelligence","Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34399-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T08:57:16Z","timestamp":1745139436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-34399-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642343988","9783642343995"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34399-5_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}