Semantic interpretation and the resolution of ambiguity
Semantic interpretation and the resolution of ambiguity
Corelex: systematic polysemy and underspecification
Corelex: systematic polysemy and underspecification
Word sense ambiguation: clustering related senses
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Tree-cut and a lexicon based on systematic polysemy
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
WWSM '00 Proceedings of the ACL-2000 workshop on Word senses and multi-linguality - Volume 8
Experiments in word domain disambiguation for parallel texts
WWSM '00 Proceedings of the ACL-2000 workshop on Word senses and multi-linguality - Volume 8
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Hi-index | 0.00 |
This paper presents an algorithm for finding systematic polysemous classes in WordNet and similar semantic databases, based on a definition in (Apresjan 1973). The introduction of systematic polysemous classes can reduce the amount of lexical semantic processing, because the number of disambiguation decisions can be restricted more clearly to those cases that involve real ambiguity (homonymy). In many applications, for instance in document categorization, information retrieval, and information extraction, it may be sufficient to know if a given word belongs to a certain class (underspecified sense) rather than to know which of its (related) senses exactly to pick. The approach for finding systematic polysemous classes is based on that of (Buitelaar 1998a, Buitelaar 1998b), while addressing some previous shortcomings.