{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:50:34Z","timestamp":1743141034706,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041303"},{"type":"electronic","value":"9783642041310"}],"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_4","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T02:32:11Z","timestamp":1251340331000},"page":"48-63","source":"Crossref","is-referenced-by-count":1,"title":["fsm2 \u2013 A Scripting Language for Creating Weighted Finite-State Morphologies"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hanneforth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI, Stanford (2003)"},{"key":"4_CR2","volume-title":"Computational Approaches to Syntax and Morphology","author":"B. Roark","year":"2007","unstructured":"Roark, B., Sproat, R.: Computational Approaches to Syntax and Morphology. Oxford University Press, Oxford (2007)"},{"key":"4_CR3","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg (1986)"},{"issue":"3","key":"4_CR4","first-page":"321","volume":"7","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics\u00a07(3), 321\u2013350 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"4_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11780885_7","volume-title":"Finite-State Methods and Natural Language Processing","author":"A. Geyken","year":"2006","unstructured":"Geyken, A., Hanneforth, T.: TAGH: A complete morphology for german based on weighted finite-state automata. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol.\u00a04002, pp. 55\u201366. Springer, Heidelberg (2006)"},{"key":"4_CR6","series-title":"Prentice Hall Series in Artificial Intelligence","volume-title":"Speech and Language Processing","author":"D. Jurafsky","year":"2000","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing. Prentice Hall Series in Artificial Intelligence. Prentice Hall, Upper Saddle River (2000)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Hanneforth, T.: Using ranked semirings for representing morphology automata. In: Mahlow, C., Piotrowski, M. (eds.) Proceedings of SFCM. Springer, Heidelberg (to appear)","DOI":"10.1007\/978-3-642-04131-0_1"},{"key":"4_CR8","volume-title":"Handbook of Weighted Automata","author":"M. Mohri","year":"2009","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Springer, Heidelberg (2009)"},{"issue":"2","key":"4_CR9","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"4_CR10","unstructured":"Schiller, A., Teufel, S., St\u00f6ckert, C., Thielen, C.: Guidelines f\u00fcr das Tagging deutscher Textcorpora mit STTS. Technical report, Institut fur maschinelle Sprachverarbeitung, Stuttgart (1999)"},{"key":"4_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11780885_23","volume-title":"Finite-State Methods and Natural Language Processing","author":"A. Schiller","year":"2006","unstructured":"Schiller, A.: German compound analysis with fsc. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol.\u00a04002, pp. 239\u2013246. Springer, Heidelberg (2006)"},{"key":"4_CR12","first-page":"91","volume-title":"Selected Papers from the 9th Conference on Natural Language Processing KONVENS 2008, Berlin, Mouton de Gruyter","author":"M. Junczys-Dowmunt","year":"2008","unstructured":"Junczys-Dowmunt, M.: Influence of accurate compound noun splitting on bilingual vocabulary extraction. In: Storrer, A., Geyken, A., Siebert, A., W\u00fcrzner, K.M. (eds.) Selected Papers from the 9th Conference on Natural Language Processing KONVENS 2008, Berlin, Mouton de Gruyter, pp. 91\u2013104. Mouton de Gruyter, Berlin (2008)"},{"key":"4_CR13","unstructured":"Lind\u00e9n, K., Pirinen, T.: Weighted finite-state morphological analysis of Finnish compounding with hfst-lexc. In: Jokinen, K., Bick, E. (eds.) NODALIDA 2009 Conference Proceedings, pp. 89\u201395 (2009)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F.C.N.: Dynamic compilation of weighted context-free grammars. In: Proceedings of ACL 1998, pp. 891\u2013897 (1998)","DOI":"10.3115\/980432.980716"},{"key":"4_CR15","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading (1979)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Amtrup, J.W.: Efficient finite state unification morphology. In: COLING 2004: Proceedings of the 20th international conference on Computational Linguistics, Morristown, NJ, USA, vol.\u00a0453. Association for Computational Linguistics (2004)","DOI":"10.3115\/1220355.1220420"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/TASSP.1987.1165125","volume":"35","author":"S.M. Katz","year":"1987","unstructured":"Katz, S.M.: Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech and Signal Processing\u00a035(3), 400\u2013401 (1987)","journal-title":"IEEE Transactions on Acoustics, Speech and Signal Processing"},{"key":"4_CR18","volume-title":"Language, Speech and Communication","author":"F. Jelinek","year":"1997","unstructured":"Jelinek, F.: Statistical Methods for Speech Recognition. In: Language, Speech and Communication. MIT Press, Cambridge (1997)"},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Communications of the Asscociation for Computing Machinery\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the Asscociation for Computing Machinery"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Watson, B.W., Mihov, S., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics\u00a026(1), 3\u201316 (2000)","journal-title":"Computational Linguistics"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:04:45Z","timestamp":1558490685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04131-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041303","9783642041310"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04131-0_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}