{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:28:27Z","timestamp":1725560907754},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146831"},{"type":"electronic","value":"9783642146848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14684-8_3","type":"book-chapter","created":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T11:52:18Z","timestamp":1279972338000},"page":"13-30","source":"Crossref","is-referenced-by-count":1,"title":["fsm2 \u2013 A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hanneforth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI, Stanford (2003)"},{"key":"3_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":"3_CR3","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","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":"3_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":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04131-0_1","volume-title":"State of the Art in Computational Morphology","author":"T. Hanneforth","year":"2009","unstructured":"Hanneforth, T.: Using ranked semirings for representing morphology automata. In: Mahlow, C., Pietrowski, M. (eds.) State of the Art in Computational Morphology, pp. 1\u20139. Springer, Heidelberg (2009)"},{"key":"3_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11780885_9","volume-title":"Finite-State Methods and Natural Language Processing","author":"T. Hanneforth","year":"2006","unstructured":"Hanneforth, T.: Longest-match pattern matching with weighted finite state automata. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol.\u00a04002, pp. 78\u201385. Springer, Heidelberg (2006)"},{"key":"3_CR7","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)"},{"key":"3_CR8","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":"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)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44674-5_19","volume-title":"Implementation and Application of Automata","author":"M. Mohri","year":"2001","unstructured":"Mohri, M.: Generic epsilon-removal algorithm for weighted automata. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 230\u2013242. Springer, Heidelberg (2001)"},{"key":"3_CR11","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":"3_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-94-015-9719-7_6","volume-title":"Robustness in Language and Speech Technology","author":"M. Mohri","year":"2001","unstructured":"Mohri, M., Nederhof, M.J.: Regular approximation of context-free grammars through transformation. In: Junqua, J.C., van Noord, G. (eds.) Robustness in Language and Speech Technology, pp. 153\u2013163. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M. Mohri","year":"2000","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science\u00a0231, 17\u201332 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: The replace operator. In: 33th Annual Meeting of the Association for Computational Linguistics, pp. 16\u201323 (1995)","DOI":"10.3115\/981658.981661"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Allauzen, C., Mohri, M., Roark, B.: Generalized Algorithms for Constructing Statistical Language Models. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics. The Association for Computational Linguistics, vol.\u00a041, pp. 40\u201347 (2003)","DOI":"10.3115\/1075096.1075102"},{"key":"3_CR16","first-page":"313","volume":"19","author":"T. Hanneforth","year":"2009","unstructured":"Hanneforth, T., W\u00fcrzner, K.M.: Statistical language models within the algebra of weighted rational languages. Acta Cybernetica\u00a019, 313\u2013356 (2009)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"3_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":"3_CR18","volume-title":"Statistical Methods for Speech Recognition. Language, Speech and Communication","author":"F. Jelinek","year":"1997","unstructured":"Jelinek, F.: Statistical Methods for Speech Recognition. Language, Speech and Communication. MIT Press, Cambridge (1997)"},{"issue":"6","key":"3_CR19","doi-asserted-by":"crossref","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 Bibiographic 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":"3_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. Comput. Linguist.\u00a026(1), 3\u201316 (2000)","journal-title":"Comput. Linguist."}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14684-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:30Z","timestamp":1606186590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14684-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146831","9783642146848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14684-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}