Research of Chinese Word Segmentation Based on Double-Array Trie
Zhao Huan · Journal of Hunan University · 2009
This paper proposed some improved strategies for the algorithm of Double-Array Trie.Firstly,the priority was given to the node with most child nodes in order to avoid the collision;secondly,an empty-list was defined;Finally,the collision node was added to a hash table,which avoided re-allocation.Then,we implemented a program for a Chinese word segmentation system based on the improved Double-Array Trie and compared it with several other methods.From the results,it turns out that the insertion time and the space efficiency are achieved,and that search efficiency is improved.