TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
Tran, Andrew, Bowes, Chris, Brown, David, Chen, Ping, Choly, Max, Ding, Wei
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Jan-5-2025
- Country:
- North America
- Canada (0.28)
- United States > Massachusetts (0.29)
- North America
- Genre:
- Research Report (0.64)
- Technology: