Abstract
We show how to train a weighted regular tree grammar such that it best approximates a weighted linear nondeleting context-free tree grammar concerning the Kullback-Leibler divergence between both grammars.
M. Teichmann—Financially supported by DFG Graduiertenkolleg 1763 (QuantLA).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Sometimes called simple context-free tree grammars in the literature.
- 2.
In the existing literature about RTG, producing is called normal form. In the literature about CFTG, the nonterminal form is also called normal form. Thus, the term normal form is avoided in this paper.
References
Corazza, A., Satta, G.: Probabilistic context-free grammars estimated from infinite distributions. IEEE Trans. Pattern anal. Mach. Intell. 29(8), 1379–1393 (2007)
Fischer, M.: Grammars with macro-like productions. Ph.D. thesis. Harvard University, Massachusetts (1968)
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)
Gécseg, F., Steinby, M.: Tree automata. In: Kiadó, A. (ed.). Reissued 2015. Akadémiai Kiadó, Budapest (1984). arXiv:1509.06233 [cs.FL]
Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69–123. Springer, Heidelberg (1997)
Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. J. Logic Lang. Inf. 20(3), 361–384 (2011)
Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)
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–241. Springer, Netherlands (2000)
Nederhof, M.-J.: A general technique to train language models on language models. Comput. Linguist. 31(2), 173–186 (2005)
Nederhof, M.-J.: Weighted parsing of trees. In: Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009, pp. 13–24. Association for Computational Linguistics (2009)
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–63 (2012)
Osterholzer, J.: Pushdown machines for weighted context-free tree translation. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 290–303. Springer, Heidelberg (2014)
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–116. ACM, New York (1970)
Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theor. 4(3), 257–287 (1970)
Shieber, S.: Evidence against the context-freeness of natural language. Linguist. Philos. 8, 333–343 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Teichmann, M. (2016). Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages. In: Han, YS., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2016. Lecture Notes in Computer Science(), vol 9705. Springer, Cham. https://doi.org/10.1007/978-3-319-40946-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-40946-7_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40945-0
Online ISBN: 978-3-319-40946-7
eBook Packages: Computer ScienceComputer Science (R0)