Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules
<|reference_start|>Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules: We describe a case study in the application of {\em symbolic machine learning} techniques for the discovery of linguistic rules and categories. A supervised rule induction algorithm is used to learn to predict the correct diminutive suffix given the phonological representation of Dutch nouns. The system produces rules which are comparable to rules proposed by linguists. Furthermore, in the process of learning this morphological task, the phonemes used are grouped into phonologically relevant categories. We discuss the relevance of our method for linguistics and language technology.<|reference_end|>
@article{daelemans1996unsupervised,
    title={Unsupervised Discovery of Phonological Categories through Supervised
  Learning of Morphological Rules},
    author={Walter Daelemans (U. Tilburg, U. Antwerp), Peter Berck (U. Antwerp),
  Steven Gillis (U. Antwerp)},
    journal={Proceedings COLING 1996, Copenhagen},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9607013},
    primaryClass={cmp-lg cs.CL}
}