3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
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…