Lexicon creation method and system as well as corresponding word searching method and system

Abstract

The invention discloses a lexicon creation method and a system as well as a corresponding word searching method and a system. Each word is divided into N letter groups; the lengths of the n'th letter group and the following letter group thereof are not fixed; a word base is divided into N blocks; the information of the nth letter group is respectively stored in each n-grade cell index; if the letters before the n'th letter group of the jth word and the (j-1)th word are the same and the number of the continuously same letters starting from the first letter of the n'th letter group is larger than 1, then the information of the n'th letter group stored by the jth n'-grade cell index is represented by the form of a number Rj plus the rest letters of the letter group, otherwise, the information is completely represented by the form of letters, wherein n' is equal to or more than 2 and is equal to or less than N; when indexing the inputted words, the number Rj in the n'-grade cell index is identified as the continuous Rj letters starting from the first letter of the n'th letter group of the word corresponding to the front n'-grade cell index of the same group. The invention can occupy less memory space simultaneously when quickly searching the word.

Description

technical field [0001] The invention relates to a method and system for creating a thesaurus, and a corresponding word query method and system. Background technique [0002] For an electronic dictionary, generally in the process of inputting a word, the user will use part of the content of the input word to query the relevant content of the word. Whenever the user inputs a letter of a word to be looked up, the electronic dictionary must dynamically perform a lookup action. Therefore, the speed of the query action will certainly affect the overall performance of the electronic dictionary. [0003] At present, there are many methods for querying electronic dictionaries, and querying with an index structure is a relatively common method, among which the dictionary tree index and the two-level index based on word prefixes are most commonly used. The dictionary tree index uses a complete full N-ary tree structure, so words can be directly located, but this structure uses a larg...

AI Technical Summary

Problems solved by technology

There are following deficiencies in this method: 1, under the limited memory space, the amount of word information that can be retrieved is few, and the search of the first and second levels in the memory can only be fuzzy query, and the location of the target word to be inquired mainly depends on the unloaded word. 2. The sequential search of the information layer cannot quickly locate words

Images