Computer Science – Computation and Language
Scientific paper
1996-07-11
Proceedings COLING 1996, Copenhagen
Computer Science
Computation and Language
Scientific paper
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.
Berck Peter
Daelemans Walter
Gillis Steven
No associations
LandOfFree
Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-65154