JPH04223556A - Compression system for character code data - Google Patents

Abstract

PURPOSE:To simplify data compression for a character code. CONSTITUTION:In a glossary means 2, the KANA (Japanese syllabary) readings of glossary that is the combination character string such as Japanese KANJI (Chinese character) strings are stored in Japanese alphabetical order, the KANA reading of the glossary and the glossary of character string such as KANJI are made to correspond to each other, and a 2-byte code is imparted to every glossary. A KANA glossary conversion means 5 converts KANA characters inputted from an input means 1 to a 2-byte code of glossary by referring to the glossary means 2. A storage means 6 stores a 2-byte code converted by the KANA glossary conversion means 5 therein.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character code data compression method for compressing and converting characters.

0002

[Prior Art] In general, document creation machines such as Japanese word processors use JIS standards (C-6226 Kanji code system for information exchange) to process Japanese data in order to process sentences containing kanji and kana. A character is represented by two bytes, and most of the character codes are processed as they are. In order to improve the efficiency of this data processing, data compression is necessary, and a conventional technique is a character code data compression method (Japanese Patent Publication No. 61-232724).

FIG. 4 shows a functional block diagram of a conventional kana-kanji conversion system. In FIG. 4, 1 is an input means, 7 is a kana-kanji conversion dictionary, 8 is a kana-kanji conversion means, 9 is a character code dictionary, 10 is a character code conversion means, 11 is a character code storage means, and 12 is a character string (word) code. 15 is a dictionary, 15 is a word code conversion means, and 6 is a storage means.

[0004] The character string (document) of kana characters inputted by the input means 1 is referred to in the kana-kanji conversion dictionary 7 by the kana-kanji conversion means 8, and the corresponding characters are searched and converted into kanji. The converted kanji is converted into the corresponding character code in the character code dictionary 9 by the character code conversion means 10 and temporarily stored in the character code storage means 11.

[0005] The character string (word) code dictionary 12 contains character strings (
It consists of a word) code part 13 and a word character code string 14,
Character strings (words) assigned in advance to character strings (words) consisting of one character or multiple characters that appear frequently
By providing a code dictionary 12 and matching the character string of character code data with the character string (word) code dictionary 12,
It compresses and converts character code data into word code data, and converts the temporarily stored character code data string into the character string (word) code section 13 of the character string (word) code dictionary 12 and the word character code string 14. is converted into a word code by the word code conversion means 15 and stored in the storage means 6.

[0006]

[Problems to be Solved by the Invention] In such conventional character code data compression methods, the original compression conversion is performed after several steps such as kana-kanji conversion, character code data conversion, and temporary storage. There are disadvantages such as the processing becomes complicated and time consuming.

SUMMARY OF THE INVENTION An object of the present invention is to overcome the above drawbacks and provide a compression method for character code data that requires fewer conversion means, is simple to process, and can be processed in a short time.

[0008]

[Means for Solving the Problems] The present invention provides an input means for inputting kana characters and a character code data compression method for compressing Japanese character code data. A script term dictionary means that sorts the kana pronunciations of terms in a predetermined order, associates the kana pronunciations of the script terms with the script terms of the character string, and attaches a 2-byte code to each script term. , a kana character term conversion means for directly converting kana characters inputted from the input means into a 2-byte code of a character term by referring to a character term dictionary means, and a conversion result by the kana character term conversion means. It is characterized by having a storage means for storing bytecodes.

[0009]

Embodiments Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a functional block diagram showing one embodiment of the present invention. The compression method for character code data shown in Figure 1 is based on the input means 1 for inputting characters such as kana, alphanumeric characters, and symbols.
Then, we focused on commonly used words that are combinations of character strings such as Japanese kanji (hereinafter referred to as script terms), sorted the kana readings of the script terms in alphabetical order, and The kana character reading of the term and the character string of the character string such as kanji are associated with the character string dictionary means 2, which has a 2-byte code attached to each character term, and the kana characters inputted from the input means. It is provided with a kana-character term conversion means 5 that refers to the written-word dictionary means 2 and directly converts the written-word term into a 2-byte code, and a storage means 6 that stores the 2-byte code of the conversion result.

[0011] In such a compression method for character code data, the usage term dictionary means 2 has a kana character string code section 3.
and a lexical term code section 4. In this kanji-term dictionary means 2, kanji-terms are sorted. Tables 1 and 2 are examples of terms starting with "a" in a Japanese dictionary or other dictionaries.

0012

[Table 1]

[0013]

[0014]

[Table 2]

[0015]

[0016] FIG. 2 is a part of a diagram for explaining the usage term dictionary, in which 16 is the kana code (JIS), 17 is the kana character string, 18 is the usage term code, and 19 is the kanji of the usage term. Or it is a string of characters mixed with kanji and kana. The kana character string code part 3 of the kana character string dictionary means 2 is composed of a kana code 16 and a kana character string 17, and the kana character string code part 4 is composed of a character term code 18 and a character term 19. Input means 1
When a kana character string based on a code such as JIS is input from , the kana character code section 3 of the character dictionary means 2 is searched for the corresponding kana character code string, and the kana character code string is inputted. The corresponding terminology is included in the terminology code part 4.
The code and its script term (human-readable Japanese text) are sent to the kana script term conversion means 5 to be converted into a script term code. In addition, the script terms (human-readable Japanese sentences) are used for display purposes, etc.

Next, the operation of this embodiment will be explained.

[0018] In the usage term dictionary means 2, the kana readings of usage terms, which are combinations of character strings such as Japanese kanji, are sorted in alphabetical order in advance, and the kana readings of the usage terms are sorted in alphabetical order. Script terms for character strings such as kanji are supported, part 1
A 2-byte code is attached to each script term.

The character string of kana inputted from the input means 1 is sent to the kana font/term conversion means 5. The kana-script term conversion means 5 refers to the script-term dictionary means 2, searches for a term corresponding to the input kana character string, and sends the 2-byte kana-script term code to the kana-script term conversion means 5. send out. At this time, the operator decides if there is a homophone or if this term is appropriate. The determined 2-byte code is sent to the storage means 6 from the kana-ji terminology conversion means 5.
Store in. Thereafter, processing such as editing, output, storage, and transfer will be performed using this code system.

FIG. 3 is an example of the compression result 21 after processing the character string 20 of the JIS 2 byte code. This example shows that the 28-byte code has been reduced to 16 bytes and compressed to 0.57.

[0021] Although this example is an example of a dictionary of usage terms, it is expanded to include a general dictionary, and for more than 65,000 terms, the coding system is changed to 17 bits or 18 bits for each term. This can be addressed by increasing the number of

[0022] In this way, in this embodiment, kana, alphanumeric characters,
Focusing on the input means for inputting characters such as symbols and the words (script terms) that are usually used, which are combinations of character strings such as Japanese kanji, the pronunciation of the kana of the script terms is arranged in alphabetical order. Sort the kana pronunciation of the usage term and the usage term of the character string such as kanji, and input from the usage term dictionary means and the input means, which assigns a 2-byte code to each usage term. By providing a kana-ji terminology converting means for directly converting the converted kana characters into a 2-byte code of a kanji-term by referring to a kanji-term dictionary means, and a storage means for storing the 2-byte code as a result of the conversion, Compress character data.

[0023]

[Effects of the Invention] As explained above, the character code data compression method of the present invention directly expresses the code (sequence) of the input kana characters (sequence) using two bytes of the script term. Compared to the variable length code in the example, processing is simpler, and since there is no kana-kanji conversion or character code conversion, processing is simpler and can be processed in a shorter time. In addition, since 65,000 terms (in the case of 2 bytes) can be used as script terms, it can be used as a dictionary of script terms.
Since the amount of data is reduced as a result of compression, processing and transfer speeds are increased, storage capacity is reduced, and data transfer time can be shortened even when communicating to remote locations.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram showing one embodiment of the present invention.

FIG. 2 is a diagram for explaining the character and term dictionary in the character and term dictionary means of the embodiment of FIG. 1;

FIG. 3 is a diagram showing an example of compression conversion according to the embodiment of FIG. 1;

FIG. 4 is a functional block diagram showing an example of a conventional character code data compression method.

[Explanation of symbols]

1 Input means 2. Term dictionary means 3 Kana character string code part 4. Term code section 5. Kana-ji terminology conversion means 6 Memory means 7 Kana-Kanji conversion dictionary 8 Kana-kanji conversion means 9 Character code dictionary 10 Character code conversion means 11 Character code storage means 12 String (word) code dictionary 13 String (word) code part 14 Word character code string 15 Word code conversion means

Claims (1)

[Claims] Claim 1: A character code data compression method for compressing Japanese character code data, comprising: an input means for inputting kana characters; A script term dictionary means which sorts the script terms in order, matches the pronunciation of the kana of the script term with the script term of the character string, and attaches a 2-byte code to each script term, and input means input from the input unit. a kana character term conversion means for directly converting kana characters into a 2-byte code of a character term by referring to a character term dictionary means; and a storage means for storing a 2-byte code as a result of conversion by the kana character term conversion means; A compression method for character code data, characterized by having the following.