Skip to main content
Article thumbnail
Location of Repository

A simpler, intuitive approach to morpheme induction

By Samarth Keshava

Abstract

We present a simple, psychologically plausible algorithm to perform unsupervised learning of morphemes. The algorithm is most suited to Indo-European languages with a concatenative morphology, and in particular English. We will describe the two approaches that work together to detect morphemes: 1) finding words that appear as substrings of other words, and 2) detecting changes in transitional probabilities. This algorithm yields particularly good results given its simplicity and conciseness: evaluated on a set of 532 humansegmented

Topics: Precision, 82.84 % Recall, 79.10
Publisher: 2009-01-08
Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1831
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cis.hut.fi/morphoch... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.