Home // eKNOW 2013, The Fifth International Conference on Information, Process, and Knowledge Management // View article

Approaching Regular Polysemy in WordNet

Authors:
Abed Alhakim Freihat
Fausto Giunchiglia
Biswanath Dutta

Keywords: Lexical databases; WordNet; Homonomy; Polysemy; regular Polysemy; Polysemy Reduction; Lexical semantics; Semantic Search; Knowledge Engineering

Abstract:
WordNet has been used widely in natural language processing and semantic applications. Despite the reputation of WordNet, the polysemy problem that leads to insufficient quality of applications results is still unsolved. Many approaches have been suggested. However, none of them give a comprehensive solution to the problem. In this paper, we introduce a pattern based approach that solves the polysemy problem in the case of nouns. To achieve this result we introduce a set of novel relations that represent polysemy types and a set of new operations that allow us to organize the specialization polysemy cases.

Pages: 63 to 69

Copyright: Copyright (c) IARIA, 2013

Publication date: February 24, 2013

Published in: conference

ISSN: 2308-4375

ISBN: 978-1-61208-254-7

Location: Nice, France

Dates: from February 24, 2013 to March 1, 2013