首页> 外文学位 >A minimally supervised word sense disambiguation algorithm using syntactic dependencies and semantic generalizations.
【24h】

A minimally supervised word sense disambiguation algorithm using syntactic dependencies and semantic generalizations.

机译:一种使用语法依赖性和语义概括的最小监督的词义消歧算法。

获取原文
获取原文并翻译 | 示例

摘要

Natural language is inherently ambiguous. For example, the word "bank" can mean a financial institution or a river shore. Finding the correct meaning of a word in a particular context is a task known as word sense disambiguation (WSD), which is essential for many natural language processing applications such as machine translation, information retrieval, and others.; While most current WSD methods try to disambiguate a small number of words for which enough annotated examples are available, the method proposed in this thesis attempts to address all words in unrestricted text. The method is based on constraints imposed by syntactic dependencies and concept generalizations drawn from an external dictionary. The method was tested on standard benchmarks as used during the SENSEVAL-2 and SENSEVAL-3 WSD international evaluation exercises, and was found to be competitive.
机译:自然语言本质上是模棱两可的。例如,单词“银行”可以表示金融机构或河岸。在特定上下文中找到单词的正确含义是一项称为单词歧义消除(WSD)的任务,它对许多自然语言处理应用(例如机器翻译,信息检索等)至关重要。虽然大多数当前的WSD方法都试图消除少数单词的歧义,但对于这些单词而言,有足够的注释示例可用,但本文提出的方法试图解决非受限文本中的所有单词。该方法基于语法依赖性和从外部词典中得出的概念概括所施加的约束。该方法已在SENSEVAL-2和SENSEVAL-3 WSD国际评估活动中使用的标准基准上进行了测试,被认为具有竞争力。

著录项

  • 作者

    Faruque, Md. Ehsanul.;

  • 作者单位

    University of North Texas.;

  • 授予单位 University of North Texas.;
  • 学科 Computer Science.
  • 学位 M.S.
  • 年度 2005
  • 页码 58 p.
  • 总页数 58
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号