Limitations of current grammar induction algorithms

17Citations
Citations of this article
97Readers
Mendeley users who have this article in their library.
Get full text

Abstract

I review a number of grammar induction algorithms (ABL, Emile, Adios), and test them on the Eindhoven corpus, resulting in disappointing results, compared to the usually tested corpora (ATIS, OVIS). Also, I show that using neither POS-tags induced from Biemann’s unsupervised POS-tagging algorithm nor hand-corrected POS-tags as input improves this situation. Last, I argue for the development of entirely incremental grammar induction algorithms instead of the approaches of the systems discussed before.

Cite

CITATION STYLE

APA

Cramer, B. (2007). Limitations of current grammar induction algorithms. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2007-June, pp. 43–48). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1557835.1557845

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free