| 基于知网的概念匹配细粒度化研究 |
| |
| 引用本文： | 杨喜权,代书.基于知网的概念匹配细粒度化研究[J].计算机应用,2008,28(11):2837-2839. |
| |
| 作者姓名： | 杨喜权 代书 |
| |
| 作者单位： | 1. 东北师范大学,计算机学院,长春,130117
2. 中国农业发展银行,科尔沁区支行,内蒙古通辽,028000 |
| |
| 摘 要： | 基于知网的语义结构,构建了具有添加和删除特点的语义树,使概念的匹配粒度实现细化,并给出了概念语义树匹配算法。实验结果证明了算法的有效性,较好地解决"关键字障碍"和语义歧义性问题,提高查全率。
|
| 关 键 词： | 概念匹配 语义树 知网 |
| 收稿时间： | 2008-05-29 |
| 修稿时间： | 2008-07-24 |
Study on granularity concept matching based on How-Net semantic tree |
| |
| YANG Xi-quan,DAI Shu.Study on granularity concept matching based on How-Net semantic tree[J].journal of Computer Applications,2008,28(11):2837-2839. |
| |
| Authors: | YANG Xi-quan DAI Shu |
| |
| Affiliation: | YANG Xi-quan1,DAI Shu2(1.School of Computer Science,Northeast Normal University,Changchun Jinlin 130117,China,2.Horqin Borough Subbranch,Agricultural Development Bank of China,Tongliao Nei Mongol 028000,China) |
| |
| Abstract: | In this paper, semantic trees that had accession and deletion were established based on How-Net to implement granularity concept matching. The concept semantic tree matching algorithm was presented. Efficiency of the algorithm was proved by the results of the experiment and the problem of "key word obstacle" and semantic ambiguity can be solved much better. The recall ratio was improved. |
| |
| Keywords: | concept matching semantic tree How-Net |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
