复句关系词规则生成系统中的冲突检测与处理  

Rule Conflict Resolution for Relation Word in Chinese Compound Sentences

作　　者：杨进才[1] 谢芳[2] 王中华[1] 胡金柱[1] 

机构地区：[1]华中师范大学计算机学院 [2]湖北工业大学计算机学院

出　　处：《中文信息学报》2015年第4期8-15,共8页Journal of Chinese Information Processing

基　　金：国家教育部人文社科基金(13YJAZH117);国家社科基金(11BYY052)

摘　　要：复句中的关系词对研究复句中各分句的语义关系有着重要意义,在基于规则的关系词自动识别中需要大量的规则,并且规则库是动态变化和不断完善的,向规则库中入库规则时会出现规则冲突和入库错误的情况,该文探讨如何在入库时识别产生冲突的规则,并对规则进行相关的处理。对复句的普通规则、连用词规则、普通句式规则、连用句式规则四类规则进行了形式化的表示与存储,在此基础上设计了关系词检测、约束类型检测、约束条件检测、结论检测的检测流程。提出了两种冲突处理方式——优先级方式和有向无环图方式,对两种方法进行了比较。利用该检测方法和有向无环图的处理方式,入库了千余条规则。实验表明,利用该方法冲突规则的检测和处理正确率达到100%。Relation words are very important to the study of semantic relationships among clauses in compound sen- tences. Rule based relation word identification demands dynamic and constantly improved rules. This article investi- gates how to recognize the rule conflicts and solve them. Compound sentences have four kinds of rules., common rules, even words rules, common sentence pattern rules, and collocation patterns rule. This article gives a formal description of all the rules and the way of storing them, based on which we designed the flow of relation word detec- tion, rule condition detection, result detection. A way of detecting the conflicts is given, include another two ways of solving the conflicts-priority mode and directed acyclic graph mode. With this proposed method, we have impor- ted more than 1067 rules, with a correct rate of 100%.

关 键 词：复句关系词 规则冲突 有向无环图 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]