关键词: 句子覆盖率, 分词覆盖率, 双向最大匹配算法, 全切分, 网络有向图

Abstract: Chinese word segmentation is one of the fundamental key techniques for Chinese Information Processing. In this paper, the authors firstly studied current segmentation algorithms, then, modifid the traditional Maximum Match (MM) algorithm. With the consideration of both word-coverage rate and sentence-coverage rate, a character Directed Graph with ambiguity mark was implemented for searching all possible segmentation sequences. This method compared with the classic MM algorithms and omni-segmentation algorithm and the experiment result shows that the Directed Graph based algorithm can achieve higher coverage rate and lower complexity.

Key words: sentence-coverage rate, word-coverage rate, Bi-directional Maximum Match, omni-segmentation, directed graph