Polysemy: Theoretical and Computational Approaches

┬╖
┬╖ OUP Oxford
рдИ-рдмреБрдХ
242
рдкреЗрдЬ
рдпреЛрдЧреНрдп

рдЗрд╕ рдИ-рдмреБрдХ рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ рдЬрд╛рдирдХрд╛рд░реА

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.

рд▓реЗрдЦрдХ рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ

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.

рдЗрд╕ рдИ-рдмреБрдХ рдХреЛ рд░реЗрдЯрд┐рдВрдЧ рджреЗрдВ

рд╣рдореЗрдВ рдЕрдкрдиреА рд░рд╛рдп рдмрддрд╛рдПрдВ.

рдкрдарди рдЬрд╛рдирдХрд╛рд░реА

рд╕реНрдорд╛рд░реНрдЯрдлрд╝реЛрди рдФрд░ рдЯреИрдмрд▓реЗрдЯ
Android рдФрд░ iPad/iPhone рдХреЗ рд▓рд┐рдП Google Play рдХрд┐рддрд╛рдмреЗрдВ рдРрдкреНрд▓рд┐рдХреЗрд╢рди рдЗрдВрд╕реНрдЯреЙрд▓ рдХрд░реЗрдВ. рдпрд╣ рдЖрдкрдХреЗ рдЦрд╛рддреЗ рдХреЗ рд╕рд╛рде рдЕрдкрдиреЗ рдЖрдк рд╕рд┐рдВрдХ рд╣реЛ рдЬрд╛рддрд╛ рд╣реИ рдФрд░ рдЖрдкрдХреЛ рдХрд╣реАрдВ рднреА рдСрдирд▓рд╛рдЗрди рдпрд╛ рдСрдлрд╝рд▓рд╛рдЗрди рдкрдврд╝рдиреЗ рдХреА рд╕реБрд╡рд┐рдзрд╛ рджреЗрддрд╛ рд╣реИ.
рд▓реИрдкрдЯреЙрдк рдФрд░ рдХрдВрдкреНрдпреВрдЯрд░
рдЖрдк рдЕрдкрдиреЗ рдХрдВрдкреНрдпреВрдЯрд░ рдХреЗ рд╡реЗрдм рдмреНрд░рд╛рдЙрдЬрд╝рд░ рдХрд╛ рдЙрдкрдпреЛрдЧ рдХрд░рдХреЗ Google Play рдкрд░ рдЦрд░реАрджреА рдЧрдИ рдСрдбрд┐рдпреЛ рдХрд┐рддрд╛рдмреЗрдВ рд╕реБрди рд╕рдХрддреЗ рд╣реИрдВ.
eReaders рдФрд░ рдЕрдиреНрдп рдбрд┐рд╡рд╛рдЗрд╕
Kobo рдИ-рд░реАрдбрд░ рдЬреИрд╕реА рдИ-рдЗрдВрдХ рдбрд┐рд╡рд╛рдЗрд╕реЛрдВ рдкрд░ рдХреБрдЫ рдкрдврд╝рдиреЗ рдХреЗ рд▓рд┐рдП, рдЖрдкрдХреЛ рдлрд╝рд╛рдЗрд▓ рдбрд╛рдЙрдирд▓реЛрдб рдХрд░рдХреЗ рдЙрд╕реЗ рдЕрдкрдиреЗ рдбрд┐рд╡рд╛рдЗрд╕ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдирд╛ рд╣реЛрдЧрд╛. рдИ-рд░реАрдбрд░ рдкрд░ рдХрд╛рдо рдХрд░рдиреЗ рд╡рд╛рд▓реА рдлрд╝рд╛рдЗрд▓реЛрдВ рдХреЛ рдИ-рд░реАрдбрд░ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдиреЗ рдХреЗ рд▓рд┐рдП, рд╕рд╣рд╛рдпрддрд╛ рдХреЗрдВрджреНрд░ рдХреЗ рдирд┐рд░реНрджреЗрд╢реЛрдВ рдХрд╛ рдкрд╛рд▓рди рдХрд░реЗрдВ.