Abstract:

This paper analyzes the existing segmentation algorithms, compares different algorithms on the basis of their advantages and disadvantages. The paper    proposes the superposition results of positive and reverse matching algorithms,generates a rough-cutting result,and constructs a non-negative right graph. Finally we obtain the right results by using the shortest path algorithm. It is used in Nutch, and the results show that the algorithm is effective i n improving Chinese segmentation, cutting accuracy and cutting speed, Meanwhile a partial solution to the intersection of the ambiguity segmentation pro blem is given.

Key words: Chinese-word-segmentation, shortest path, superposition