A Novel Word Sense Disambiguation Approach Using WordNet Knowledge Graph
This work provides an incremental improvement in word sense disambiguation, which could benefit applications in computational linguistics and AI such as information retrieval and machine translation.
This paper introduces Sequential Contextual Similarity Matrix Multiplication (SCSMM), a novel knowledge-based algorithm for word sense disambiguation. SCSMM combines semantic similarity, heuristic knowledge, and document context, outperforming other algorithms for noun disambiguation on combined gold standard datasets and achieving comparable results to state-of-the-art systems on individual datasets.
Various applications in computational linguistics and artificial intelligence rely on high-performing word sense disambiguation techniques to solve challenging tasks such as information retrieval, machine translation, question answering, and document clustering. While text comprehension is intuitive for humans, machines face tremendous challenges in processing and interpreting a human's natural language. This paper presents a novel knowledge-based word sense disambiguation algorithm, namely Sequential Contextual Similarity Matrix Multiplication (SCSMM). The SCSMM algorithm combines semantic similarity, heuristic knowledge, and document context to respectively exploit the merits of local context between consecutive terms, human knowledge about terms, and a document's main topic in disambiguating terms. Unlike other algorithms, the SCSMM algorithm guarantees the capture of the maximum sentence context while maintaining the terms' order within the sentence. The proposed algorithm outperformed all other algorithms when disambiguating nouns on the combined gold standard datasets, while demonstrating comparable results to current state-of-the-art word sense disambiguation systems when dealing with each dataset separately. Furthermore, the paper discusses the impact of granularity level, ambiguity rate, sentence size, and part of speech distribution on the performance of the proposed algorithm.