5 search results - page 1 / 1 » Unsupervised Morpheme Discovery with Ungrade |
CLEF
2009
Springer
13 years 12 months ago
2009
Springer
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 appl...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We present two methods for unsupervised segmentation of words into morphemelike units. The model utilized is especially suited for languages with a rich morphology, such as Finnis...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
EACL
2006
ACL Anthology
14 years 8 days ago
2006
ACL Anthology
This paper reports the present results of a research on unsupervised Persian morpheme discovery. In this paper we present a method for discovering the morphemes of Persian languag...
ACL
2008
14 years 10 days ago
2008
For centuries, the deep connection between languages has brought about major discoveries about human communication. In this paper we investigate how this powerful source of inform...