一种改进的统计与后串最大匹配的中文分词算法研究  

Research of Chinese Word Segmentation Algorithms Based on Statistics and Reverse Maximum Match

作　　者：吴涛[1] 张毛迪[1] 陈传波[1] 

机构地区：[1]华中科技大学软件学院,湖北武汉430074

出　　处：《计算机工程与科学》2008年第8期79-82,共4页Computer Engineering & Science

基　　金：国家863计划资助项目(2006AA04Z131)

摘　　要：在比较各种传统分词方法优缺点的基础上,本文提出了一种新的分词算法。它采用改进的双向Markov链统计方法对词库进行更新,再利用基于词典的有穷自动机后串最大匹配算法以及博弈树搜索算法进行分词。实验结果表明,该分词算法在分词准确性、效率以及生词辨识上取得了良好的效果。This paper analyzes several traditional methods for the Chinese word segmentation, compares the advantages and disadvantages of these methods, and presents a new segmentation algorithm. The method adopts the improved bidirectional Markov chain statistical method to update the word library, and then uses the Reverse Maximum Match method based on the word library and the GameTree search algorithm to cut the Chinese word strings. The experimental results show this algorithm has got better effect on veracity, efficiency and new word distinguishment.

关 键 词：正向最大前串匹配 逆向最大前串匹配 统计法 有穷自动机 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]