{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T21:42:40Z","timestamp":1772314960617,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642231377","type":"print"},{"value":"9783642231384","type":"electronic"}],"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-23138-4_5","type":"book-chapter","created":{"date-parts":[[2011,8,22]],"date-time":"2011-08-22T00:19:49Z","timestamp":1313972389000},"page":"67-85","source":"Crossref","is-referenced-by-count":20,"title":["HFST\u2014Framework for Compiling and Applying Morphologies"],"prefix":"10.1007","author":[{"given":"Krister","family":"Lind\u00e9n","sequence":"first","affiliation":[]},{"given":"Erik","family":"Axelson","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Hardwick","sequence":"additional","affiliation":[]},{"given":"Tommi A.","family":"Pirinen","sequence":"additional","affiliation":[]},{"given":"Miikka","family":"Silfverberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Compilers: Principles, Techniques, & Tools with Gradiance","author":"A.V. Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, & Tools with Gradiance, 2nd edn. Addison-Wesley Publishing Company, Reading (2007)","edition":"2"},{"key":"5_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":"5_CR3","unstructured":"Apache Software Foundation: Apache License, Version 2.0, http:\/\/www.apache.org\/licenses\/LICENSE-2.0.html"},{"key":"5_CR4","first-page":"118","volume-title":"Proceedings of the International Workshop on Finite State Methods in Natural Language Processing","author":"K.R. Beesley","year":"1998","unstructured":"Beesley, K.R.: Constraining separated morphotactic dependencies in finite-state grammars. In: Karttunen, L., Oflazer, K. (eds.) Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pp. 118\u2013127. Association for Computational Linguistics, Morristown (1998)"},{"key":"5_CR5","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford (2003)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM\u00a011, 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"5_CR7","unstructured":"Free Software Foundation: GNU Lesser General Public License, Version 3, http:\/\/www.gnu.org\/licenses\/lgpl.html"},{"key":"5_CR8","unstructured":"Garrido-Alenda, A., Forcada, M.L., Carrasco, R.C.: Incremental construction and maintenance of morphological analysers based on augmented letter transducers (2002)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Tech. rep., Stanford University, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"5_CR10","first-page":"57","volume":"43","author":"M. Huld\u00e9n","year":"2009","unstructured":"Huld\u00e9n, M.: Fast approximate string matching with finite automata. Procesamiento del Lenguaje Natural\u00a043, 57\u201364 (2009)","journal-title":"Procesamiento del Lenguaje Natural"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"406","DOI":"10.3115\/991886.991957","volume-title":"The Proceedings of the 15th International Conference on Computational Linguistics, Coling 1994","author":"L. Karttunen","year":"1994","unstructured":"Karttunen, L.: Constructing lexical transducers. In: The Proceedings of the 15th International Conference on Computational Linguistics, Coling 1994, pp. 406\u2013411. ACL, Morristown (1994)"},{"key":"5_CR12","unstructured":"Liang, F.M.: Word hyphenation by computer. Ph.D. thesis, Stanford University (1983), http:\/\/www.tug.org\/docs\/liang\/"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Lind\u00e9n, K., Silfverberg, M., Pirinen, T.: HFST tools for morphology\u2014an efficient open-source package for construction of morphological analyzers. In: Mahlow, Piotrowski (eds.) [14], pp. 28\u201347","DOI":"10.1007\/978-3-642-04131-0_3"},{"key":"5_CR14","series-title":"CCIS","volume-title":"State of the Art in Computational Morphology","year":"2009","unstructured":"Mahlow, C., Piotrowski, M. (eds.): SFCM 2009. CCIS, vol.\u00a041. Springer, Heidelberg (2009)"},{"key":"5_CR15","unstructured":"Proceedings of the 18th Nordic Conference of Computational Linguistics, Nodalida 2011, Riga, May 11-13 (2011)"},{"issue":"1","key":"5_CR16","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":"5_CR17","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":"5_CR18","unstructured":"Pirinen, T.: Modularisation of Finnish finite-state language description\u2013towards wide collaboration in open source development of a morphological analyser. In: Nodalida (ed.) [15],"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Pirinen, T.A., Lind\u00e9n, K.: Building and using existing hunspell dictionaries and TeX hyphenators as finite-state automata. In: Proccedings of Computational Linguistics \u2013 Applications, Wis\u0142a, Poland, pp. 25\u201332 (2010), http:\/\/www.helsinki.fi\/~tapirine\/publications\/Pirinen-cla-2010.pdf","DOI":"10.1109\/IMCSIT.2010.5679949"},{"key":"5_CR20","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":"5_CR21","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":"5_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11780885_38","volume-title":"Finite-State Methods and Natural Language Processing","author":"H. Schmid","year":"2006","unstructured":"Schmid, H.: A programming language for finite state transducers. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol.\u00a04002, pp. 308\u2013309. Springer, Heidelberg (2006)"},{"key":"5_CR23","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, Nealt, pp. 174\u2013181 (2009)"},{"key":"5_CR24","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 (July 13, 2009), http:\/\/www.ling.helsinki.fi\/~klinden\/pubs\/fsmnlp2009runtime.pdf"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-14770-8_40","volume-title":"Advances in Natural Language Processing","author":"M. Silfverberg","year":"2010","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Part-of-speech tagging using parallel weighted finite-state transducers. In: Loftsson, H., R\u00f6gnvaldsson, E., Helgad\u00f3ttir, S. (eds.) IceTAL 2010. LNCS, vol.\u00a06233, pp. 369\u2013380. Springer, Heidelberg (2010)"},{"key":"5_CR26","unstructured":"Silfverberg, M., Lind\u00e9n, K.: Combining statistical models for POS tagging using finite-state calculus. In: Nodalida (ed.) [15]"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Zielinski, A., Simon, C.: Morphisto: Service-oriented open source morphology for German. In: Mahlow, Piotrowski (eds.) [14], pp. 64\u201375.","DOI":"10.1007\/978-3-642-04131-0_5"}],"container-title":["Communications in Computer and Information Science","Systems and Frameworks for Computational Morphology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23138-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T02:58:28Z","timestamp":1560481108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23138-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231377","9783642231384"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23138-4_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}