M. van Zaanen
- Rademacher complexity and grammar induction algorithms: what it may (not) tell us
- Lecture Notes in Computer Science
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
- 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.
- go to publisher's site
- Proceedings title: Grammatical inference: algorithms and applications: 10th international colloquium, ICGI 2010, Valencia,
Spain, September 13-16, 2010: proceedings
Place of publication: Berlin
Editors: J.M. Sempere, P. García
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.