3 citations
1 paper
Marco Baroni, Johannes Matiasek, Harald Trost
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 dis…