Polysemy: Theoretical and Computational Approaches

Yael Ravin · Claudia Leacock

jun. de 2000 · OUP Oxford

Sobre este e-book

This volume of newly commissioned essays examines current theoretical and computational work on polysemy, the term used in semantic analysis to describe words with more than one meaning or function, sometimes perhaps related (as in plain) and sometimes perhaps not (as in bank). Such words present few difficulties in everyday language, but pose central problems for linguists and lexicographers, especially for those involved in lexical semantics and in computational modelling. The contributors to this book–leading researchers in theoretical and computational linguistics–consider the implications of these problems for grammatical theory and how they may be addressed by computational means. The theoretical essays in the book examine polysemy as an aspect of a broader theory of word meaning. Three theoretical approaches are presented: the Classical (or Aristotelian), the Prototypical, and the Relational. Their authors describe the nature of polysemy, the criteria for detecting it, and its manifestations across languages. They examine the issues arising from the regularity of polysemy and the theoretical principles proposed to account for the interaction of lexical meaning with the semantics and syntax of the context in which it occurs. Finally they consider the formal representations of meaning in the lexicon, and their implications for dictionary construction. The computational essays are concerned with the challenge of polysemy to automatic sense disambiguation–how intended meaning for a word occurrence can be identified. The approaches presented include the exploitation of lexical information in machine-readable dictionaries, machine learning based on patterns of word co-occurrence, and hybrid approaches that combine the two. As a whole, the volume shows how on the one hand theoretical work provides the motivation and may suggest the basis for computational algorithms, while on the other computational results may validate, or reveal problems in, the principles set forth by theories.

Sobre o autor

Yael Ravin is a research staff member at the T. J. Watson Research Center of IBM in New York, where she has been working in computational linguistics. Her current research focuses on integrating information extraction and text retrieval techniques into knowledge management applications. Claudia Leacock recently became a research scientist in the Natural Language Processing group at the Educational Testing Service. Previously she spent six years as a research staff member at Princeton University's Cognitive Science Laboratory.