Sciweavers

Share
ICGI
2010
Springer

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

12 years 4 days ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
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.
Sophia Katrenko, Menno van Zaanen
Added 26 Jan 2011
Updated 26 Jan 2011
Type Journal
Year 2010
Where ICGI
Authors Sophia Katrenko, Menno van Zaanen
Comments (0)
books