{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:31:22Z","timestamp":1742923882908,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_1","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T02:32:11Z","timestamp":1251340331000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Using Ranked Semirings for Representing Morphology Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hanneforth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. In: Proceedings of COLING 1984, Stanford University, California, pp. 178\u2013181 (1984)","DOI":"10.3115\/980431.980529"},{"key":"1_CR2","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023, 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science\u00a0234, 177\u2013201 (2000)","journal-title":"Theoretical Computer Science"},{"key":"1_CR4","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)"},{"key":"1_CR5","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":"1_CR6","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, 321\u2013350 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"1_CR7","unstructured":"Volk, M.: Choosing the right lemma when analysing german nouns. In: Multilinguale Corpora: Codierung, Strukturierung, Analyse. 11. Jahrestagung der GLDV. Frankfurt, pp. 304\u2013310 (1999)"},{"key":"1_CR8","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":"1_CR9","unstructured":"Geyken, A., Schrader, N.: LexikoNet, a lexical database based on role and type hierarchies. In: Proceedings of LREC (2006)"},{"key":"1_CR10","unstructured":"Hanneforth, T.: FSM<> 2.0 \u2013 C++ library for manipulating (weighted) finite automata (2004), http:\/\/www.ling.uni-potsdam.de\/fsm"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:04:51Z","timestamp":1558490691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04131-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041303","9783642041310"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04131-0_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}