| 基于动态规划的汉语句子相似度算法 |
| |
| 引用本文： | 冯凯,王小华,谌志群.基于动态规划的汉语句子相似度算法[J].计算机工程,2013,39(2):220-224. |
| |
| 作者姓名： | 冯凯 王小华 谌志群 |
| |
| 作者单位： | 杭州电子科技大学计算机应用技术研究所,杭州,310018 |
| |
| 基金项目： | 国家自然科学基金资助项目(61103101)；教育部人文社会科学研究基金资助项目(12YJCZH201) |
| |
| 摘 要： | 传统汉语句子相似度计算算法在处理大量专业词汇时准确率较低。为此，提出一种基于动态规划的汉语句子相似度算法。通过获取2个句子的公共子串集合，结合链表消重机制，从集合中获取2个句子的所有最长公共子串，并以此计算相似度。实验结果表明，对于含有大量专有名词的问题集合，该算法的测试正确率达93.6%，计算效率较高。
|
| 关 键 词： | 句子相似度 动态规划 自动问答 最长公共子串 消重链表 |
| 收稿时间： | 2012-03-12 |
| 修稿时间： | 2012-05-21 |
Chinese Sentence Similarity Algorithm Based on Dynamic Programming |
| |
| FENG Kai
,
WANG Xiao-hua
,
CHEN Zhi-qun.Chinese Sentence Similarity Algorithm Based on Dynamic Programming[J].Computer Engineering,2013,39(2):220-224. |
| |
| Authors: | FENG Kai WANG Xiao-hua CHEN Zhi-qun |
| |
| Affiliation: | (Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou 310018, China) |
| |
| Abstract: | Traditional Chinese sentence computing algorithm has a lower accuracy in dealing with a large number of professional vocabulary. In order to solve this problem, this paper proposes a Chinese sentence similarity algorithm based on dynamic programming. By getting the common sub-string collection of two sentences, it combines the mechanism for duplicate elimination by linked list, and obtains all of the longest common sub-string of two sentences for computing similarity. Experimental results show that for the problem sets which contain a lot of proper nouns, the test accuracy of this algorithm is 93.6%, and has high computational efficiency. |
| |
| Keywords: | sentence similarity dynamic programming automatic question-answer longest common substring duplicate elimination linked list |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
