50 results about "Text compression" patented technology

A text processor processes text in a message. The text processor generates a plurality of compressed forms of components of the message. The processor performs a linguistic analysis on the body of text to obtain a linguistic output indicative of linguistic components of the body of text. The processor then generates the plurality of compressed forms that can be used to compress the body of text. The plurality of compressed forms are generated based on the linguistic output. The invention can be implemented as a method of generating the compressed forms and as an apparatus.

A text message is first parsed into its constituent semantic components such as header fields and body components. Then, different compression methods may be performed on each semantic component depending on the importance of the semantic component, the context of the semantic component, the characteristics of the semantic component, and whether or not the semantic component uses natural language expressions. For example, it is determined what compression method, if any, is to be performed on the semantic component. Each semantic component may be compressed individually. Since text compression takes the unique features of each semantic component into consideration rather than considering the text message as a monolithic text unit, a more intuitive text compression results.

The embodiment of the invention provides a file compression method, a file compression device, a file decompression method, a file decompression device, a compressed file searching method and a compressed file searching device. The file compression device comprises a first storage module, a first acquiring module, a first word segmentation module, and a first coding module, wherein the first storage module is used for storing a coding table which records the correspondence between standard character strings and coding identifiers, and each of the standard character strings has a unique coding identifier; the first acquiring module is used for acquiring a part of or all texts in a file to be compressed to form a text to be coded; the first word segmentation module is used for carrying out word segmentation to the text to be coded according to the standard character strings and decomposing the text to be coded to at least one character string to be coded; and the first coding module is used for acquiring a first coding sequence corresponding to the text to be coded by replacing the coding identifiers of the standard character strings with the corresponding at least one character string to be coded according to the correspondence between the standard character strings recorded in the coding table and the coding identifiers. The invention improves compression ratio of the text compression algorithm and convenience of the searching.

A text processor processes text in a message. The text processor generates a plurality of compressed forms of components of the message. The processor performs a linguistic analysis on the body of text to obtain a linguistic output indicative of linguistic components of the body of text. The processor then generates the plurality of compressed forms that can be used to compress the body of text. The plurality of compressed forms are generated based on the linguistic output. The invention can be implemented as a method of generating the compressed forms and as an apparatus.

The invention discloses a document compression method. The method comprises the following steps of: acquiring a document to be compressed from a memory stack; dividing the document into blocks of different types, wherein the types of the blocks comprise pictures and texts; judging the type of each block in the document in turn; if the type of one block is the picture, compressing the block according to a picture compression algorithm; if the type of one block is the text, compressing the block according to a text compression algorithm; and merging all compressed blocks together to generate a compressed document. By using the method, different compression algorithms can be selected for compression according to the types of the different blocks in the document to be compressed.

The invention discloses a method for predicting human activity positions in a smart home environment. According to data of different human activities collected by a motion sensor mounted in a test bench in the smart home environment, the method based on a period timeliness combined with a text compression algorithm (TimeLeZi and TLZ) is proposed for predicting the positions of the human activities. The method is suitable for being applied to the technical fields of smart homes, pattern recognition and the like. According the to the method for predicting the human activity positions in the smart home environment and based on the TLZ algorithm, compared with a result obtained through an LZ78 model and an ActiveLeZi model method, the predicting result of the method has higher prediction accuracy.

The present disclosure provides methods, computer program products and apparatuses for text compression and decompression wherein a desired compression ratio may be obtained, and the compressed content per se is still in a searchable text form, thereby providing a possibility for searching without decompression and significantly saving storage space and enhancing search efficiency, and in turn, reducing the total cost ownership TCO and providing a better user experience.

The invention discloses a Tibetan text compression algorithm, which is characterized by performing statistical analysis on Tibetan text in a 20G Tibetan webpage, establishing a mapping dictionary of aTiCA algorithm, and mapping the Tibetan text consisting of codes into a coding method to compress the Tibetan text according to the mapping dictionary. In this process, the text to be compressed needs to be scanned, the filtered Tibetan text is compressed according to an initial position interval of each section of Tibetan, each Tibetan position interval screened in the step 1 is traversed, Tibetan character strings in each interval are segmented into Tibetan characters through utilizing syllable symbols of Tibetan, and finally the Tibetan characters formed by one or more Tibetan components are mapped into codes, thereby completing compression of the Tibetan text. According to the dictionary, the Tibetan text compression algorithm TiCA provided by the invention is completed, and the robustness of the TiCA algorithm is improved. Experiments prove that an excellent effect is achieved no matter in the aspect of compression ratio or in the aspect of time consumption.

A method of transmitting communication information employing a coding scheme being defined by a character set. The characters of the character set are encoded into codewords of a sequence of bits, the codewords being of varying length. The characters are divided into at least two categories. The categories may be a first category of shifted characters and a second category of unshifted characters. Where a shifted character is encountered during encoding a shift codeword is inserted in the sequence of bits. This allows each category to use overlapping codewords. Then the sequence is converted to ASCII characters to be transmitted.

The invention discloses a short message compression communication method which comprises the steps of compressing a to-be-transmitted message to short message compressed data by a short message transmitting end through a text compression algorithm; generating the CRC check bit of the short message compressed data by the short message transmitting end; transmitting the short message compressed data and the CRC check bit to a short message receiving end by the short message transmitting end; if the short message receiving end has a decompression function, performing the following steps of verifying the short message compressed data by the short message receiving end by means of the received CRC check bit; and if verification passes, decompressing the received short message compressed data by means of a decompression algorithm, and obtaining a short message content which is transmitted by the short message transmitting end. The short message compression communication method according to the invention reduces an additional cost in transmitting a long text message by a user and improves user experience. The invention further discloses a short message compression communication system.