Electronic dictionary work retrieval method based on self-adapting dictionary tree

Abstract

The invention discloses an electronic dictionary words retrieval method based on a self-adaptive dictionary tree and relates to a words retrieval technology in an electronic dictionary. The method defines a retrieval structure with two levels which includes a prefix matching level of the self-adaptive dictionary and a complete words matching level for a piecewise dichotomy search. The retrieval method is that the matching of words prefixes is firstly implemented in the self-adaptive dictionary tree, and if the words prefixes are hit, the information of the words is returned. Otherwise, the piecewise dichotomy search level is started for the search, and the words to be searched for or the information of the words which is nearest to the words to be searched for is found out and returned. The electronic dictionary words retrieval method can be used for effectively improving the efficiency of the words search and ensuring the balance of time efficiency and space occupation.

Description

technical field [0001] The invention belongs to the technical field of electronic learning products, in particular to a method for word retrieval in an electronic dictionary. Background technique [0002] At present, there are many methods for word retrieval in electronic dictionaries, which can be divided into retrieval without index structure and retrieval with index structure. Since the retrieval efficiency without index structure is poor and takes up a lot of space, index structure retrieval is generally used. [0003] In the index structure, there are two commonly used methods: the dictionary tree retrieval method and the binary search method based on word prefixes. Both methods have obvious advantages and disadvantages. [0004] In the dictionary tree retrieval method, the concept of space-for-efficiency is used. Since a complete full n-ary tree structure is used, words can be directly located and hit, but in order to construct a complete dictionary tree, a large num...

AI Technical Summary

Problems solved by technology

[0004] In the dictionary tree retrieval method, the concept of space-for-efficiency is used. Since a complete full n-ary tree structure is used, words can be directly located and hit, but in order to construct a complete dictionary tree, a large number of useless nodes are used, resulting in huge waste of space

[0005] In the binary search based on word prefixes, due to the large difference in the length of word prefixes in general electronic dictionaries, in order to meet the characteristics of the same size of each element in the binary search, the prefix of each word must be extended to the longest The length of the word prefix causes a waste of space, making it impossible to load data into memory for searching in an environment with limited memory, which reduces the efficiency of binary search, and some hardware conditions do not support the back and forth pointer movement of binary search

Images