Week3-2Thesaurus-based Word Similarity Methods

Remember word net

Given 2 words, we could calculate the number of the links between these 2 words in the word net forest(tree). The great the distance, the smaller the similarity.

Path similarity

  • Version 1
    • Sim(v, w) = -pathlength(v, w)
  • Version 2
    • Sim(v, w) = -log( pathlength(v, w) )

Problems of the approach

  • There may be no tree for the specific domain or language
  • A specific word(a term) may be not in any tree
  • IS-A(hypernym) edges are not equally apart in similarity space

Advanced version

  • Version 3
    Sim(v,w)=logP(LCS(v,w))
    LCS = lowest common subsumer
    e.g. ungulate for deer and horse
    deer for deer and elk

  • Version 4
    这里写图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值