US 2014/0180679 A1Published application

Method and system for text compression and decompression

OwnerZinovy D Grinblatinventor

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present invention is to provide a method and system for compression and decompression text comprising: creating a redundant universal permanent reference vocabulary which include commonest symbols utilized by all application, and symbols found in thousands of books, specific, professional vocabularies and is created in advance of any information processing, own vocabulary containing during process of text compression and decompression wherein the own vocabulary includes words and symbols e.g. slangs are found in written conversation between persons; splitting the universal vocabulary into a root of tree symbol/index and main symbol sections; creating a first temporary vocabulary; wherein the first temporary vocabulary includes commonest symbol/index utilizing by all applications, root of tree word/index section, and merging index table section to words content in specific vocabulary section; creating a second temporary vocabulary for repeating symbols found in the source text and not found in the first temporary vocabulary; creating pseudo-code by merging an indicator with root of tree or main indexes.

Claims5

Dependent claims

A computer system for compressing and decompressing text comprising:

Storage for storing a processor, counter and memory for performing the steps of reading the source text and creating the compressed target text;
storage for storing the universal permanent reference vocabulary;
storage for storing the compressed text;
wherein the compressed text includes:
section of sequential flow indexes;
section of sequential flow pseudo-codes;
storage for storing codes;
storage for storing a randomly index table;
temporary file for storing a source text in the form of characters;
file for storing a first temporary vocabulary;
wherein creating a first temporary vocabulary comprises:
merging index section to words content in specific vocabulary section;
merging a randomly index table to words content in specific vocabulary section;
files for split a first temporary vocabulary into root of tree index section and pseudo-code section;
file for storing a second temporary vocabulary;
wherein temporary storing a repeating indexes in the second temporary vocabulary;
temporary file for storing a counting parts of group of repeating indexes;
assigning a pointed code to the first index in the sequence of compressed target text;
output repeating indexes into the second temporary vocabulary;
storing an integrated circuit on the smart card;
wherein the integrated circuit includes memory, frequency generator;
logic scheme, switches, RF, LED and conductor's magnet stripe.

19 more elements

A non-transitory computer readable media storing a program, wherein the program instructs a processor to perform the steps for a method for compressing and decompressing text, comprising:

creating a universal permanent vocabulary,
wherein the universal vocabulary is a redundant vocabulary including:
Section of commonest word/indexes using for all applications, sections of words using for literature, TV, papers, magazines, specific and professional applications and creating in advance;
section of the own vocabulary taken symbols e.g. slangs from written conversation between two persons, group of people, between people in an organization and creating during process of text compression and decompression text;
creating index table section;
in each section of the universal vocabulary organizing symbols:
In alphabetic order, length of characters belong to symbol, quantity of spaces and punctuation marks, and unique group of characters represented word itself;
searching of symbols in the universal vocabulary based on the following rules:
Alphabetic order;
length of characters belongs to symbol;
quantity of spaces and punctuation marks;
and unique group of characters;
splitting the universal vocabulary into two sections, which include a root of tree word/index section and main word section;
creating a first temporary vocabulary containing;
creating identical a first temporary vocabulary on receiver side during process of decompressing text;
creating a second temporary vocabulary during process of compressing text;
creating identical a second temporary vocabulary on receiver side during process of decompressing text;
creating a pseudo-code by merging indicator to index;
recovering transmitted compressed text in the form of indexes into corresponding symbols in form of characters using as reference the first and second temporary vocabularies;
wherein creating the identical second temporary vocabulary on the receiver side during process of decompressing the compressed text comprises:
reading the compressed text;
finding assigning a pointed code for repeating indexes in the compressed text;
output repeating indexes into the second temporary vocabulary;
one way transmitting public and private information in the form of randomly indexes from a payment card to a host computer;
matching of transmitted public and private information with stored in the host computer identical public and private information;
transmitting from the host computer to the user decision on matched information;
additionally compressing the compressed target text by utilizing LZW compression algorithms or other relatively techniques.

24 more elements

Dependencies are inferred from the claim text.