Paper: Learning Probabilistic Subcategorization Preference By Identifying Case Dependencies And Optimal Noun Class Generalization Level

ACL ID A97-1053
Title Learning Probabilistic Subcategorization Preference By Identifying Case Dependencies And Optimal Noun Class Generalization Level
Venue Applied Natural Language Processing Conference
Session Main Conference
Year 1997
Authors

This paper proposes a novel method of learning probabilistic subcategorization preference. In the method, for the purpose of coping with the ambi- guities of case dependencies and noun class gen- eralization of argument/adjunct nouns, we intro- duce a data structure which represents a tuple of independent partial subcategorization frames. Each collocation of a verb and argument/adjunct nouns is assumed to be generated from one of the possible tuples of independent partial subcatego- rization frames. Parameters of subcategorization preference are then estimated so as to maximize the subcategorization preference function for each collocation of a verb and argument/adjunct nouns in the training corpus. We also describe the results of the experiments on learning probabilistic sub- categorizati...