Code storage method, data storage structure of texts and method for compressed storage of texts and statistics output

Abstract

The invention discloses a code storage method, a data storage structure of texts, and a code storage method, data storage structure of texts with the core based on users' codes in a duotricemary notation set by capital letters and necessary punctuation marks. Users' codes in a duotricemary notation corresponding to every three characters in each word are converted according to binary system and stored in a 16-bit binary storage unit. In the data storage structure of texts, texts are stored in a hash tree. The hash tree comprises multiple table nodes orderly corresponding to users' codes in the duotricemary notation; each table node is a head node of a first-order link table and words with same initials or same characters can be stored in the first-order link table; as word nodes of subsequent nodes in the first-order link table, word nodes comprise fields for recording word lengths and the number of repeated words in texts; each word node is a first node of a second-order link table; as storage nodes of subsequent nodes in the second-order link table, each storage node is used for storing binary storage units for current words and character groups for repeated words divided by the rule in the code storage method applied in the claim 2.

Description

technical field [0001] The invention relates to a data structure for storing text characters capable of providing retrieval speed, and a text storage method and a text retrieval method based on the data structure. Mainly related to patent classification number G06 Calculation; Calculation; Counting G06F Electrical digital data processing G06F17 / 00 Digital computing equipment or data processing equipment or data processing methods especially suitable for specific functions G06F17 / 30 Information retrieval; and its database structure. Background technique [0002] The traditional character or text storage method is as follows: [0003] Core: Read a segment of the current text as the input string AS='HE IS A DOCTOR.'. Reading process: [0004] When a capital is encountered, it is considered to be the beginning of the current sentence; when a space is encountered, it is considered to be the end of the current word; when a period (or "?", "!") is encountered, it is considered th...

AI Technical Summary

Problems solved by technology

These word segmentation and statistical methods are simple and easy to implement, but the subsequent semantic processing and sentence statistics are very troublesome, such as:

[0028] (1) It takes too long to count words and match words;

[0029] (2) Since the poems are stored in a non-compact form, the process of splicing words and matching words is very complicated, that is, it takes up a lot of memory and wastes a lot of time for counting words

Images