CORR
2002
Springer
13 years 11 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...