首页 | 本学科首页   官方微博 | 高级检索  
     检索      

几种叙词表复杂逻辑错误检查算法研究
引用本文:徐硕,乔晓东,朱礼军.几种叙词表复杂逻辑错误检查算法研究[J].数字图书馆论坛,2010(8):55-58.
作者姓名:徐硕  乔晓东  朱礼军
作者单位:中国科学技术信息研究所,北京,100038
基金项目:"十一五"国家科技支撑计划,中国科学技术信息研究所重点工作项目 
摘    要:目前叙词表的编制仍以手工为主,计算机为辅,因此难免会出现各种逻辑错误.为了保证叙词表的一致性,经常需要首先检查其中的逻辑错误,然后对其进行纠正.但复杂逻辑错误的检查通常比较困难,尚没有有效算法可以利用.针对这种现状,文章借助图论的相关知识,设计了几种检查复杂逻辑错误的算法,并分析了相应算法的时间复杂度.而且这些算法也可为其他词汇知识组织系统的逻辑错误检查提供一定的参考.

关 键 词:叙词表  一致性  逻辑错误  算法  图论

Research on Algorithms for Checking Several Complex Logic Errors in Thesauri
Shuo Xu,Xiao-Dong Qiao,Li-Jun Zhu.Research on Algorithms for Checking Several Complex Logic Errors in Thesauri[J].Digital Library Forum,2010(8):55-58.
Authors:Shuo Xu  Xiao-Dong Qiao  Li-Jun Zhu
Institution:Institute of Scientific and Technical Information of China, Beijing, 100038
Abstract:Currently, the thesauri are constructed mainly by manual, which is aided by computers. So there are various logical errors within the thesauri. In order to make sure the thesauri consistent, logical errors otten need to be checked, and then are corrected. However, it is very difficult to check complex logical errors, and there aren' t effective algorithms that can be utilized. For present status, with the help of related knowledge in graph theory, this study designs several algorithms that are able to check complex logical errors, and analyzes the resulting algorithms' time complexity. What's more, these algorithms can provide reference to some extent for checking logical errors in other lexical knowledge organization system (KOS).
Keywords:Thesaurus  Consistency  Logical error  Algorithm  Graph theory
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号