TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
复制标题
TreeMatch：使用特定领域的依赖知识的完全无监督的 WSD 系统
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
W. Ding
中科院分区：
文献类型：
--
作者：
Andrew Tran;C. Bowes;David Brown;Ping Chen;Max Choly;W. Ding
词义消歧是计算语言学面临的主要挑战之一。TreeMatch是一个WSD系统，最初使用SemEval 2007任务7（粗粒度英语全词任务）中的数据开发，已被改编用于SemEval 2010任务17（特定领域的全词词义消歧）。该系统是基于一个完全无监督的方法，使用依赖知识从特定领域的知识库，这是建立在这项任务。在对任务进行评估时，系统精度高于第一感知基线。
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 First Sense Baseline.