{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T09:11:14Z","timestamp":1782810674163,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041303","type":"print"},{"value":"9783642041310","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04131-0_3","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T02:32:11Z","timestamp":1251340331000},"page":"28-47","source":"Crossref","is-referenced-by-count":20,"title":["HFST Tools for Morphology \u2013 An Efficient Open-Source Package for Construction of Morphological Analyzers"],"prefix":"10.1007","author":[{"given":"Krister","family":"Lind\u00e9n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miikka","family":"Silfverberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tommi","family":"Pirinen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production. University of Helsinki, Department of General Linguistics (1983)","DOI":"10.3115\/980431.980529"},{"key":"3_CR2","unstructured":"Karttunen, L., Koskenniemi, K., Kaplan, R.: A Compiler for Two-Level Phonological Rules. CSLI Publications (1987), http:\/\/www2.parc.com\/istl\/members\/karttune\/publications\/archive\/twolcomp.pdf"},{"key":"3_CR3","unstructured":"Karttunen, L.: Two-Level Rule Compiler, Technical Report ISTL-92-2, Xerox Palo Alto Research Center (1992), http:\/\/www.xrce.xerox.com\/competencies\/content-analysis\/fssoft\/docs\/twolc-92\/twolc92.html"},{"key":"3_CR4","unstructured":"Karttunen, L.: Finite-State Lexicon Compiler. Technical Report, ISTL-NLTT2993-04-02, Xerox Palo Alto Research Center, Palo Alto, California (1993)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: Constructing Lexical Transducers. In: The Proceedings of the 15th International Conference on Computational Linguistics COLING 1994, I, pp. 406\u2013411 (1994)","DOI":"10.3115\/991886.991957"},{"key":"3_CR6","volume-title":"Finite State Morphology","author":"K. Beesley","year":"2003","unstructured":"Beesley, K., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford (2003), http:\/\/www.fsmbook.com"},{"key":"3_CR7","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":"3_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2004.07.007","volume":"328","author":"S. Lombardy","year":"2004","unstructured":"Lombardy, S., R\u00e9gis-Gianas, Y., Sakharovitch, J.: Introducing Vaucanson. Theoretical Computer Science\u00a0328, 77\u201396 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR9","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":"3_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11816508_19","volume-title":"Advances in Natural Language Processing","author":"A. Yli-Jyr\u00e4","year":"2006","unstructured":"Yli-Jyr\u00e4, A., Koskenniemi, K.: Compiling Generalized Two-Level Rules and Grammars. In: Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. (eds.) FinTAL 2006. LNCS (LNAI), vol.\u00a04139, pp. 174\u2013185. Springer, Heidelberg (2006)"},{"key":"3_CR11","unstructured":"Pirinen, T.: Suomen kielen \u00e4\u00e4rellistilainen automaattinen morfologia avoimen l\u00e4hdekoodin menetelmin. Master\u2019s thesis, Helsingin yliopisto (2008)"}],"container-title":["Communications in Computer and Information Science","State of the Art in Computational Morphology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04131-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:04:44Z","timestamp":1558490684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04131-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041303","9783642041310"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04131-0_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}