TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
This is an incremental improvement for computational linguistics, addressing domain-specific WSD.
The authors tackled word sense disambiguation in a specific domain by adapting TreeMatch, a fully unsupervised system using dependency knowledge, and achieved precision above the Most Frequent Selection baseline.
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.