Abstract
In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be applied to languages whose words have the structure prefixes-stem-suffixes. In the first step, a stem is obtained for each word using a sliding window, such that the description length of the window is minimised. In the next step prefix and suffix sequences are sought using a morpheme graph. The last step consists in combining morphemes found in the previous steps. UNGRADE has been experimentally evaluated on 5 languages (English, German, Finnish, Turkish and Arabic) with encouraging results. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Golénia, B., Spiegler, S., & Flach, P. A. (2010). Unsupervised morpheme discovery with UNGRADE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6241 LNCS, pp. 633–640). https://doi.org/10.1007/978-3-642-15754-7_76
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
