首页> 外文会议>International Conference on Web Information Systems Engineering >Directional Context Helps: Guiding Semantic Relatedness Computation by Asymmetric Word Associations
【24h】

Directional Context Helps: Guiding Semantic Relatedness Computation by Asymmetric Word Associations

机译:方向上下文有助于:通过非对称词关联指导语义相关性计算

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

摘要

Semantic relatedness computation is the task of measuring the degree of relatedness of two concepts. It is a well known problem with applications ranging from computational linguistics to cognitive psychology. In all existing approaches, relatedness is assumed to be symmetric i.e. the relatedness of terms t_i and term t_j is considered the same as the relatedness of terms t_j and t_i. However, there are tasks such as free word association, where the association strength assumed to be asymmetric. In free word association, the given term determines the context in which the association strength must be computed. Based on this key observation, the paper presents a new approach to computing term relatedness guided by asymmetric association. The focus of this paper is on using Wikipedia for extracting directional context of each given term and computing the association of input term pair in this context. The proposed approach is generic enough to deal with both symmetric as well as asymmetric relatedness computation problems. Empirical evaluation on multiple benchmark datasets shows encouraging results when our automatically computed relatedness scores are correlated with human judgments.
机译:语义相关性计算是测量两个概念的相关程度的任务。它是一种众所周知的应用程序,从计算语言学到认知心理学。在所有现有方法中,假设相关性是对称的i.e.术语T_I和术语T_J的相关性被认为与T_J和T_I的相关性相同。然而,有任务如免费单词关联,其中关联强度假定是不对称的。在自由单词关联中,给定术语确定必须计算关联强度的上下文。基于这一关键观察,本文提出了一种新的计算术语相关性的新方法,其不对称关联引导。本文的重点是使用维基百科来提取每个给定术语的方向上下文并计算在此上下文中的输入术语对的关联。所提出的方法是足够的,可以处理对称的对称以及不对称的相关性计算问题。当我们自动计算的相关性分数与人类判断相关时,多个基准数据集的实证评估显示了令人鼓舞的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号