{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:08Z","timestamp":1725860768706},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_23","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:52:20Z","timestamp":1467719540000},"page":"273-284","source":"Crossref","is-referenced-by-count":0,"title":["Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages"],"prefix":"10.1007","author":[{"given":"Markus","family":"Teichmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"8","key":"23_CR1","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/TPAMI.2007.1065","volume":"29","author":"A Corazza","year":"2007","unstructured":"Corazza, A., Satta, G.: Probabilistic context-free grammars estimated from infinite distributions. IEEE Trans. Pattern anal. Mach. Intell. 29(8), 1379\u20131393 (2007)","journal-title":"IEEE Trans. Pattern anal. Mach. Intell."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Fischer, M.: Grammars with macro-like productions. Ph.D. thesis. Harvard University, Massachusetts (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"23_CR3","unstructured":"Gebhardt, K., Osterholzer, J.: A direct link between tree-adjoining and context-free tree grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (2015)"},{"key":"23_CR4","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree automata. In: Kiad\u00f3, A. (ed.). Reissued 2015. Akad\u00e9miai Kiad\u00f3, Budapest (1984). arXiv:1509.06233 [cs.FL]"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A Joshi","year":"1997","unstructured":"Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69\u2013123. Springer, Heidelberg (1997)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10849-011-9134-0","volume":"20","author":"S Kepser","year":"2011","unstructured":"Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. J. Logic Lang. Inf. 20(3), 361\u2013384 (2011)","journal-title":"J. Logic Lang. Inf."},{"issue":"1","key":"23_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"23_CR8","series-title":"Text, Speech and Language Technology","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-94-015-9470-7_12","volume-title":"Advances in Probabilistic and Other Parsing Technologies","author":"M-J Nederhof","year":"2000","unstructured":"Nederhof, M.-J.: Regular approximation of CFLs: a grammatical view. In: Bunt, H., Nijholt, A. (eds.) Advances in Probabilistic and Other Parsing Technologies. Text, Speech and Language Technology, vol. 16, pp. 221\u2013241. Springer, Netherlands (2000)"},{"issue":"2","key":"23_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/0891201054223986","volume":"31","author":"M-J Nederhof","year":"2005","unstructured":"Nederhof, M.-J.: A general technique to train language models on language models. Comput. Linguist. 31(2), 173\u2013186 (2005)","journal-title":"Comput. Linguist."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Nederhof, M.-J.: Weighted parsing of trees. In: Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009, pp. 13\u201324. Association for Computational Linguistics (2009)","DOI":"10.3115\/1697236.1697239"},{"key":"23_CR11","unstructured":"Nederhof, M.-J., Vogler, H.: Synchronous context-free tree grammars. In: Proceedings of the 11th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+11), pp. 55\u201363 (2012)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-319-08846-4_22","volume-title":"Implementation and Application of Automata","author":"J Osterholzer","year":"2014","unstructured":"Osterholzer, J.: Pushdown machines for weighted context-free tree translation. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 290\u2013303. Springer, Heidelberg (2014)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Rounds, W.C.: Tree-oriented proofs of some theorems on context-free and indexed languages. In: Proceedings of Second Annual ACM Symposium on Theory of Computing, STOC 1970, pp. 109\u2013116. ACM, New York (1970)","DOI":"10.1145\/800161.805156"},{"issue":"3","key":"23_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"WC Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theor. 4(3), 257\u2013287 (1970)","journal-title":"Math. Syst. Theor."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S Shieber","year":"1985","unstructured":"Shieber, S.: Evidence against the context-freeness of natural language. Linguist. Philos. 8, 333\u2013343 (1985)","journal-title":"Linguist. Philos."}],"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-319-40946-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T18:29:53Z","timestamp":1568140193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}