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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Katrenko, S., & Van Zaanen, M. (2010). Rademacher complexity and grammar induction algorithms: What it may (not) tell us. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6339 LNAI, pp. 293–296). https://doi.org/10.1007/978-3-642-15488-1_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
