Brown, Dunstan and Evans, Roger (2012) Morphological complexity and unsupervised learning: validating Russian inflectional classes using high frequency data In: Current issues in Morphological Theory: (Ir)regularity, analogy and frequency. Selected papers from the 14th International Morphology Meeting, Budapest, 13–16 May, 2010.Full text not available from this repository.
This paper addresses the question of whether it is possible to use machine learning techniques on linguistic data to validate linguistic theory. We determine how readily inflectional classes recognized by linguists can be inferred by an unsupervised learning method when it is presented with the paradigms of a small number (80) of high frequency Russian noun lexemes. We interpret this as a measure of the validity of the linguistic theory. Inflectional classes are of particular interest, because they constitute a kind of autonomous morphological complexity which has no direct relationship to other levels of linguistic description, and hence there is no other objective way of assessing a theoretical characterisation of them. Using the same method, we also examine the status of principal parts and defaults in inflectional classes, and the relationship between inflectional classes and stress in Russian nominal morphology. Our experiments suggest that this is an effective and interesting technique for shedding additional light on theoretical claims.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Subjects:||G000 Computing and Mathematical Sciences > G700 Artificial Intelligence > G710 Speech & natural language processing|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Natural Language Technology|
|Date Deposited:||29 May 2012 10:36|
|Last Modified:||18 Mar 2015 09:02|
Actions (login required)
Downloads per month over past year