Distributional Learning of Simple Context-Free Tree Grammars

  • Anna Kasprzik
  • Ryo Yoshinaka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6925)


This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.


  1. 1.
    López, D., Sempere, J.M., García, P.: Inference of reversible tree languages. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34(4), 1658–1665 (2004)CrossRefGoogle Scholar
  2. 2.
    Drewes, F., Högberg, J.: Learning a regular tree language from a teacher. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 279–291. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Besombes, J., Marion, J.Y.: Learning tree languages from positive examples and membership queries. Theoretical Computer Science 382, 183–197 (2007)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Oncina, J., Garcia, P.: Inference of recognizable tree sets. Technical report, DSIC II/47/93, Universidad de Valencia (1993)Google Scholar
  5. 5.
    Shirakawa, H., Yokomori, T.: Polynomial-time MAT learning of c-deterministic context-free grammars. Transaction of Information Processing Society of Japan 34, 380–390 (1993)Google Scholar
  6. 6.
    Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)MathSciNetMATHGoogle Scholar
  7. 7.
    Clark, A., Eyraud, R., Habrard, A.: Using contextual representations to efficiently learn context-free languages. Journal of Machine Learning Research 11, 2707–2744 (2010)MathSciNetMATHGoogle Scholar
  8. 8.
    Clark, A.: Distributional learning of some context-free languages with a minimally adequate teacher. In: [24], pp. 24–37Google Scholar
  9. 9.
    Clark, A.: Towards general algorithms for grammatical inference. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2010. LNCS, vol. 6331, pp. 11–30. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Yoshinaka, R.: Efficient learning of multiple context-free languages with multidimensional substitutability from positive data. Theor. Comput. Sci. 412(19), 1821–1831 (2011)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description. In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Processing, Cambridge University Press, Cambridge (1985)Google Scholar
  12. 12.
    Yoshinaka, R., Kanazawa, M.: Distributional learning of abstract categorial grammars. In: Pogodalla, S., Prost, J.-P. (eds.) LACL. LNCS, vol. 6736, pp. 251–266. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2008)Google Scholar
  14. 14.
    Seki, H., Kato, Y.: On the generative power of multiple context-free grammars and macro grammars. IEICE Transactions 91-D(2), 209–221 (2008)CrossRefGoogle Scholar
  15. 15.
    Kanazawa, M., Salvati, S.: The copying power of well-nested multiple context-free grammars. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 344–355. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta. Inf. 27(5), 399–421 (1990)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Clark, A.: Learning context free grammars with the syntactic concept lattice. In: [24], pp. 38–51Google Scholar
  19. 19.
    Yoshinaka, R.: Towards dual approaches for learning context-free grammars based on syntactic concept lattices. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 429–440. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  20. 20.
    Habel, A., Kreowski, H.: Some structural aspects of hypergraph languages generated by hyperedge replacement. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 207–219. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  21. 21.
    Clark, A.: Efficient, correct, unsupervised learning of context-sensitive languages. In: Proceedings of CoNLL. Association for Computational Linguistics, Uppsala (2010)Google Scholar
  22. 22.
    Charniak, E.: Tree-bank grammars. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 1031–1036 (1996)Google Scholar
  23. 23.
    Chen, J., Bangalore, S., Vijay-Shanker, K.: Automated extraction of tree-adjoining grammars from treebanks. Nat. Lang. Eng. 12, 251–299 (2006)CrossRefGoogle Scholar
  24. 24.
    Sempere, J.M., García, P. (eds.): ICGI 2010. LNCS, vol. 6339. Springer, Heidelberg (2010)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Anna Kasprzik
    • 1
  • Ryo Yoshinaka
    • 2
  1. 1.FB IV InformatikUniversity of TrierTrier
  2. 2.ERATO MINATO ProjectJapan Science and Technology AgencyJapan

Personalised recommendations