首页> 外文会议>International Conference on Computational Linguistics >A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations
【24h】

A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations

机译:类似的类比,同义词,反义词和关联方法

获取原文
获取外文期刊封面目录资料

摘要

Recognizing analogies, synonyms, antonyms, and associations appear to be four distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks have been treated independently, using a wide variety of algorithms. These four semantic classes, however, are a tiny sample of the full range of semantic phenomena, and we cannot afford to create ad hoc algorithms for each semantic phenomenon; we need to seek a unified approach. We propose to subsume a broad range of phenomena under analogies. To limit the scope of this paper, we restrict our attention to the subsumption of synonyms, antonyms, and associations. We introduce a supervised corpus-based machine learning algorithm for classifying analogous word pairs, and we show that it can solve multiple-choice SAT analogy questions, TOEFL synonym questions, ESL synonym-antonym questions, and similar-associated-both questions from cognitive psychology.
机译:识别类比,同义词,反义词和关联似乎是四个不同的任务,需要不同的NLP算法。在过去,使用各种算法进行了独立对待的四项任务。然而,这四个语义课程是全系列语义现象的微小样本,我们不能为每个语义现象创建临时算法;我们需要寻求统一的方法。我们建议占据类比下的广泛现象。为了限制本文的范围,我们将注意力限制对同义词,反义词和关联的归档。我们介绍了一种用于对基于语料库的机器学习算法进行分类,用于分类类似词对,我们证明它可以解决多项选择SAT类比问题,托福同义词问题,ESL同义词反义词和类似相关的 - 两个问题来自认知心理学。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号