An Unsupervised Approach for Constructing Word Similarity Network

Yu Hu, Tiezheng Nie, Derong Shen, Yue Kou
{"title":"An Unsupervised Approach for Constructing Word Similarity Network","authors":"Yu Hu, Tiezheng Nie, Derong Shen, Yue Kou","doi":"10.1109/WISA.2015.38","DOIUrl":null,"url":null,"abstract":"To evaluate how much a pair of entities or documents are similar is a common problem for current applications. Most approaches for this problem are based on the co-occurrence. However, different terms or words may represent the same entity or similar semantic in the real world since a concept often has more than one way of expression. Existing works always focus on computing semantic relatedness of words. But relatedness cannot reflect the similarity most of the time, on the other hand, most of their corpus are from common data sources such as Wikipedia and are not useful for the specialized vocabulary. In this paper, we propose a novel unsupervised approach for evaluating the semantic similarity between words by mapping texts to vector space and computing prior information. In our approach, we construct a model that can identify the words representing the same entity in special context even though they don't belong to the same concept. At last, we construct a network of words in which paths between words can reflect the evolution process of concepts. Our experimental results show that that our approach gives an effective solution to discover the semantic relationship between words, especially for words in specialty domains.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th Web Information System and Application Conference (WISA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2015.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

To evaluate how much a pair of entities or documents are similar is a common problem for current applications. Most approaches for this problem are based on the co-occurrence. However, different terms or words may represent the same entity or similar semantic in the real world since a concept often has more than one way of expression. Existing works always focus on computing semantic relatedness of words. But relatedness cannot reflect the similarity most of the time, on the other hand, most of their corpus are from common data sources such as Wikipedia and are not useful for the specialized vocabulary. In this paper, we propose a novel unsupervised approach for evaluating the semantic similarity between words by mapping texts to vector space and computing prior information. In our approach, we construct a model that can identify the words representing the same entity in special context even though they don't belong to the same concept. At last, we construct a network of words in which paths between words can reflect the evolution process of concepts. Our experimental results show that that our approach gives an effective solution to discover the semantic relationship between words, especially for words in specialty domains.
一种构建词相似度网络的无监督方法
评估一对实体或文档的相似程度是当前应用程序的一个常见问题。大多数解决这个问题的方法都是基于共现的。然而,在现实世界中,不同的术语或单词可能代表相同的实体或相似的语义,因为一个概念通常有不止一种表达方式。现有的研究大多集中在计算词的语义相关性上。另一方面,他们的语料库大多来自维基百科等常用数据源,对专业词汇没有用处。在本文中,我们提出了一种新的无监督方法,通过将文本映射到向量空间并计算先验信息来评估词之间的语义相似性。在我们的方法中,我们构建了一个模型,该模型可以识别在特定上下文中表示相同实体的单词,即使它们不属于相同的概念。最后,我们构建了一个词网络,其中词与词之间的路径可以反映概念的演变过程。实验结果表明,该方法能够有效地解决词与词之间的语义关系发现问题,特别是针对特殊领域的词。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信