Reducing lexical semantic complexity with systematic polysemous classes and underspecification

Authors:
Paul Buitelaar
Affiliations:
DFKI Language Technology Lab, Saarbrücken, Germany
Venue:
NLPComplexity '00 NAACL-ANLP 2000 Workshop: Syntactic and Semantic Complexity in Natural Language Processing Systems
Year:
2000

Citing 4
Cited 3

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
Viewing word expert parsing as linguistic theory

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1

Associative and Formal Concepts

ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Sense clusters for information retrieval: evidence from Semcor and the EuroWordNet InterLingual index

WorkSense '00 Proceedings of the ACL-2000 Workshop on Word Senses and Multi-Linguality
Experiments in word domain disambiguation for parallel texts

WorkSense '00 Proceedings of the ACL-2000 Workshop on Word Senses and Multi-Linguality

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.