Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
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.
Unable to display preview. Download preview PDF.
- 1.Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3 (2002)Google Scholar
- 3.Clark, A.: Unsupervised Language Acquisition: Theory and Practice. PhD thesis, COGS, University of Sussex (2001)Google Scholar
- 4.van Zaanen, M., Adriaans, P.: Alignment-Based Learning versus EMILE: A Comparison. In: Proceedings of the Belgian-Dutch Conference on Artificial Intelligence (BNAIC), pp. 315–322 (2001)Google Scholar