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.

• Type: Journal
• Year: 2010
• Where: ICGI
• Authors: Sophia Katrenko, Menno van Zaanen
• Keywords: Complexity Measure, Computational Grammatical Inference, ICGI 2010, Natural Language Processing, Rademacher Complexity