2009
DOI: 10.1007/978-3-642-04447-2_130
|View full text |Cite
|
Sign up to set email alerts
|

Using Unsupervised Paradigm Acquisition for Prefixes

Abstract: We describe a simple method of unsupervised morpheme segmentation of words in an unknown language. All what is needed is a raw text corpus (or a list of words) in the given language. The algorithm identifies word parts occurring in many words and interprets them as morpheme candidates (prefixes, stems and suffixes). New treatment of prefixes is the main innovation over Zeman (2007). After filtering out spurious hypotheses, the list of morphemes is applied to segment input words. Official Morpho Challenge 2008 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…The logical choice for minimizing this problem would be to reduce the index by using some kind of pruning (Carmel et al, 2001) or term selection (Zeman, 2009) technique.…”
Section: Background and Related Workmentioning
confidence: 99%
“…The logical choice for minimizing this problem would be to reduce the index by using some kind of pruning (Carmel et al, 2001) or term selection (Zeman, 2009) technique.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Computationally, inflection classes introduce nonuniformity across paradigms and must be handled in one way or another in an automatic morphology learning system. Previous work has opted to explicitly learn inflection classes (Goldsmith and O'Brien 2006) or collapse them in some way (Chan 2006, Hammarström 2009, Monson 2009, Zeman 2009).…”
Section: Inflection Classesmentioning
confidence: 99%
“…Zeman [19], (a revised version of [15]) propose methods to include prefix identification. Words are reversed to detect prefixes, using rules over all possible prefixes simply yields the prefix candidates.…”
Section: Morpho Challenge 2008mentioning
confidence: 99%