A Novel Word Sense Disambiguation Approach Using WordNet Knowledge Graph
Mohannad AlMousa, Rachid Benlamri, Richard Khoury

TL;DR
This paper introduces SCSMM, a new knowledge-based word sense disambiguation algorithm that effectively combines semantic similarity, heuristic knowledge, and document context, outperforming existing methods on noun disambiguation tasks.
Contribution
The paper presents a novel WSD algorithm, SCSMM, which uniquely captures maximum sentence context while preserving term order, improving disambiguation accuracy over prior approaches.
Findings
Outperformed all algorithms on noun disambiguation datasets
Achieved comparable results to state-of-the-art systems on individual datasets
Analyzed factors affecting algorithm performance such as granularity and sentence size
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
