计算机工程 ›› 2008, Vol. 34 ›› Issue (14): 12-13.doi: 10.3969/j.issn.1000-3428.2008.14.005

• 博士论文 • 上一篇    下一篇

基于混合特征的上下位关系验证方法

刘 磊1,2,曹存根1   

  1. (1. 中国科学院计算技术研究所,北京 100080;2. 中国科学院研究生院,北京 100080)

  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-07-20 发布日期:2008-07-20

Hyponymy Relation Verification Method Based on Hybrid Features

LIU Lei1,2, CAO Cun-gen1   

  1. (1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 2. Graduate University of Chinese Academy of Sciences, Beijing 100080)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-07-20 Published:2008-07-20

摘要: 上下位关系的自动验证是知识获取中的一个关键问题。提出一种基于混合特征的迭代上下位关系验证方法,从语义、语境、空间结构角度,给出一组上下位关系特征,根据抽样数据分析,将所有特征转化为用于验证的产生式规则,利用这些规则对基于模式获取的上下位关系进行循环迭代验证。实验结果说明了该方法的有效性。

关键词: 上下位关系, 关系获取, 知识获取, 上下位关系验证

Abstract: Automatic verification of hyponymy relations is a basic problem in knowledge acquisition from text. This paper presents an iterative method of hyponymy verification based on hybrid features. It initially acquires a set of hyponymy features based on semantic, context and space structure of hyponymy. These features are changed into a set of production rules. The candidate hyponymys using Chinese lexico-syntactic patterns from Chinese corpus is verified with multi-features production rules. Experimental results demonstrate good performance of the method.

Key words: hyponymy relation, relation acquisition, knowledge acquisition, hyponymy relation verification

中图分类号: