On unsupervised grammar induction from untagged corpora

In this paper we describe the theoretical motivation and the implementation of an unsupervised morphology induction algorithm. We show that we can induce morphologies with very high precision, using simple unsupervised statistical algorithms. The results are not only relevant from a theoretical point of view, but they also have various potential applications in natural language processing.