关键词: 双数组索引, 舍伍德随机思想, 遗传算法, 变异

Abstract: In the Chinese information processing Chinese dictionary is enquired.When involved in a large scale of dictionary，how fast the visit to obtain knowledge of words will become a need to focus on resolving problems.This paper will outline a simple and efficient mechanism which is based on double-array Trie principle for the dictionary.For enquiries about the time of the algorithm is O（n）of linear time（n is the length of term enquiries）.This shows that there is a clear advantage in double-array Trie.But there is a serious waste in storage of double-array Trie.Predecessors put forward some solutions.One of the major：Using a heuristic sort strategy.That is，each time the active node is dealt with first which has the largest branch nodes.Considering that such solution is a heuristic algorithm for deterministic algorithm，it will be easy to catch the trap of local optimal solution.On the basis of that kind of mentality，this paper introduces the idea of Sherwood random thoughts and mutation of genetic algorithms to improve the performance of double-array Trie.

Key words: Double-Array Trie（DAT）, Sherwood algorithms, genetic algorithms, mutation