Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
<|reference_start|>Unsupervised discovery of morphologically related words based on orthographic and semantic similarity: 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 discover morphologically related pairs by looking for pairs that are both orthographically and semantically similar, where orthographic similarity is measured in terms of minimum edit distance, and semantic similarity is measured in terms of mutual information. The procedure does not rely on a morpheme concatenation model, nor on distributional properties of word substrings (such as affix frequency). Experiments with German and English input give encouraging results, both in terms of precision (proportion of good pairs found at various cutoff points of the ranked list), and in terms of a qualitative analysis of the types of morphological patterns discovered by the algorithm.<|reference_end|>
@article{baroni2002unsupervised,
    title={Unsupervised discovery of morphologically related words based on
  orthographic and semantic similarity},
    author={Marco Baroni, Johannes Matiasek and Harald Trost},
    journal={arXiv preprint arXiv:cs/0205006},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0205006},
    primaryClass={cs.CL}
}