{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:46:25Z","timestamp":1749573985609},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410119"},{"type":"electronic","value":"9783540452577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45257-7_18","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T18:05:01Z","timestamp":1278007501000},"page":"221-228","source":"Crossref","is-referenced-by-count":10,"title":["Probabilistic k-Testable Tree Languages"],"prefix":"10.1007","author":[{"given":"Juan Ram\u00f3n","family":"Rico-Juan","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Calera-Rubio","sequence":"additional","affiliation":[]},{"given":"Rafael C.","family":"Carrasco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","first-page":"467","volume":"18","author":"P.F. Brown","year":"1992","unstructured":"Brown, P.F., Della Pietra, V.J., de Souza, P.V., Lai, J.C., Mercer, R.L.: Class-based n-gram models of natural language. Computational Linguistics\u00a018(4), 467\u2013479 (1992)","journal-title":"Computational Linguistics"},{"key":"18_CR2","volume-title":"Statistical Language Learning","author":"E. Charniak","year":"1993","unstructured":"Charniak, E.: Statistical Language Learning. MIT Press, Cambridge (1993)"},{"key":"18_CR3","unstructured":"Charniak, E.: Tree-bank grammars. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Menlo Park, pp. 1031\u20131036. AAAI Press\/MIT Press (1996)"},{"key":"18_CR4","volume-title":"Markov Chains with Stationary Transition Probabilities","author":"K.L. Chung","year":"1967","unstructured":"Chung, K.L.: Markov Chains with Stationary Transition Probabilities, 2nd edn. Springer, Berlin (1967)","edition":"2"},{"key":"18_CR5","unstructured":"Carrasco, R.C., Oncina, J., Calera-Rubio, J.: Stochastic inference of regular tree languages. Machine Learning (2000) (to appear)"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/6490.214099","volume":"33","author":"R. Chaudhuri","year":"1986","unstructured":"Chaudhuri, R., Rao, A.N.V.: Approximating grammar probabilities: Solution of a conjecture. Journal of the ACM\u00a033(4), 702\u2013705 (1986)","journal-title":"Journal of the ACM"},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(98)00172-0","volume":"68","author":"J. Calera-Rubio","year":"1998","unstructured":"Calera-Rubio, J., Carrasco, R.C.: Computing the relative entropy between regular tree languages. Information Processing Letters\u00a068(6), 283\u2013289 (1998)","journal-title":"Information Processing Letters"},{"key":"18_CR8","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York (1991)"},{"key":"18_CR9","unstructured":"Garc\u00eda, P.: Learning k-testable tree sets from positive data. Technical Report DSIC-ii-1993-46, DSIC, Universidad Polit\u00e9cnica de Valencia (1993)"},{"issue":"9","key":"18_CR10","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/34.57687","volume":"12","author":"P. Garc\u00eda","year":"1990","unstructured":"Garc\u00eda, P., Vidal, E.: Inference of k-testable languages in the strict sense and application to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a012(9), 920\u2013925 (1990)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"18_CR11","volume-title":"Statistical Methods for Speech Recognition","author":"F. Jelinek","year":"1998","unstructured":"Jelinek, F.: Statistical Methods for Speech Recognition. The MIT Press, Cambridge (1998)"},{"key":"18_CR12","volume-title":"Advances in Structural and Syntactic Pattern Recognition, Proc. Intl. Workshop on Structural and Syntactic Pattern Recognition","author":"T. Knuutila","year":"1993","unstructured":"Knuutila, T.: Inference of k-testable tree languages. In: Bunke, H. (ed.) Advances in Structural and Syntactic Pattern Recognition, Proc. Intl. Workshop on Structural and Syntactic Pattern Recognition, Bern, Switzerland, World Scientific, Singapore (1993)"},{"issue":"12","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1109\/34.476512","volume":"17","author":"H. Ney","year":"1995","unstructured":"Ney, H., Essen, U., Kneser, R.: On the estimation of small probabilities by leaving-one-out. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a017(12), 1202\u20131212 (1995)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"18_CR14","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/360363.360368","volume":"19","author":"F. Rubin","year":"1976","unstructured":"Rubin, F.: Experiments in text file compression. Communications of the ACM\u00a019(11), 617\u2013623 (1976)","journal-title":"Communications of the ACM"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0890-5401(92)90003-X","volume":"97","author":"Y. Sakakibara","year":"1992","unstructured":"Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Information and Computation\u00a097(1), 23\u201360 (1992)","journal-title":"Information and Computation"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Stolcke, A., Segal, J.: Precise n-gram probabilities from stochastic context-free grammars. Technical Report TR-94-007, International Computer Science Institute, Berkeley, CA (January 1994)","DOI":"10.3115\/981732.981743"},{"issue":"2","key":"18_CR17","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"Stolcke, A.: An efficient context-free parsing algorithm that computes prefix probabilities. Computational Linguistics\u00a021(2), 165\u2013201 (1995)","journal-title":"Computational Linguistics"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/356827.356829","volume":"12","author":"C.S. Wetherell","year":"1980","unstructured":"Wetherell, C.S.: Probabilistic languages: A review and some open questions. ACM Computing Surveys\u00a012(4), 361\u2013379 (1980)","journal-title":"ACM Computing Surveys"},{"key":"18_CR19","first-page":"153","volume":"19","author":"T. Yokomori","year":"1995","unstructured":"Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning\u00a019, 153\u2013179 (1995)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45257-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:13:25Z","timestamp":1559222005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45257-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410119","9783540452577"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45257-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}