Abstract
In this paper we describe an efficient and scalable implementation for grammar induction based on the EMILE approach [2, 3, 4, 5, 6]. The current EMILE 4.1 implementation [11] is one of the first efficient grammar induction algorithms that work on free text. Although EMILE 4.1 is far from perfect, it enables researchers to do empirical grammar induction research on various types of corpora.
The EMILE approach is based on notions from categorial grammar (cf. [10]), which is known to generate the class of context-free languages. EMILE learns from positive examples only (cf. [1],[7],[9]). We describe the algorithms underlying the approach and some interesting practical results on small and large text collections. As shown in the articles mentioned above, in the limit EMILE learns the correct grammatical structure of a language from sentences of that language. The conducted experiments show that, put into practice, EMILE 4.1 is efficient and scalable. This current implementation learns a subclass of the shallow context-free languages. This subclass seems sufficiently rich to be of practical interest. Especially Emile seems to be a valuable tool in the context of syntactic and semantic analysis of large text corpora.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Abe, Learnability and locality of formal grammars, in Proceedings of the 26th Annual meeting of the Association of computational linguistics, 1988. 173
P. W. Adriaans, Language Learning from a Categorial Perspective, PhD thesis, University of Amsterdam, 1992. 173, 184
P. W. Adriaans, Bias in Inductive Language Learning, in Proceedings of the ML92 Workshop on Biases in Inductive Learning, Aberdeen, 1992. 173
P. W. Adriaans, Learning Shallow Context-Free Languages under Simple Distributions, ILLC Research Report PP-1999-13, Institute for Logic, Language and Computation, Amsterdam, 1999. 173
P. W. Adriaans, S. Janssen, E. Nomden, Effective identification of semantic categories in curriculum texts by means of cluster analysis, in workshop-notes on Machine Learning Techniques for Text Analysis, Vienna, 1993. 173
P. W. Adriaans, A. K. Knobbe, EMILE: Learning Context-free Grammars from Examples, in Proceedings of BENELEARN’96, 1996 173
W. Buszkowski, G. Penn, Categorial Grammars Determined from Linguistic Data by Unification, The University of Chicago, Technical Report 89–05, June 1989. 173
E. Dörnenburg, Extension of the EMILE algorithm for inductive learning of context-free grammars for natural languages, Master’s Thesis, University of Dortmund, 1997. 174
M. Kanazawa, Learnable Classes of Categorial Grammars, PhDthesis, University of Stanford, 1994. 173
R. Oehrle, E. Bach, D. Wheeler (Eds.), Categorial Grammars and Natural Language Structures, D. Reidel Publishing Company, Dordrecht, 1988. 173, 175
M. R. Vervoort, Games, Walks and Grammars: Problems I’ve Worked On, PhD thesis, University of Amsterdam, 2000. 173, 174, 178, 180, 184
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adriaans, P., Trautwein, M., Vervoort, M. (2000). Towards High Speed Grammar Induction on Large Text Corpora. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-44411-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41348-6
Online ISBN: 978-3-540-44411-4
eBook Packages: Springer Book Archive