摘要
在基于规则介词用法自动识别中,使用规则的不同顺序可以得到不同的用法识别准确率.对规则进行全排序并进行用法自动识别可以得到用法识别准确率最高的最佳排序方案,但是时间复杂度较高.首先对全排序的结果进行筛选,然后用筛选之后的结果进行用法自动识别则可以大大降低时间复杂度.实验结果表明,这种方法可以以较小的代价找到接近最佳排序的方案.
By using different sequences of rules in the automatic identification process of prepositional usage we could get different recognition accuracy.Having a full permutation of the rules firstly and then identi fying the sorting results automatically,we can get the best sequencing scheme by which the recognition accuracy rate would achieve the highest,while the time complexity is very high.However,screening the full permutation firstly and then taking automatic recognition upon the results can significantly reduce the time comple xity.The experimental results show that the latter method can be used as a shortcut to find the closest optimal sorting scheme with lower costs and thus obtain a higher identification accuracy of prepositional usage.
出处
《河南师范大学学报(自然科学版)》
CAS
北大核心
2013年第3期152-155,共4页
Journal of Henan Normal University(Natural Science Edition)
基金
国家高技术研究发展863计划资助(2012AA011101)
模式识别国家重点实验室开放课题基金资助
河南省教育厅科学技术研究重点项目(12B520055)
关键词
自动识别
规则
最佳排序
筛选
automatic recognition
rules
optimal permutation
screening