Skip to main content
SpringerLink
Log in

Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher

  • Conference paper
Formal Grammar (FG 2010, FG 2011)

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

Abstract

We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrate we can efficiently learn the class of Multiple Context-Free Grammars where the non-terminals correspond to the congruence classes under this relation.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Joshi, A.K.: Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D.R., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206–250. Cambridge University Press, Cambridge (1985)

    Google Scholar 

  2. Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Annual Meeting of Association for Computational Linguistics, Stanford, pp. 104–111 (1987)

    Google Scholar 

  3. Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences 10(1), 136–163 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  4. Joshi, A.K.: An introduction to tree adjoining grammars. In: Manaster-Ramer, A. (ed.) Mathematics of Languge. John Benjamins (1987)

    Google Scholar 

  5. Stabler, E.P.: Derivational Minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences 43(2), 328–360 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)

    MathSciNet  MATH  Google Scholar 

  8. Huybrechts, R.A.C.: The weak inadequacy of context-free phrase structure grammars. In: de Haan, G., Trommelen, M., Zonneveld, W. (eds.) Van Periferie naar Kern, Foris, Dordrecht, Holland (1984)

    Google Scholar 

  9. Shieber, S.M.: Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, 333–343 (1985)

    Article  Google Scholar 

  10. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Angluin, D., Kharitonov, M.: When won’t membership queries help? Journal of Computer and System Sciences 50(2), 336–355 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research 5, 473–497 (2004)

    MathSciNet  MATH  Google Scholar 

  13. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kracht, M.: The Mathematics of Language. Studies in Generative Grammar, vol. 63, pp. 408–409. Mouton de Gruyter (2003)

    Google Scholar 

  15. Rambow, O., Satta, G.: Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science 223(1-2), 87–120 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kaji, Y., Nakanishi, R., Seki, H., Kasami, T.: The universal recognition problems for parallel multiple context-free grammars and for their subclasses. IEICE Transaction on Information and Systems E75-D(7), 499–508 (1992)

    Google Scholar 

  17. Clark, A.: Distributional learning of some context-free languages with a minimally adequate teacher. In: Proceedings of the ICGI, Valencia, Spain (September 2010)

    Google Scholar 

  18. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kanazawa, M.: A prefix-correct earley recognizer for multiple context-free grammars. In: Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 49–56 (2008)

    Google Scholar 

  20. Yoshinaka, R.: Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 230–244. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  21. Clark, A., Eyraud, R., Habrard, A.: A Polynomial Algorithm for the Inference of Context Free Languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 29–42. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Clark, A.: A learnable representation for syntax using residuated lattices. In: Proceedings of the 14th Conference on Formal Grammar, Bordeaux, France (2009)

    Google Scholar 

  23. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MathSciNet  MATH  Google Scholar 

  24. Clark, A.: PAC-Learning Unambiguous NTS Languages. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 59–71. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Melamed, I.D.: Multitext grammars and synchronous parsers. In: Proceedings of NAACL/HLT, pp. 79–86 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MINATO Discrete Structure Manipulation System Project, ERATO, Japan Science and Technology Agency, Japan

    Ryo Yoshinaka

  2. Department of Computer Science, Royal Holloway, University of London, UK

    Alexander Clark

Authors
  1. Ryo Yoshinaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Nancy - Grand Est, 615 rue du Jardin Botanique, 54600, Villers-ls-Nancy, France

    Philippe de Groote

  2. School of Computer Science, University of St. Andrews, North Haugh, St. Andrews, KY16 9SX, Fife, Scotland

    Mark-Jan Nederhof

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshinaka, R., Clark, A. (2012). Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32024-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32023-1

  • Online ISBN: 978-3-642-32024-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation