Data compression algorithm based on semantic analysis
A technology of data compression and semantic analysis, which is applied in the computer field, can solve the problems of ignoring keywords and the regularity of special sentences, etc., and achieve the effect of clear structure, high repeatability and high compression ratio
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0019] The technical solutions of the present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.
[0020] refer to figure 1 , a data compression algorithm based on semantic analysis, including the following steps:
[0021] 1) Open the C language text file to be compressed, according to the classification of C language for text (keywords, variables, constants, strings, characters, comments, etc.), obtain each key element in turn, ignore the secondary elements, and save them in A doubly linked list LinkSrc;
[0022] 2) Traverse the linked list LinkSrc, count the number of occurrences of each element, and use the basic information (type, frequency, content, length, code, etc.) of the element as a node to newly build a two-way linked list LinkRate;
[0023] 3) Use the nodes in the linked list LinkRate as leaf nodes to form a Huffman tree with the root LinkRoot;
[0024] 4) Copy and save the leaf nodes in LinkRoot as...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com