无需标注数据，利用领域依赖知识实现精准词义消歧。
TreeMatch: A Fully Unsupervised WSD System Using Dependency Knowledge on a Specific Domain
- 基于领域知识库的依存关系进行无监督词义消歧
- 在特定领域任务中精度超过最常见词选择基线
- 适合资源匮乏场景下的自动语义理解
词义消歧（WSD）是计算语言学中的核心挑战之一。TreeMatch 是一种最初基于 SemEval 2007 Task 7（粗粒度英语全词任务）数据开发的 WSD 系统，现已适配用于 SemEval 2010 Task 17（特定领域全词词义消歧）。该系统采用完全无监督方法，利用为该任务构建的领域专用知识库中的依存知识。在任务评估中，其精度表现优于最常见词选择基线。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。