Unsupervised Morphological Analysis Using Tries

  • Ak K
  • Yildiz O
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free