节点文献

基于词共现有向图的中文合成词提取算法

Chinese Compound Word Extraction Algorithm Based on Word Co-occurrence Directed Graph

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘兴林郑启伦马千里

【Author】 LIU Xing-lin1,2,ZHENG Qi-lun1,MA Qian-li1(1.School of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,China;2.School of Computer Science,Wuyi University,Jiangmen 529020,China)

【机构】 华南理工大学计算机科学与工程学院五邑大学计算机学院

【摘要】 分词系统由于未将合成词收录进词典,因此不能识别合成词。针对该问题,提出一种基于词共现有向图的中文合成词提取算法。采用词性探测方法从文本中获取词串,由所获词串生成词共现有向图,并借鉴Bellman-Ford算法思想,从词共现有向图中搜索多源点长度最长且权重值满足给定条件的路径,该路径所对应的词串即为合成词。实验结果显示,该算法的合成词提取正确率达到91.16%。

【Abstract】 Word segmentation systems do not include compound words into their dictionaries,so they can not recognize compound words.To address this problem,this paper proposes a Chinese compound word extraction algorithm based on word co-occurrence graph.It gets word strings from a document through by part-of-speech detecting,generates word co-occurrence directed graph,,and borrows the idea of the Bellman-Ford algorithm to search the longest paths with weight values satisfy the given conditions for multiple starting points in the word co-occurrence directed graph.The word strings corresponding to the paths are considered as compound words.Experimental results show that the algorithm achieves 91.16% upon the precision.

【基金】 广东省自然科学基金资助项目(9451064101003233,S2011010003681);广东省科技计划基金资助项目(2010B010600039);华南理工大学中央高校基本科研业务费基金资助项目(2009ZM0125,2009ZM0189,2009ZM0255)
  • 【文献出处】 计算机工程 ,Computer Engineering , 编辑部邮箱 ,2011年23期
  • 【分类号】TP391.1
  • 【被引频次】8
  • 【下载频次】112
节点文献中: 

本文链接的文献网络图示:

本文的引文网络