English

TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain

Computation and Language 2025-01-07 v1 Artificial Intelligence

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.

Keywords

Cite

@article{arxiv.2501.02546,
  title  = {TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain},
  author = {Andrew Tran and Chris Bowes and David Brown and Ping Chen and Max Choly and Wei Ding},
  journal= {arXiv preprint arXiv:2501.02546},
  year   = {2025}
}
R2 v1 2026-06-28T20:56:46.351Z