7 search results - page 1 / 2 » Unsupervised and Knowledge-Free Morpheme Segmentation and An... |
CLEF
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a revised version of an unsupervised and knowledge-free morpheme boundary detection algorithm based on letter successor variety (LSV) and a trie classifier [5...
CORR
2002
Springer
13 years 4 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...
CLEF
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents my participation to the second Morpho Challenge. Results have been obtained with the algorithm already presented at Morpho Challenge 2005. The system takes a p...
CLEF
2008
Springer
13 years 6 months ago
2008
Springer
Many modern natural language processing applications would benefit from automatic morphological analysis of words, especially when dealing with morphologically rich languages. Con...
CLEF
2007
Springer
13 years 11 months ago
2007
Springer
This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given langua...