{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:41Z","timestamp":1725488261309},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428121"},{"type":"electronic","value":"9783540455264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45526-4_11","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T05:12:00Z","timestamp":1185858720000},"page":"109-121","source":"Crossref","is-referenced-by-count":10,"title":["Compressed Storage of Sparse Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"George Anton","family":"Kiraz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"key":"11_CR1","volume-title":"Studies in Language","author":"M. Halle","year":"1971","unstructured":"Halle, M. and S. Keyser. 1971. English Stress, Its Forms, Its Growth, and Its Role in Verse. Studies in Language. Harper & Row, New York."},{"issue":"3","key":"11_CR2","first-page":"331","volume":"20","author":"R. Kaplan","year":"1994","unstructured":"Kaplan, R. and M. Kay. 1994. Regularmo dels of phonological rule systems. Computational Linguistics, 20(3):331\u201378.","journal-title":"Computational Linguistics"},{"key":"11_CR3","unstructured":"Karttunen, L. and K. Beesley. 1992. Two-level rule compiler. Technical report, Palo Alto Research Center, Xerox Corporation."},{"key":"11_CR4","unstructured":"Kay, M. and R. Kaplan. 1983. Word recognition. This paper was never published. The core ideas are published in Kaplan and Kay (1994)."},{"key":"11_CR5","unstructured":"Koskenniemi, K. 1983. Two-Level Morphology. Ph.D. thesis, University of Helsinki."},{"key":"11_CR6","unstructured":"Liang, F. 1983. Word Hy-phen-a-tion by Comp-uter. Ph.D. thesis, Stanford Univeristy."},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0031388","volume-title":"Automata Implementation","author":"M. Mohri","year":"1998","unstructured":"Mohri, M., F. Pereira, and M. Riley. 1998. A rational design for a weighted finitestate transducer library. In D. Wood and S. Yu, editors, Automata Implementation, Lecture Notes in Computer Science 1436. Springer, pages 144\u201358."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Mohri, M. and R. Sproat. 1996. An efficient compiler for weighted rewrite rules. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pages 231\u20138.","DOI":"10.3115\/981863.981894"},{"key":"11_CR9","volume-title":"Computational Morphology: Practical Mechanisms for the English Lexicon","author":"G. Ritchie","year":"1992","unstructured":"Ritchie, G., A. Black, G. Russell, and S. Pulman. 1992. Computational Morphology: Practical Mechanisms for the English Lexicon. MIT Press, Cambridge, MA."},{"issue":"2","key":"11_CR10","first-page":"227","volume":"21","author":"E. Roche","year":"1995","unstructured":"Roche, E. and Y. Schabes. 1995. Deterministic part-of-speech tagging with finite-state transducers. Computational Linguistics, 21(2):227\u201353.","journal-title":"Computational Linguistics"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Roche, E. and Y. Schabes, editors. 1997. Finite-State Language Processing. MIT Press.","DOI":"10.7551\/mitpress\/3007.001.0001"},{"volume-title":"Multilingual Text-to-Speech Synthesis: The Bell Labs Approach","year":"1997","key":"11_CR12","unstructured":"Sproat, R., editor. 1997. Multilingual Text-to-Speech Synthesis: The Bell Labs Approach. Kluwer, Boston, MA."},{"issue":"11","key":"11_CR13","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R. Tarjan","year":"1979","unstructured":"Tarjan, R. and A. Yao. 1979. Storing a sparse table. Communications of the ACM, 22(11):606\u201311.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45526-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T13:14:44Z","timestamp":1587820484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45526-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428121","9783540455264"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45526-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}