Skip to main content
Springer Nature Link
Log in

Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us

  • Conference paper
Grammatical Inference: Theoretical Results and Applications (ICGI 2010)

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

Included in the following conference series:

Abstract

This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessment of GI. We provide a motivation for using the Rademacher complexity and give an example showing how this complexity measure can be used in practice.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3 (2002)

    Google Scholar 

  2. Bubeck, S., von Luxburg, U.: Nearest neighbor clustering: A baseline method for consistent clustering with arbitrary objective functions. JMLR 10, 657–698 (2009)

    MathSciNet  Google Scholar 

  3. Clark, A.: Unsupervised Language Acquisition: Theory and Practice. PhD thesis, COGS, University of Sussex (2001)

    Google Scholar 

  4. van Zaanen, M., Adriaans, P.: Alignment-Based Learning versus EMILE: A Comparison. In: Proceedings of the Belgian-Dutch Conference on Artificial Intelligence (BNAIC), pp. 315–322 (2001)

    Google Scholar 

  5. van Zaanen, M., Geertzen, J.: Problems with evaluation of unsupervised empirical grammatical inference systems. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 301–303. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands

    Sophia Katrenko

  2. TiCC, Tilburg University, Tilburg, The Netherlands

    Menno van Zaanen

Authors
  1. Sophia Katrenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Menno van Zaanen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    José M. Sempere  & Pedro García  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katrenko, S., van Zaanen, M. (2010). Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15488-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15487-4

  • Online ISBN: 978-3-642-15488-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics