• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于词义消歧的和声搜索算法。

Harmony Search Algorithm for Word Sense Disambiguation.

作者信息

Abed Saad Adnan, Tiun Sabrina, Omar Nazlia

机构信息

Knowledge Technology Research Group (KT), Centre for Artificial Intelligent (CAIT), Universiti Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia.

出版信息

PLoS One. 2015 Sep 30;10(9):e0136614. doi: 10.1371/journal.pone.0136614. eCollection 2015.

DOI:10.1371/journal.pone.0136614
PMID:26422368
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC4589330/
Abstract

Word Sense Disambiguation (WSD) is the task of determining which sense of an ambiguous word (word with multiple meanings) is chosen in a particular use of that word, by considering its context. A sentence is considered ambiguous if it contains ambiguous word(s). Practically, any sentence that has been classified as ambiguous usually has multiple interpretations, but just one of them presents the correct interpretation. We propose an unsupervised method that exploits knowledge based approaches for word sense disambiguation using Harmony Search Algorithm (HSA) based on a Stanford dependencies generator (HSDG). The role of the dependency generator is to parse sentences to obtain their dependency relations. Whereas, the goal of using the HSA is to maximize the overall semantic similarity of the set of parsed words. HSA invokes a combination of semantic similarity and relatedness measurements, i.e., Jiang and Conrath (jcn) and an adapted Lesk algorithm, to perform the HSA fitness function. Our proposed method was experimented on benchmark datasets, which yielded results comparable to the state-of-the-art WSD methods. In order to evaluate the effectiveness of the dependency generator, we perform the same methodology without the parser, but with a window of words. The empirical results demonstrate that the proposed method is able to produce effective solutions for most instances of the datasets used.

摘要

词义消歧(WSD)是一项通过考虑上下文来确定在某个特定用法中歧义单词(具有多种含义的单词)所选用的具体词义的任务。如果一个句子包含歧义单词,那么这个句子就被认为是有歧义的。实际上,任何被归类为有歧义的句子通常都有多种解释,但其中只有一种是正确的解释。我们提出了一种无监督方法,该方法利用基于知识的方法,通过基于斯坦福依存关系生成器(HSDG)的和声搜索算法(HSA)来进行词义消歧。依存关系生成器的作用是解析句子以获取它们的依存关系。而使用HSA的目标是最大化已解析单词集的整体语义相似度。HSA调用语义相似度和相关性度量的组合,即姜氏和康拉特(jcn)以及一种改进的莱斯科算法,来执行HSA适应度函数。我们提出的方法在基准数据集上进行了实验,其结果与当前最先进的WSD方法相当。为了评估依存关系生成器的有效性,我们在不使用解析器但使用单词窗口的情况下执行相同的方法。实证结果表明,所提出的方法能够为所用数据集的大多数实例生成有效的解决方案。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/5b6bfe1da87c/pone.0136614.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/29e624a08148/pone.0136614.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/a0d7cdd4fdad/pone.0136614.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/e1619596976f/pone.0136614.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/0c04699d8793/pone.0136614.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/2dce3a383e9b/pone.0136614.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/5b6bfe1da87c/pone.0136614.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/29e624a08148/pone.0136614.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/a0d7cdd4fdad/pone.0136614.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/e1619596976f/pone.0136614.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/0c04699d8793/pone.0136614.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/2dce3a383e9b/pone.0136614.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b20d/4589330/5b6bfe1da87c/pone.0136614.g006.jpg

相似文献

1
Harmony Search Algorithm for Word Sense Disambiguation.用于词义消歧的和声搜索算法。
PLoS One. 2015 Sep 30;10(9):e0136614. doi: 10.1371/journal.pone.0136614. eCollection 2015.
2
An experimental study of graph connectivity for unsupervised word sense disambiguation.无监督词义消歧的图连接性实验研究。
IEEE Trans Pattern Anal Mach Intell. 2010 Apr;32(4):678-92. doi: 10.1109/TPAMI.2009.36.
3
Determining the difficulty of Word Sense Disambiguation.确定词义消歧的难度。
J Biomed Inform. 2014 Feb;47:83-90. doi: 10.1016/j.jbi.2013.09.009. Epub 2013 Sep 26.
4
Collocation analysis for UMLS knowledge-based word sense disambiguation.基于 UMLS 的词汇搭配分析在词义消歧中的应用。
BMC Bioinformatics. 2011 Jun 9;12 Suppl 3(Suppl 3):S4. doi: 10.1186/1471-2105-12-S3-S4.
5
Word sense disambiguation using hybrid swarm intelligence approach.基于混合群智能的词义消歧。
PLoS One. 2018 Dec 20;13(12):e0208695. doi: 10.1371/journal.pone.0208695. eCollection 2018.
6
Word embeddings and recurrent neural networks based on Long-Short Term Memory nodes in supervised biomedical word sense disambiguation.基于长短期记忆节点的词嵌入和循环神经网络在有监督生物医学词义消歧中的应用
J Biomed Inform. 2017 Sep;73:137-147. doi: 10.1016/j.jbi.2017.08.001. Epub 2017 Aug 7.
7
Machine learning and word sense disambiguation in the biomedical domain: design and evaluation issues.生物医学领域中的机器学习与词义消歧:设计与评估问题
BMC Bioinformatics. 2006 Jul 5;7:334. doi: 10.1186/1471-2105-7-334.
8
Graph-based word sense disambiguation of biomedical documents.基于图的生物医学文献词义消歧。
Bioinformatics. 2010 Nov 15;26(22):2889-96. doi: 10.1093/bioinformatics/btq555. Epub 2010 Oct 7.
9
Structural semantic interconnections: a knowledge-based approach to word sense disambiguation.结构语义互连:一种基于知识的词义消歧方法。
IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1075-86. doi: 10.1109/TPAMI.2005.149.
10
A novel approach to word sense disambiguation based on topical and semantic association.一种基于主题和语义关联的词义消歧新方法。
ScientificWorldJournal. 2013 Oct 31;2013:586327. doi: 10.1155/2013/586327. eCollection 2013.

引用本文的文献

1
Word sense disambiguation using hybrid swarm intelligence approach.基于混合群智能的词义消歧。
PLoS One. 2018 Dec 20;13(12):e0208695. doi: 10.1371/journal.pone.0208695. eCollection 2018.
2
Differentiating Sense through Semantic Interaction Data.通过语义交互数据区分意义。
AMIA Annu Symp Proc. 2017 Feb 10;2016:1238-1247. eCollection 2016.