mlsanityData to 14 Oct 2026

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

arXiv 2501.02546 ↗First posted 5 Jan 2025cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 20 references that are in the map. First posted on arXiv 5 Jan 2025.

Builds on

0 of 20 references.

No references here yet.

Built on by

Not cited yet.