Skip to main content
SpringerLink
Log in

Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages

  • Conference paper
  • First Online:
Book cover Implementation and Application of Automata (CIAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9705))

Included in the following conference series:

  • 480 Accesses

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Sometimes called simple context-free tree grammars in the literature.

  2. 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

  1. Corazza, A., Satta, G.: Probabilistic context-free grammars estimated from infinite distributions. IEEE Trans. Pattern anal. Mach. Intell. 29(8), 1379–1393 (2007)

    Article  Google Scholar 

  2. Fischer, M.: Grammars with macro-like productions. Ph.D. thesis. Harvard University, Massachusetts (1968)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Gécseg, F., Steinby, M.: Tree automata. In: Kiadó, A. (ed.). Reissued 2015. Akadémiai Kiadó, Budapest (1984). arXiv:1509.06233 [cs.FL]

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Nederhof, M.-J.: A general technique to train language models on language models. Comput. Linguist. 31(2), 173–186 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theor. 4(3), 257–287 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shieber, S.: Evidence against the context-freeness of natural language. Linguist. Philos. 8, 333–343 (1985)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Dresden, 01062, Dresden, Germany

    Markus Teichmann

Authors
  1. Markus Teichmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Markus Teichmann .

Editor information

Editors and Affiliations

  1. Yonsei University, Seoul, Korea (Republic of)

    Yo-Sub Han

  2. Queen's University , Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation