TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
Andrew Tran, Chris Bowes, David Brown, Ping Chen, Max Choly, Wei Ding
2025-01-05Word Sense Disambiguation
Abstract
Word sense disambiguation (WSD) is one of the main challenges in Computational Linguistics. TreeMatch is a WSD system originally developed using data from SemEval 2007 Task 7 (Coarse-grained English All-words Task) that has been adapted for use in SemEval 2010 Task 17 (All-words Word Sense Disambiguation on a Specific Domain). The system is based on a fully unsupervised method using dependency knowledge drawn from a domain specific knowledge base that was built for this task. When evaluated on the task, the system precision performs above the Most Frequent Selection baseline.
Related Papers
Semantic similarity estimation for domain specific data using BERT and other techniques2025-06-23On Self-improving Token Embeddings2025-04-21SANDWiCH: Semantical Analysis of Neighbours for Disambiguating Words in Context ad Hoc2025-03-07GlossGPT: GPT for Word Sense Disambiguation using Few-shot Chain-of-Thought Prompting2025-03-01Probing Semantic Routing in Large Mixture-of-Expert Models2025-02-15Fietje: An open, efficient LLM for Dutch2024-12-19Word Sense Linking: Disambiguating Outside the Sandbox2024-12-12Can LLMs assist with Ambiguity? A Quantitative Evaluation of various Large Language Models on Word Sense Disambiguation2024-11-27