An Improved Algorithm for Maximum Matching of Chinese Word Segmentation
Li Yuanfang · Computer Technology and Development · 2011
Maximum matching algorithm includes two,they are forward and reverse maximum matching algorithm.It is a fundamental algorithm in the field of Chinese word,is widely used in many fields.In this paper,get a detailed analysis of advantages and disadvantages of the maximum matching algorithm,based on it,proposed an improved algorithm for maximum matching of word segmentation.In improved algorithm deal thesaurus with some rules at first,when doing Chinese word segmentation it searches the relative Chinese phrases with the beginning character of the word,then matches word with the traditional maximum matching algorithm from long to short of the order of phrases' length.The aim is to reduce the inefficiencies of traditional methods and solve the problem that the long word can not split well.The algorithm results show that the improved algorithm is better than the traditional maximum matching algorithm in efficiency,and more powerful.