This article presents an unsupervised morphological analysis algorithm to segment words into roots and affixes. The algorithm relies on word occurrences in a given dataset. Target languages are English, Finnish, and Turkish, but the algorithm can be used to segment any word from any language given the wordlists acquired from a corpus consisting of words and word occurrences. In each iteration, the algorithm divides words with respect to occurrences and constructs a new trie for the remaining affixes. Preliminary experimental results on three languages show that our novel algorithm performs better than most of the previous algorithms.
CITATION STYLE
Ak, K., & Yildiz, O. T. (2011). Unsupervised Morphological Analysis Using Tries. In Computer and Information Sciences II (pp. 69–75). Springer London. https://doi.org/10.1007/978-1-4471-2155-8_8
Mendeley helps you to discover research relevant for your work.