首页> 外文会议>International Conference on Large-Scale Knowledge Resources >Capturing the Structures in Association Knowledge:Application of Network Analyses to Large-Scale Databases of Japanese Word Associations
【24h】

Capturing the Structures in Association Knowledge:Application of Network Analyses to Large-Scale Databases of Japanese Word Associations

机译:捕获结社知识中的结构:网络分析对日语词构的大规模数据库

获取原文

摘要

Within the general enterprise of probing into the complexities of lexical knowledge, one particularly promising research focus is on word association knowledge. Given Deese's and Cramer's convictions that word association closely mirror the structured patterns of relations that exist among concepts, as largely echoed Hirst's more recent comments about the close relationships between lexicons and ontologies, as well as Firth's remarks about finding a word's meaning in the company it keeps, efforts to capture and unravel the rich networks of associations that connect words together are likely to yield interesting insights into the nature of lexical knowledge. Adopting such an approach, this paper applies a range of network analysis techniques in order to investigate the characteristics of network representations of word association knowledge in Japanese. Specifically, two separate association networks are constructed from two different large-scale databases of Japanese word associations: the Associative Concept Dictionary (ACD) by Okamoto and Ishizaki and the Japanese Word Association Database (JWAD) by Joyce. Results of basic statistical analyses of the association networks indicate that both are scale-free with small-world properties and that both exhibit hierarchical organization. As effective methods of discerning associative structures with networks, some graph clustering algorithms are also applied. In addition to the basic Markov Clustering algorithm proposed by van Dongen, the present study also employs a recently proposed combination of the enhanced Recurrent Markov Cluster algorithm (RMCL) with an index of modularity . Clustering results show that the RMCL and modularity combination provides effective control over cluster sizes. The results also demonstrate the effectiveness of graph clustering approaches to capturing the structures within large-scale association knowledge resources, such as the two constructed networks of Japanese word associations.
机译:在探究词汇知识复杂性的一般企业内,一个特别有前途的研究重点是单词协会知识。鉴于Deese和Cramer的定罪,Word Associations密切镜像了概念中存在的结构化的关系模式,因为Hirst最近关于Lexicons和Intolologies之间的密切关系的最新评论,以及Firth关于在公司中找到一个词的含义保持措施,努力捕获和解开丰富的联合网络,这些关联网络可以在一起连接单词的可能会产生有趣的洞察,以便进入词汇知识的性质。采用这种方法,本文应用一系列网络分析技术,以便研究日语文字关联知识的网络表示的特征。具体而言,两个单独的关联网络由日语词关联的两个不同的大规模数据库构建:Okamoto和Ishizaki的关联概念词典(ACD)和Joyce的日语关联数据库(JWAD)。关联网络的基本统计分析结果表明,两者都与小世界的属性无垢,两者都有展览组织。作为使用网络辨别关联结构的有效方法,还应用了一些图形聚类算法。除了范多根提出的基本马尔可夫聚类算法外,本研究还采用了最近提出的增强的复发性马尔可夫集群算法(RMCL)组合,其具有模块化指数。聚类结果表明,RMCL和模块化组合提供了对聚类尺寸的有效控制。结果还展示了图形聚类方法的有效性,以在大规模关联知识资源中捕获结构,例如两种构造的日语联想网络。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号