Skip to main content
SpringerLink
Log in

Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

  • Conference paper
Algorithmic Learning Theory (ALT 2009)

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

Included in the following conference series:

Abstract

Recently Clark and Eyraud (2007) have shown that substitutable context-free languages, which capture an aspect of natural language phenomena, are efficiently identifiable in the limit from positive data. Generalizing their work, this paper presents a polynomial-time learning algorithm for new subclasses of mildly context-sensitive languages with variants of substitutability.

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.: Inference of reversible languages. Journal of the Association for Computing Machinery 29(3), 741–765 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Becerra-Bonache, L., Case, J., Jain, S., Stephan, F.: Iterative learning of simple external contextual languages. In: Freund, Y., Györfi, L., Turán, G., Zeugmann, T. (eds.) ALT 2008. LNCS (LNAI), vol. 5254, pp. 359–373. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Becerra-Bonache, L., Yokomori, T.: Learning mild context-sensitiveness: Toward understanding children’s language learning. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 53–64. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducer. Machine Learning 66(1), 33–67 (2007)

    Article  Google Scholar 

  5. Clark, A.: PAC-learning unambiguous NTS languages. In: Sakakibara, et al [16], pp. 59–71

    Google Scholar 

  6. Clark, A., Coste, F., Miclet, L. (eds.): ICGI 2008. LNCS (LNAI), vol. 5278. Springer, Heidelberg (2008)

    Google Scholar 

  7. Clark, A., Eyraud, R.: Identification in the limit of substitutable context-free languages. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 283–296. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  9. Clark, A., Eyraud, R., Habrard, A.: A polynomial algorithm for the inference of context free languages. In: Clark, et al [6], pp. 29–42

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)

    Article  MATH  Google Scholar 

  12. Kasprzik, A.: A learning algorithm for multi-dimensional trees, or: Learning beyond context-freeness. In: Clark, et al [6], pp. 111–124

    Google Scholar 

  13. Kudlek, M., Martín-Vide, C., Mateescu, A., Mitrana, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy 26(6), 703–725 (2003)

    Article  Google Scholar 

  14. Oates, T., Armstrong, T., Becerra-Bonache, L., Atamas, M.: Inferring grammars for mildly context sensitive languages in polynomial-time. In: Sakakibara, et al [16], pp. 137–147

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.): ICGI 2006. LNCS (LNAI), vol. 4201. Springer, Heidelberg (2006)

    Google Scholar 

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

  18. Wakatsuki, M., Tomita, E.: A fast algorithm for checking the inclusion for very simple deterministic pushdown automata. IEICE transactions on information and systems E76-D(10), 1224–1233 (1993)

    Google Scholar 

  19. Yoshinaka, R.: Identification in the limit of k, l-substitutable context-free languages. In: Clark, et al [6], pp. 266–279

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Hokkaido University, North-14 West-9, Sapporo, Japan

    Ryo Yoshinaka

Authors
  1. Ryo Yoshinaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya,, LARCA Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Ricard Gavaldà

  2. ICREA and Department of Economics, Pompeu Fabra Universitat, Ramon Trias Fargas 25-27, 08005, Barcelona, Spain

    Gábor Lugosi

  3. Division of Computer Science, Hokkaido University, N-14, W-9, 060-0814, Sapporo, Japan

    Thomas Zeugmann

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Sandra Zilles

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshinaka, R. (2009). Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data. In: Gavaldà, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds) Algorithmic Learning Theory. ALT 2009. Lecture Notes in Computer Science(), vol 5809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04414-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04414-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04413-7

  • Online ISBN: 978-3-642-04414-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation