Bidirectional Maximal Matching Word Segmentation Algorithm with Rules

Bidirectional maximum matching algorithm (BMM) combined positive maximal matching and reverse maximal matching algorithm, it was a more commonly used word segmentation method now, but it was low efficient and couldn’t solve the ambiguity. Therefore, an improved method was proposed combining with improved dictionary structure, and changing maximal matching word length dynamically to improve the efficiency of word segmentation. In order to get the correct segmentation results, we also proposed several rules. Compared with traditional segmentation methods, it proves that bidirectional maximal matching word segmentation with rules has higher speed and precision.