Method for realizing dictionary search of Trie tree based on one-dimensional linear space

A linear space and dictionary technology, applied in the field of dictionary retrieval based on one-dimensional linear space to realize Trie tree, to avoid backtracking problems and improve dictionary loading and retrieval speed.

Active Publication Date: 2013-10-23
SHENZHEN AUDAQUE DATA TECH
View PDF8 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Under the dictionary data of the Trie tree constructed in the one-dimensional linear space, the speed of dictionary loading and retrieval is improved, and all the prefix words of the entry can be quickly retrieved. In addition, the dictionary retrieval based on the Trie tree based on

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for realizing dictionary search of Trie tree based on one-dimensional linear space
  • Method for realizing dictionary search of Trie tree based on one-dimensional linear space
  • Method for realizing dictionary search of Trie tree based on one-dimensional linear space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0017] In order to make the purpose, technical solution and advantages of the present invention more clear, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0018] An embodiment of the present invention provides a dictionary retrieval method based on a one-dimensional linear space to realize a Trie tree.

[0019] Such as figure 1 As shown, it is a flowchart of a dictionary retrieval method based on a one-dimensional linear space to realize a Trie tree according to an embodiment of the present invention.

[0020] Step S110: Generating dictionary data of a one-dimensional linear space Trie tree.

[0021] To obtain dictionary data, to generate dictionary data of a one-dimensional linear space Trie tree includes the following specific steps:

[0022...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method for realizing a dictionary search of Trie tree based on one-dimensional linear space. The method comprises the following steps: through generating dictionary data of the Trie tree of the one-dimensional linear space, determining a to-be-queried vocabulary entry key according to the user input, and realizing the query according to the current state of the vocabulary entry key. Building the dictionary data of the Trie tree under the one-dimensional linear space increases the dictionary loading and searching speed, and can quickly search all prefix words of the vocabulary entry; besides, realizing the dictionary search of Trie tree based on one-dimensional linear space can solve the collision problem caused by inserting a new state existing in the Trie tree building process by the traditional Trie tree dictionary data search, and can avoid the problem of the move of the vast dictionary data caused by the conflict.

Description

technical field [0001] The invention relates to a dictionary retrieval method, in particular to a dictionary retrieval method realizing a Trie tree based on a one-dimensional linear space. Background technique [0002] In the field of information retrieval and natural language processing, especially in the technical application based on the dictionary, the scale of the dictionary is generally very large, with tens of thousands or even hundreds of millions of records, especially the scale of the inverted index in the search engine is the largest . The search for massive data dictionaries is currently usually implemented using an indexed data structure. Commonly used index structures include linear index tables, inverted lists, hash tables, and search trees. For a record whose keyword (key) length is n and the size of the dictionary is N (where N>>n), the time complexity analysis of each index structure retrieval is as follows: [0003] The linear index structure or i...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
CPCG06F16/9027
Inventor 王国印
Owner SHENZHEN AUDAQUE DATA TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap