Skip to main content
SpringerLink
Log in

Constructive Learning of Context-Free Languages with a Subpansive Tree 

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1891))

Included in the following conference series:

Abstract

A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and investigate query learning of CFGs with the help of subpansive trees. We show a restricted class of CFGs, which we call hierarchical CFGs, is efficiently learnable, while it is unlikely to be polynomial-time predictable.

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. Angluin, D.: Learning k-bounded context-free grammars, Technical Report YALEU/DCS/RR-557, Yale University (1987)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Angluin, D.: Query and concept learning. Machine Learning 2, 319–342 (1988)

    Google Scholar 

  4. Bloomfield, L.: Language. Holt, Rinehart & Winston (1933)

    Google Scholar 

  5. Berman, P., Roods, R.: Learning one-counter languages in polynomial time. In: Proc. 28th IEEE Symposium on Foundation of Computer Science, pp. 61–67 (1987)

    Google Scholar 

  6. Crain, S., Lillo-Martin, D.: Introduction to linguistic theory and natural language acquisition. Blackwell, Malden (1999)

    Google Scholar 

  7. Chomsky, N.: Syntactic structures. Mouton, Netherlands (1957)

    Google Scholar 

  8. Chomsky, N.: Formal properties of grammars, Handbook of mathematical psychology. In: Luce, R.D., Bush, R.R., Galanter, E. (eds.), pp. 323–418. J. Wiley & Sons, Chichester (1963)

    Google Scholar 

  9. Chomsky, N.: Aspects of the theory of syntax. MIT Press, Cambridge (1965)

    Google Scholar 

  10. Chomsky, N.: Remarks on nominalization, Readings in English transformational grammar. In: Jacobs, R.A., Rosenbaum, P.S. (eds.), pp. 184–221. Ginn & Co (1970)

    Google Scholar 

  11. Chomsky, N.: Lectures on government and binding. Foris Publications (1981)

    Google Scholar 

  12. Domingo, C., Lavín, V.: The query complexity of learning some subclasses of context-free grammars. In: Proc. 2nd European Conference on Machine Learning, pp. 404–414 (1995)

    Google Scholar 

  13. Fukui, N.: Theory of projection in syntax. CSLI Publications, Stanford (1995)

    Google Scholar 

  14. Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  15. Higuera, C.D.L.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)

    Article  MATH  Google Scholar 

  16. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley Publishing, Reading (1979)

    MATH  Google Scholar 

  17. Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning 5, 151–164 (1990)

    Google Scholar 

  18. Jackendoff, R.: XÌ„ syntax: A study of phrase structure. MIT Press, Cambridge (1977)

    Google Scholar 

  19. Ling, X.: Learning and invention of Horn clause theories - a constructive method. Methodologies for Intelligent Systems 4, 323–331 (1989)

    Google Scholar 

  20. Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning 2, 285–318 (1988)

    Google Scholar 

  21. Lloyd, J.W.: Foundations of logic programming, 2nd extended edn. Springer, Heidelberg (1987)

    Google Scholar 

  22. Mäkinen, E.: On the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters 42, 1–5 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  23. Pinker, S.: Language learnability and language development. Harvard University Press, Boston (1984)

    Google Scholar 

  24. Pitt, L., Warmuth, M.K.: Prediction preserving reduction. Journal of Computer System and Science 41, 430–467 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  25. Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76, 223–242 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  26. Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Information and Computation 97, 23–60 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  27. Sakamoto, H.: Language learning from membership queries and characteristic examples. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS (LNAI), vol. 997, pp. 55–65. Springer, Heidelberg (1995)

    Google Scholar 

  28. Sugimoto, N., Hirata, K., Ishizaka, H.: Constructive learning of translations based on dictionaries. In: Arikawa, S., Sharma, A.K. (eds.) ALT 1996. LNCS (LNAI), vol. 1160, pp. 177–184. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Noriko Sugimoto, Shinichi Shimozono & Kouichi Hirata

  2. Department of Human Sciences, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Takashi Toyoshima

Authors
  1. Noriko Sugimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Toyoshima
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shinichi Shimozono
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INESC-ID/IST, R. Alves Redol 9, 1000, Lisboa, Portugal

    Arlindo L. Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sugimoto, N., Toyoshima, T., Shimozono, S., Hirata, K. (2000). Constructive Learning of Context-Free Languages with a Subpansive Tree . In: Oliveira, A.L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2000. Lecture Notes in Computer Science(), vol 1891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45257-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45257-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41011-9

  • Online ISBN: 978-3-540-45257-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation