is a French learning software program using network. This paper presents its implemented prototype version, Emile 1.1. It is based on the client/server model connected by a dial-up modem. The data structure, the tutoring tools and the user interface of Emile 1.1 are described in this paper. It mentions what should be added and improved in the next versions and further studies. 0...

In this paper we describe an e cient 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 rst e cient 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...

In this paper I present the EMILE 3.0 algorithm 1. It can learn shallow context-free grammars eeciently. It does so under circumstances that, from a perspective of complexity, come resonably close to the conditions under which human beings learn a language. A language is shallow in its descriptive length if all the relevant constructions we need to know to learn it have a complexity that is log...

F. de Belleville ENSICA/TéSA, 1, place Emile Blouin, 31000 Toulouse, FRANCE ENSEEIHT /IRIT, 2, rue Charles Camichel, BP 7122 F 31071 Toulouse, FRANCE L. Dairaine. NICTA, National ICT Australia, Australian Technology Park, Eveleigh NSW 1430, AUSTRALIA ENSICA/TéSA, 1, place Emile Blouin, 31000 Toulouse, France M. Gineste. ENSICA, 1, place Emile Blouin, 31000 Toulouse, France C. Fraboul ENSEEIHT /...