JPS62267857A - Word processor - Google Patents

Abstract

PURPOSE:To reduce the memory capacity by storing even such additional information as the punctuation information, the attribute information, etc., into the character codes. CONSTITUTION:A hetero-font dictionary 5 sets even the punctuation information and the duplication information into character codes for storage. A storing device 6 reads out the contents of the dictionary 5 and converts them into the normal character codes to deliver them to a CPU2. When a heater-font is designated for a specific character, the character code are read out of a dictionary memory and restored by the device 6. Then these restored codes are compared with the code of the specific character. If the coincidence is obtained between both codes, the hetero-font is decided for the specific character based on the punctuation information and the duplication information. While the next character code is read out of the dictionary memory and restored. Then this restored character code is compared again with the specific character code.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field The present invention relates to an improvement in the storage structure of character codes stored in a dictionary of a word processor.

<Prior art> In general, in a kana-kanji conversion device, for example, after converting a person's name from kana to kanji, after converting "sawa" to "zawa", "a" to "a", etc.
There may be cases where it is necessary to change ``saka'' to ``saka''.

Also, among the words in general sentences, ``to'', ``tou'', and ``gei''
There are cases where the user wants to change the words depending on their preference, such as ``ba'' and ``ba'', ``hook'' and ``hook'', etc.

However, if words containing Chinese characters with different fonts are registered in a dictionary as one word for each font, the memory capacity required to store the dictionary becomes enormous.

Conventionally, therefore, a character substitution table as shown in FIG. 11 has been provided in order to reduce the memory capacity for a variant of an old font corresponding to a certain character. However, in such a storage configuration, only one variant character corresponds to a certain character, and the search for the character can only be performed in one direction as shown by the arrow in the figure. In other words, it is possible to search from ``sawa'' to ``zawa'', but it is not possible to search from ``zawa'' to ``sawa''. Since the table for "sawa" must also be provided separately, there is a problem in that the data capacity is twice as large.

Therefore, a storage configuration as shown in FIG. 10 was devised.

That is, along with the character code (c), delimiter information (a) and attribute information (b) are stored for each character. These delimiter information and attribute information indicate delimiters between character groups, and the delimiter information is "1" if a new character group starts from the character concerned, and "0" otherwise. Further, the attribute information is "1" if the next character is included in the same character group, and is "0" if the next character is included in the characters of a different group. Therefore, in Figure 10, "A" and "A" are in the same group, "Saka" and "Saka" are in the same group, and "Saki", "Sai", and "Gosuke" are in the same group. It is shown that.

With this configuration, it is possible to search from ``A'' to ``OX'' and from ``A'' to ``A'' at the same time, so compared to the storage configuration shown in Figure 11, the search volume is the same. This can be achieved with less memory content.

However, even in the storage configuration shown in Fig. 10, a large storage capacity is required because it is necessary to store delimiter information in addition to A rather than storing character codes, and A rather than attribute information. It has the problem that.

<Object of the invention> The present invention has been made in view of the above-mentioned problems.
It is an object of the present invention to provide a word processor having a dictionary having a storage structure in which additional information such as delimiter information and attribute information is also incorporated and stored in character codes.

<Example> A detailed explanation will be given below based on the drawings.

FIG. 1 is a block diagram of a word processor according to the present invention.
is the keyboard for entering characters and commands.
2 is a CPU that edits the side legs and text of the entire device.
, 3 is a text buffer for storing edited texts, and 4 is a display device.

Reference numeral 5 denotes a variant character dictionary with a storage structure in which delimiter information and duplicate information are also incorporated and stored in the character code, and 6 reads out the contents of the variant character dictionary 5, converts it into a normal character code, and outputs it to the CPU 2. It is a restoration device.

9 is a normal conversion dictionary that stores kanji or sentences containing kanji that correspond to kana characters.

FIG. 2 is a diagram showing the storage structure of the dictionary of the word processor according to the present invention, and as is clear from the figure, it has only the character code A7.

The configuration in A will be described below based on this character code.

First, in JIsc6226, character codes for Japanese characters are assigned within the range from r21-21J to r74-24J (hatched area 8 in FIG. 3).

These character codes are expressed in binary numbers and stored in A from the character code. Figure 4 shows the character code r21-21.
J, r4F-64J, r75-7EJ, "74-24
J is expressed as a binary number.

Here, the common thing among the four codes is that the 8th bit and the 16th bit are always "0".

This means that "21-2" is assigned Japanese characters.
1'' to r74-24J.

That is, in the range from r21-21J to "74-24", the 8th bit and the 16th bit are always "0".

Therefore, the duplication information and delimiter information are stored in the 8th bit and the 16th bit 7), which are always "0", respectively, and the duplication information and delimiter 9 information are incorporated into the character code. By adopting such a configuration, the storage capacity can be reduced, and as will be described later, when character codes are consecutive, two characters can be expressed with one character code.

The delimiter information indicates the delimiter of a new character group, and is "1" if the character is the first character of the character group, and is "0" otherwise. Duplicate information indicates whether character data is stored redundantly in the character code, and if the character code contains two characters, it will be "1", and if it contains only one character, it will be "1". 0”.

This will be explained below using a specific example. First, to explain the case of the character group "A" and "Ω", the J of "A" and "Dot" is
The binary representation of the IS code is as shown in Figure 5a).

Comparing the JIS codes of “A” and “A”, there are two JIS codes.
Since the S code is not continuous, the 8th bit of ``A'' is assigned ``0'', which means there are no duplicates, and the 16th bit is assigned ``1'', which means the separation of character groups.
”, and similarly, “0” and 1 are assigned to the 8th pitch of “A”.
Assign "0" to the 6th bit and store it in the dictionary. The character code at this time is shown in FIG. 5(b).

Next, the case of the character group "zaka" and "saka" will be explained.

The binary representation of the JIC codes for "zaka" and "saka" is as shown in FIG. 6(a).

Comparing the JIS codes of "zaka" and "saka", the JIS codes of these two characters are consecutive, so the two characters are stored in one character code by overlapping them. Therefore, the 8th bit of ``saka'' is assigned ``1'', which means a duplicate meaning, and the 16th bit is assigned ``1'', which means a character group separation, and these are stored in the dictionary. The character code at this time is shown in FIG. 6 (b>).The character code shown stores the character code of the partner of ``zaka'' and ``saka''.

Finally, the case of the character groups ``Saki'', ``Sai'', and ``Ishirei'' will be explained. The binary representations of the JIS codes for "Saki", "Sai", and "Saki" are as shown in FIG. 7(a)K.

Comparing the JIS codes of "Saki", "Sai", and "Katsura", the JIS codes of these three characters are connected, so they are combined into one character code. Therefore, the 8th bit of ``zaka'' is assigned ``1'', which means a duplicate meaning, and the 16th bit is assigned ``1'', which means a character group separation, and these are stored in the dictionary.

Note that this embodiment is configured to focus on one character code and store up to two character codes, so the third variant character "Ji J te" is stored together with "Saki" and "Sai". Since it cannot be expressed with one character code, it is necessary to separately assign "0" to the 8th bit and "0" to the 16th bit and store them at the next address.

The character codes at this time are shown in Figure 7 (b), where (a) is the character code that stores ``saki'' and ``sai'' in duplicate, and (b) is the character code that stores ``bo''. The code is 0. Next, the search operation for restoring the compressed character code of the variant character dictionary 5 to the JIS character code will be explained using the flowchart '4 of FIG.

After displaying the character on the display by inputting the character that is the source of the desired variant character, for example, operate the variant conversion key to instruct the search for the variant character (SL
).

Based on the search instruction, the character code of the variant character is first registered in the restoration device 6 (82), and then the character code stored in the first address of the character code stored in the variant character dictionary 5 is called up and set. (S3).

Then, the character code is searched (S4), and if the 16th bit is set, it is reset (S5).

Next, determine whether the 8th bit is set (S6).
If set, it is reset (S7). Then, compare this rewritten character code (character code restored to JIS code) and the character code of the variant character registered in the restoration device (S8). If they match, the lower code of this character code is set to 1. is added (S9), and the character with this added character code is displayed as the corresponding variant character candidate, replacing it with the variant character displayed on the display device 4 (810
).

Then, it is determined whether the displayed variant character candidate is the desired variant character (Sl 1), and if it is the desired variant character, the search is terminated (S12). By operating the variant character conversion key, the displayed variant character candidate that is not the desired variant character is used as a new variant character to perform searches from S2 onwards.

If the result of the comparison in S8 is a mismatch, 1 is added to the lower code of the character code (S13). In other words, a search is performed for the next consecutive character code. Then, it is compared again with the character code of the variant character registered in the restoration device (314). If the 8th pit is not set in the previous ES6, proceed directly to 314. If the result of comparison matches, set the address of the next character code in cents 515) and write the character code stored at this address. Search for (S□16). Then, determine whether the 16th bit of this character code is set (517), and if it is set, set the address immediately before this character code (517).
18), the character code stored at this address is searched (S19).

Next, it is determined whether the 16th bit of this character code is set (S20), and if it is not set, SL8 is executed until the set character code is searched.
The operations from ~S20 are repeated, and when it is determined that the 16th focus is the character code set, the 8th and 16th bits are reset (521), the process proceeds to 810, and the same operations as described above are performed. . Note that if the 16th bit is not set in step 817, the process directly advances to S21.

As a result of the comparison in step 314, if the searched character code and the character code of the character to be variant registered in the restoration device do not match, it is determined whether the searched character code is the final address ( S22), if it is the final address, it is determined that the desired variant character does not exist (S23) o
If it is not the final address, set the character code of the next address (S24), and then search from S4 onwards.
FIG. 9 is a diagram showing the order of characters searched by operating as described above, (a) shows the search order of the character group shown in FIG. 2, and (b) This figure shows a search group when there are seven variant characters in one character group.

In the above-mentioned embodiments, kanji such as old characters are used as variant characters, but the invention is not limited to this. For example, ``■'', ``(1) J, rI'' are used as variant characters for ``1'' in numbers.
J. ``Of course, it is also possible to make ij into one character group, or to make similar symbols into one character group.

Furthermore, this example is always "0" in JISC6226.
Delimiter information and duplicate information are written in the 8th and 16th bits, but it is also possible to write other information in the 8th and 16th bits, and by further limiting the range of character codes, normal pressure " It is also possible to write more information by increasing the number of parts that are "0" and the parts that are always "1". Because it is stored in the code, there is no need to separately store delimiter information, duplicate information, etc., and multiple characters in a variant character relationship with consecutive character codes can be represented by one character code. The amount of information can be compressed and dictionary memory can be used effectively.

[Brief explanation of drawings]

Fig. 1 is a block diagram of a word processor according to an embodiment of the present invention, Fig. 2 is a diagram showing the dictionary storage structure of the word processor, Fig. 3 is a diagram showing the address range of JISC6226, and Fig. 4 is a character code Figures 5, 6, and 7 are diagrams showing specific examples of comparisons between normal character codes and character codes containing information. FIG. 8 is a flowchart showing the search operation of the same word processor, FIG. 9 is a chart showing the search order of characters, and FIGS. 10 and 11 are diagrams showing the storage structure of the dictionary of the conventional word processor. 1: Keyboard, 5: Dictionary of variant characters, 6: Restoration device, 7 A from two-letter code. Agent: Patent attorney Takeshi Sugiyama (and 1 other person) Figure 2. )(b) Figure 9, Figure 10

Claims (1)

[Claims] 1. Write delimiter information indicating the delimitation of character groups in the first specific bit of a character code predefined by JIS standards, etc., and write multiple character codes at one address in the second specific bit. A dictionary memory in which a specific variant character group is registered with a character code that has been transformed by writing duplicate information indicating whether it has been memorized, and the transformed character code registered in the dictionary are called up and the character is a restoration device that detects the first and second specific bits of the code and restores the original character code system; when a variant character is designated for a specific character, the character code is read from the dictionary memory and restored. The device restores the character code and compares the restored character code with the character code of the specific character, and if they match, determines a variant character corresponding to the specific character based on the delimiter information and the duplication information. However, in the case of a mismatch, the next character code is read out from the dictionary memory and restored, and the restored character code and the character code of the specific character are compared again.