Rademacher complexity and grammar induction algorithms: what it may (not) tell us
S Katrenko, M van Zaanen - … , ICGI 2010, Valencia, Spain, September 13 …, 2010 - Springer
Grammatical Inference: Theoretical Results and Applications: 10th …, 2010•Springer
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.
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.
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.
Springer
Showing the best result for this search. See all results