JPH0338772A - Compression system for character code data - Google Patents

Abstract

PURPOSE:To compress the character code data by using a KANJI (Chinese character) phrase code dictionary and applying a process system where the character codes and the phrase codes are unified into 2 bytes and 3 bytes respectively. CONSTITUTION:The character codes 9 are defined when the most significant bit of a 1st byte is equal to '0', and the KANJI phrase codes 10 are defined when the most significant bit is equal to '1' respectively. The codes 9 have 2 bytes and are assigned to 32K characters with remaining 15 bits, and the codes 10 are assigned to 32K characters of the codes 9 with remaining 15 bits of 1st and 2nd bytes and then assigned to the code of a KANJI phrase starting at the head character of a phrase at a 3rd byte. The character strings of the KANJI-KANA (Japanese syllabary) sentences are changed into the codes by a character code dictionary 3. A character string code part 8 of a KANJI phrase code dictionary 6 is retrieved by a deciding means 4. When the coincident codes are detected, the data on a code part 7 is read out. If no coincident code is confirmed, the character code read out of the dictionary 3 is stored in a storage means 5 as it is. Thus the character code data can be compressed and converted.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a compression method for character code data, and particularly to a compression method for character code data of Kanji characters.

[Conventional technology]

In general, document creation machines such as Japanese word processors process sentences containing kanji and kana, so Japanese data is JIS.
Using standards (C-6226 Kanji code system for information exchange) etc.
One Japanese character is expressed in two bytes, and almost all character codes are processed as they are.

In order to improve the efficiency of this data processing, data compression is necessary, and the conventional technology is the character code data compression method (Japanese Patent Publication No. 61-232724). , distinguish between 2 bytes and allocate the remaining number of bits to the word code dictionary.Also, to increase the number of word code dictionaries, use the first byte as an extended control code and use the remaining 2 bytes as the word code dictionary. [Problem to be solved by the invention] In the conventional character code data compression method described above,
Because the dictionary is ordered by frequency of use, it takes time to search for low-frequency words, and since both the word code and character code are variable lengths, processing becomes complicated, and words that cannot be compressed must be taken into account. However, there is a drawback that the number of bytes may increase more than the original number of bytes.

The purpose of the present invention is to solve the above drawbacks and provide a compression method for character code data that can be easily searched and does not increase in number of bytes than the number of bytes of an original character code string, which has a fixed length of 2 characters, 2 bytes, and idioms, 3 bytes. There is a particular thing.

[Means for Solving the Problems] The character code data compression method of the present invention is such that when processing Japanese using a Japanese word processor, each character is generally one character with a fixed length of 2 bytes (16 bits). In the character code data compression method that uses 2-byte code data as is for multiple character strings that express one word, we focused on the kanji part of Japanese kanji and kana mixed sentences, and For Kanji compound words that are combinations of words, a 3-byte code dictionary of Kanji compound words is provided, in which the first letter of the Kanji is expressed in 2 bytes, and the next 1 byte is used to code the Kanji compound word starting with the first letter of the Kanji character, Arrange the readings of the first letters of the kanji compound words in alphabetical order in advance,
The kanji character code data string is searched by the first character of the kanji character expressed in 2 bytes, and the code of the kanji character expressed in 2 bytes matches the code of the kanji compound word. It is configured so that the original number of bytes does not increase by compressing and converting it into code data and using character strings that cannot be compressed because they are not registered as idioms as they are.

〔Example〕

Next, the present invention will be explained in detail with reference to the drawings.

FIG. 1 is a functional block diagram of an embodiment of the present invention, in which 1 is an input means, 2 is a character code string-time storage means, 3 is a character code dictionary, 4 is a discrimination means, 5 is a storage means, and 6 is a kanji character. In the idiom code dictionary, 7 is a kanji idiom code section, and 8 is a character string code section. Figure 2 is a configuration diagram of the character code and kanji phrase code. If the most significant bit of the first byte is 0'', the character code is 9°; if the most significant bit is 1'', the kanji phrase code is 10.
Character code 9 is a 2-byte code, and the remaining 15 bits are assigned to character 32, and Kanji compound word code 10 is the remaining 15 bits of the 1st and 2nd bytes, which are assigned to character 32 of character code 9. , the third byte is assigned to the code of the kanji compound word starting with the first character of the compound word.

Figure 3 shows an example of a kanji idiom starting with ``kanji ichiichi''. Figure 4 shows part of the Kanji Idiom Code Dictionary, which shows 12 Idiom Codes and 13 character Codes.
The Kanji Idiom Code Dictionary arranges the pronunciations of kanji in alphabetical order and searches using keyword 11.

As a usage method, as shown in FIG. 1, a character string containing kanji and kana characters inputted from the input means 1 is encoded into the corresponding character code from the character code dictionary 3, and read into the character string code-time storage means 2. The read character code string is determined by the discrimination means 4.
The character string code section 8 of the kanji compound word code dictionary 6 is searched to find the corresponding character string. If there is a match, the data of the code part 7 of the kanji compound word is read out and stored in the storage means 5,
If there is no match, the character code read from the character code dictionary 3 is stored as it is in the storage means 5 for compression conversion. Thereafter, processing such as editing, output, storage, and transmission will be performed using this code system.

Note that FIG. 5 is an example of compression conversion in which the compression result after processing the JIS 2-byte code character string 14 is shown in 15. In this example, the 28-byte code becomes 21 bytes, indicating that it has been compressed to 0.75.

In this way, character codes that cannot be compressed are expressed as they are in 2 bytes, and kanji compound words that can be compressed are the first.
Kanji character code in the second byte.

Kanji compound word code (number) starting with that kanji in the 3rd byte
Processing is simplified by unifying the 2-byte character code and 3-byte kanji compound word code. Also,
By sorting the readings of kanji in alphabetical order, which does not increase the length of the original data, and using each kanji as a keyword, you can search even for low-frequency compound words in a short time. Since 256 types of phrases starting with can be taken, it can be put to practical use sufficiently, and since the amount of data as a result of compression is reduced, processing and transmission speeds can be increased, and storage capacity can be reduced.

〔Effect of the invention〕

As explained above, the character code data compression method of the present invention provides a Kanji compound word code dictionary exclusively for Kanji characters sorted in alphabetical order, and standardizes character codes to 2 bytes and compound words to 3 bytes. By adopting this processing method, the character code data can be easily searched and can be compressed without increasing the number of bytes of the original character code string, which has a fixed length of 2 bytes for characters and 3 bytes for idioms. There is.

[Brief explanation of drawings]

Fig. 1 is a block diagram showing one embodiment of the present invention, Fig. 2 is a configuration diagram of character codes and kanji compound words codes, Fig. 3 is a diagram showing an example of kanji compound words starting with the kanji ``日'', and Fig. 4 5 is a diagram showing a (partial) Kanji compound word code dictionary, and FIG. 5 is a diagram showing an example of compression conversion. DESCRIPTION OF SYMBOLS 1... Input means, 2... Character code string-time storage means, 3... Character code dictionary, 4... Discrimination means, 5...
- Storage means, 6... Kanji compound word code dictionary, 7... Kanji compound word code section, 8... Character string code section, 9... Character code, 10... Kanji compound word code, 11... Keyword, 12... Idiom code, 13... Character string code, 14... JI
S2 bytecode, 15... compression result after processing.

Claims (1)

[Claims] When processing Japanese using a Japanese word processor, etc.
Each character generally has a fixed length of 2 bytes (16 bits) to represent one character, and multiple character strings representing one word can also be represented by 2 characters.
In a compression method for character code data that uses byte code data as is, we focused on the kanji part of Japanese sentences containing kanji and kana, and compared the first character of kanji to kanji compound words that are combinations of kanji character strings. is expressed in 2 bytes, and the next 1 byte is provided with a 3-byte kanji idiom code dictionary that encodes kanji idioms starting with the first character of the kanji,
Arrange the onkun readings of the first letters of the kanji compound words in alphabetical order in advance, search using the first letter of the kanji characters expressed in 2 bytes, and find the code of the kanji character expressed in the 2 bytes and the kanji compound word. The original number of bytes is increased by compressing and converting the kanji character code data string into kanji compound word code data using a method that matches the code of A character code data compression method characterized in that the character code data compression method is configured such that the character code is