{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:42:25Z","timestamp":1743014545008,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_12","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:32:14Z","timestamp":1228116734000},"page":"76-85","source":"Crossref","is-referenced-by-count":0,"title":["Position Models and Language Modeling"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Zdziobeck","sequence":"first","affiliation":[]},{"given":"Franck","family":"Thollard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-74958-5_12","volume-title":"Machine Learning: ECML 2007","author":"J. Callut","year":"2007","unstructured":"Callut, J., Dupont, P.: Learning partially observable markov models from first passage times. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS, vol.\u00a04701, pp. 91\u2013103. Springer, Heidelberg (2007)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Second ICGI, pp. 139\u2013152 (1994)","DOI":"10.1007\/3-540-58473-0_144"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Charniak, E.: Immediate-head parsing for language models. In: 10th Conf. of the Association for Computational linguistic, ACL 2001 (2001)","DOI":"10.3115\/1073012.1073029"},{"key":"12_CR4","unstructured":"Chen, S.F.: Building Probabilistic Models for natural Language. PhD thesis, Harvard University Cambridge Massachusetts (May 1996)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-36390-4_6","volume-title":"Implementation and Application of Automata","author":"J. Daciuk","year":"2003","unstructured":"Daciuk, J., van Noord, G.: Finite automata for compact representation of language models in NLP. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 65\u201373. Springer, Heidelberg (2003)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-45257-7_5","volume-title":"Grammatical Inference: Algorithms and Applications","author":"P. Dupont","year":"2000","unstructured":"Dupont, P., Amengual, J.C.: Smoothing probabilistic automata: an error-correcting approach. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS, vol.\u00a01891, pp. 51\u201364. Springer, Heidelberg (2000)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Goodman, J.: A bit of progress in language modeling. Technical report, Microsoft Research (2001)","DOI":"10.1006\/csla.2001.0174"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Hirschman, L.: Multi-site data collection for a spoken language corpus. In: DARPA Speech and Natural Language Workshop, pp. 7\u201314 (1992)","DOI":"10.3115\/1075527.1075531"},{"key":"12_CR9","unstructured":"Kenneth, C., Ted, H., Jianfeng, G.: Compressing trigram language models with Golomb coding. In: Joint EMNLP-CoNLL, pp. 199\u2013207 (2007)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-45790-9_12","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Kermorvant","year":"2002","unstructured":"Kermorvant, C., Dupont, P.: Stochastic grammatical inference with multinomial tests. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS, vol.\u00a02484, pp. 149\u2013160. Springer, Heidelberg (2002)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kneser, R., Ney, H.: Improved backing-off for m-gram language modeling. In: Intl. Conf. on Acoustic, Speech and Signal Processing, pp. 181\u2013184 (1995)","DOI":"10.1109\/ICASSP.1995.479394"},{"issue":"2","key":"12_CR12","first-page":"313","volume":"19","author":"M. Marcus","year":"1993","unstructured":"Marcus, M., Santorini, S., Marcinkiewicz, M.: Building a large annotated corpus of English: the Penn treebank. Computational Linguistics\u00a019(2), 313\u2013330 (1993)","journal-title":"Computational Linguistics"},{"key":"12_CR13","unstructured":"McAllester, D., Shapire, R.: On the convergence rate of the good-turing estimators. In: Conf. on Computational Learning Theory, pp. 1\u201366 (2000)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. In: Proceedings of COLT 1995, pp. 31\u201340 (1995)","DOI":"10.1145\/225298.225302"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/TASL.2007.896666","volume":"15","author":"V. Siivola","year":"2007","unstructured":"Siivola, V., Hirsim\u00e4ki, T., Virpioja, S.: On growing and pruning kneser-ney smoothed n-gram models. IEEE Transactions on Audio, Speech and Language Processing\u00a015(5), 1617\u20131624 (2007)","journal-title":"IEEE Transactions on Audio, Speech and Language Processing"},{"key":"12_CR16","unstructured":"Stolcke, A.: Entropy-based pruning of backoff language models. In: DARPA Broadcast News Transcription and Understanding Workshop, pp. 270\u2013274 (1998)"},{"key":"12_CR17","first-page":"561","volume-title":"ICML 2001","author":"F. Thollard","year":"2001","unstructured":"Thollard, F.: Improving probabilistic grammatical inference core algorithms with post-processing techniques. In: ICML 2001, pp. 561\u2013568. Morgan Kaufmann, San Francisco (2001)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-45790-9_22","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Thollard","year":"2002","unstructured":"Thollard, F., Clark, A.: Shallow parsing using probabilistic grammatical inference. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS, vol.\u00a02484, pp. 269\u2013282. Springer, Heidelberg (2002)"},{"key":"12_CR19","unstructured":"Thollard, F., Dupont, P., de la Higuera, C.: Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In: ICML (2000)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite-state machines \u2013 Part I and II. PAMI\u00a027(7) (2005)","DOI":"10.1109\/TPAMI.2005.148"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:58:31Z","timestamp":1557943111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}