{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:18:41Z","timestamp":1778249921086,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540225706","type":"print"},{"value":"9783540278689","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27868-9_27","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T06:52:23Z","timestamp":1284619943000},"page":"260-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Probabilistic Automata Learning with Additional Knowledge"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Kermorvant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Brill, E.: A simple rule-based part-of-speech tagger. In: Proc. of the Conf. on Applied Natural Language Processing, pp. 152\u2013155 (1992)","DOI":"10.3115\/974499.974526"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"R.C. Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 139\u2013152. Springer, Heidelberg (1994)"},{"key":"27_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0054079","volume-title":"Grammatical Inference","author":"P. Dupont","year":"1998","unstructured":"Dupont, P., Chase, L.: Using symbol clustering to improve probabilistic automaton inference. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 232\u2013243. Springer, Heidelberg (1998)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-58473-0_134","volume-title":"Grammatical Inference and Applications","author":"P. Dupont","year":"1994","unstructured":"Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference? In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 25\u201337. Springer, Heidelberg (1994)"},{"issue":"5","key":"27_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"27_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45790-9_13","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Kermorvant","year":"2002","unstructured":"Kermorvant, C., de la Higuera, C.: Learning languages with help. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 161\u2013173. Springer, Heidelberg (2002)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Kneser, R., Ney, H.: Improved backing-off for N-gram language modeling. In: Proc. Int. Conf. on Acoustics, Speech and Signal Processing, pp. 181\u2013184 (1995)","DOI":"10.1109\/ICASSP.1995.479394"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1142\/S0218001402001666","volume":"16","author":"D. Llorens","year":"2002","unstructured":"Llorens, D., Vilar, J.M., Casacuberta, F.: Finite state language models smoothed using N-grams. Int. J. of Pattern Recognition and Artificial Intelligence\u00a016(3), 275\u2013289 (2002)","journal-title":"Int. J. of Pattern Recognition and Artificial Intelligence"},{"key":"27_CR9","first-page":"99","volume-title":"Adv. in Structural and Syntactic Pattern Recognition","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Identifying regular languages in polynomial time. In: Bunke, H. (ed.) Adv. in Structural and Syntactic Pattern Recognition, pp. 99\u2013108. World Scientific, Singapore (1992)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/225298.225302","volume-title":"Proc. of the Annual Conference on Computational Learning Theory","author":"D. Ron","year":"1995","unstructured":"Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. In: Proc. of the Annual Conference on Computational Learning Theory, pp. 31\u201340. ACM Press, New York (1995)"},{"key":"27_CR11","series-title":"LNAI","first-page":"106","volume-title":"Proc. Int. Coll. on Grammatical Inference","author":"A. Stolcke","year":"1994","unstructured":"Stolcke, A., Omohundro, S.: Inducing probabilistic grammars by bayesian model merging. In: Proc. Int. Coll. on Grammatical Inference. LNCS (LNAI), pp. 106\u2013118. Springer, Heidelberg (1994)"},{"key":"27_CR12","first-page":"975","volume-title":"Proc. Int. Conf. on Machine Learning","author":"F. Thollard","year":"2000","unstructured":"Thollard, F., Dupont, P., de la Higuera, C.: Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In: Proc. Int. Conf. on Machine Learning, pp. 975\u2013982. Morgan Kaufmann, San Francisco (2000)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27868-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:04:44Z","timestamp":1778249084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-27868-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225706","9783540278689"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27868-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}