Two-step Approach to Unsupervised Morpheme Segmentation
published: Feb. 25, 2007, recorded: April 2006, views: 3769
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This paper describes two steps of a morpheme boundary segmentation algorithm. The task is solely to find boundaries between morphemes bar and any further analysis such as phoneme deletions, insertions or alternations that may occur between or within morphemes. The algorithm presented here was designed under the premise that it is not supposed to utilize any knowledge about the language it should analyse. Neither is it supposed to rely on any kind of human supervision. The first step is to use a high-precision, low-recall algorithm to find a relatively small number of mostly correct segmentations, see (Bordag, 2005). In the second step, these segmentations are used to train a classification, which is then applied to all words to find morpheme boundaries within them.
Download slides: pcw06_bordag_tsaum.ppt (460.5 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: