作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (5): 173-175. doi: 10.3969/j.issn.1000-3428.2010.05.063

• 人工智能及识别技术 • 上一篇    下一篇

基于最大匹配的中文分词概率算法研究

何国斌,赵晶璐   

  1. (西南大学计算机与信息科学学院,重庆 400715)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-05 发布日期:2010-03-05

Research on Probabilistic Algorithm of Chinese Word Segmentation Based on the Maximum Match

HE Guo-bin, ZHAO Jing-lu   

  1. (College of Computer and Information Science, Southwest University, Chongqing 400715)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-05 Published:2010-03-05

摘要: 结合顺序表和跳跃表的快速查询特性,提出一种改进的整词分词词典结构,主要采用哈希法和二分法进行分词匹配,并针对机械分词算法的特点,引入随机数,探讨一种基于最大匹配的分词概率算法。实验表明,该算法具有较高的分词效率和准确率,对消去歧义词也有较好的性能。

关键词: 分词词典, 跳跃表, 分词算法, 概率算法

Abstract: Combined with the sequence table and leaping form fast inquery characteristic, this paper presents an improvement structure of segmentation dictionary. Hashing and binary search is used to segmentation match for enquiring, and in view of the characteristics of the mechanical Chinese word segmentation, by introducing the random number, a Chinese word automatic segmentation probabilistic algorithm is discussed. Experiment indicates that the arithmetic can improve the speed of Chinese segmentation and precision, also, strengthen the processing of dispelling ambiguity.

Key words: segmentation dictionary, leaping form, segmentation algorithm, probabilistic algorithm

中图分类号: