{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:11:18Z","timestamp":1773148278852,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243182","type":"print"},{"value":"9783540305002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_3","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"23-34","source":"Crossref","is-referenced-by-count":8,"title":["A General Weighted Grammar Library"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Allauzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Roark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"3_CR1","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 ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48194-X_5","volume-title":"Combinatorial Pattern Matching","author":"C. Allauzen","year":"2001","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Efficient experimental string matching by weak factor recognition. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 51\u201372. Springer, Heidelberg (2001)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Allauzen, C., Mohri, M., Roark, B.: Generalized algorithms for constructing language models. In: Proceedings of ACL 2003, pp. 40\u201347 (2003)","DOI":"10.3115\/1075096.1075102"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jagm.2000.1087","volume":"36","author":"C. Allauzen","year":"2000","unstructured":"Allauzen, C., Raffinot, M.: Simple optimal string matching. Journal of Algorithms\u00a036(1), 102\u2013116 (2000)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science\u00a040(1), 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnel, R.M., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"Journal of the ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cortes, C., Mohri, M.: Distribution Kernels Based on Moments of Counts. In: Proceedings of the Twenty-First International Conference on Machine Learning (ICML 2004), Banff, Alberta, Canada (July 2004)","DOI":"10.1145\/1015330.1015434"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"Crochemore, M.: Transducers and repetitions. Theoretical Computer Science\u00a045(1), 63\u201386 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"4\/5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string-matching algorithms. Algorithmica\u00a012(4\/5), 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge (1998)"},{"issue":"3","key":"3_CR11","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 recogniser. IEEE Transactions on Acoustic, Speech, and Signal Processing\u00a035(3), 400\u2013401 (1987)","journal-title":"IEEE Transactions on Acoustic, Speech, and Signal Processing"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kneser, R., Ney, H.: Improved backing-off for m-gram language modeling. In: Proceedings of ICASSP, vol.\u00a01, pp. 181\u2013184 (1995)","DOI":"10.1109\/ICASSP.1995.479394"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR14","volume-title":"Proceedings of the International Conference on Computational Lexicography (COMPLEX 1994)","author":"M. Mohri","year":"1994","unstructured":"Mohri, M.: Syntactic analysis by local grammars automata: an efficient algorithm. In: Proceedings of the International Conference on Computational Lexicography (COMPLEX 1994), Linguistic Institute, Hungarian Academy of Science (1994)"},{"issue":"2","key":"3_CR15","first-page":"217","volume":"2","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: String-matching with automata. Nordic Journal of Computing\u00a02(2), 217\u2013231 (1997)","journal-title":"Nordic Journal of Computing"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-94-015-9719-7_7","volume-title":"Robustness in Language and Speech Technology","author":"M. Mohri","year":"2001","unstructured":"Mohri, M.: Weighted Grammar Tools: the GRM Library. In: Robustness in Language and Speech Technology, pp. 165\u2013186. Kluwer, Dordrecht (2001)"},{"key":"3_CR17","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: Robustness in Language and Speech Technology, pp. 153\u2013163. Kluwer, Dordrecht (2001)"},{"key":"3_CR18","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), http:\/\/www.research.att.com\/sw\/tools\/fsm","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M. Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Weighted Finite-State Transducers in Speech Recognition. Computer Speech and Language\u00a016(1), 69\u201388 (2002)","journal-title":"Computer Speech and Language"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/csla.1994.1001","volume":"8","author":"H. Ney","year":"1994","unstructured":"Ney, H., Essen, U., Kneser, R.: On structuring probabilistic dependences in stochastic language modeling. Computer Speech and Language\u00a08(1), 1\u201338 (1994)","journal-title":"Computer Speech and Language"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Seymore, K., Rosenfeld, R.: Scalable backoff language models. In: Proceedings of ICSLP, Philadelphia, Pennsylvania, vol.\u00a01, pp. 232\u2013235 (1996)","DOI":"10.1109\/ICSLP.1996.607084"},{"key":"3_CR22","unstructured":"Stolcke, A.: Entropy-based pruning of backoff language models. In: Proc. DARPA Broadcast News Transcription and Understanding Workshop, pp. 270\u2013274 (1998)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Stolcke, A.: SRILM \u2013 an extensible language modeling toolkit. In: Proc. Intl. Conf. on Spoken Language Processing (ICSLP 2002), vol.\u00a02, pp. 901\u2013904 (2002)","DOI":"10.21437\/ICSLP.2002-303"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0019-9958(67)90401-9","volume":"11","author":"J. Ullian","year":"1967","unstructured":"Ullian, J.: Partial algorithm problems for context free languages. Information and Control\u00a011, 80\u2013101 (1967)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:40:07Z","timestamp":1685468407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}