JPH07105194A - Japanese syllabary-to-chinese character converting method - Google Patents

Abstract

PURPOSE:To provide a KANA(Japanese syllabary)-KANJI(Chinese character) converting method having a method which reduces trouble in data exchange between different kinds of equipment. CONSTITUTION:In a code decision stage, a KANA-KANJI conversion dictionary is referred to for a character string to be converted to decide whether or not there are at least two different types to which the same code is assigned among type codes specifying types extracted as character candidates and, when the presence is cleared up, a desired different type is selected between the at least two different types specified with the type codes in a different type selection stage, and then a different type code specifying the selected different type is generated in a code generation stage.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion method for performing kana-kanji conversion processing on a kana character string.

[0002]

2. Description of the Related Art Conventionally, in a system for handling Japanese kanji, with the spread of digital computers, a unique code is assigned to each type of kanji, and data can be exchanged between different models by referring to the code. Was being done. Further, as the unique code, JI
A JIS code kanji table based on a code system commonly known as an S code is widely used. This JIS code kanji table, like the common kanji table, is arranged based on the social conventions of the times and has been revised several times to date.

Further, the fonts have been changing with the times, and among the fonts introduced from China since ancient times, they are now used only for proper names such as personal names and place names, and in the case of other ordinary texts. There are many different typefaces, which are so-called new and old typefaces, in which changed fonts are used. Furthermore, in order to distinguish the fonts, regular characters, abbreviations,
It is sometimes called slang, and it seems that they are sometimes confused with each other, but when trying to clarify the definition of terms, the cultural element of kanji becomes stronger, and it deviates largely from the main point of this paper. Therefore, the terms used here are to be defined in accordance with social norms.

In the JIS code Chinese character table described above, some fonts are included in only one of the old JIS code Chinese character table and the new JIS code Chinese character table.
This includes, for example, the characters shown in FIG. 7, but these are treated as equivalent values in the JIS standard.
The same JIS code is to be assigned.
Also, regarding personal names, the computerization of family register work has led to "October 20, 1990, Ministry of Justice, Minji 5200".
No., Citizen Bureau Director's Notice ”shows uncorrected slang and abbreviations. For example, this is the case as shown in FIG. Many of these fonts are not included in the JIS code kanji table.

By the way, in ordinary sentences, the use of characters should be based on the cultural background of the user, and if there is a choice, it will be used according to each preference. However, in place names and personal names, the stronger the elements of the official document, the more the defined typeface itself must be used. Therefore, conventionally, when there are a plurality of variants for one Chinese character as shown in FIG. 7, in order to distinguish them, one code is assigned a code in the JIS code table and the other To
The code of the so-called external character area was assigned.

[0006]

However, in the conventional system for handling Japanese Kanji characters as described above, there is no particular regulation on how to allocate codes in the external character area, and the manufacturer of the system is left to the discretion. Therefore, different fonts may be assigned to the same code between different models, or the font may not be defined, which is an obstacle to data exchange.

The present invention has been made in view of the above-mentioned problems, and an object of the present invention is to provide a data conversion method having a method for reducing obstacles in data exchange between different models.

[0008]

In order to achieve this object, a kana-kanji conversion method of the present invention refers to a kana-kanji conversion dictionary for a kana character string to be converted, and specifies a character style extracted as a character candidate. Designated by a code determination step that determines whether or not there is a character code assigned the same code to at least two variant characters, and a font code whose existence is determined by the code determination step A variant character selecting step of selecting a desired variant character from at least two or more variant characters, and a code generating step of generating a variant character code designating the variant character selected by the variant character selecting step. have.

[0009]

According to the kana-kanji conversion method of the present invention having the above-mentioned structure, the kana-kanji conversion dictionary is referred to for the kana-character string to be converted in the code determination step, and the kana-kanji character code specified as a character candidate , It is determined whether or not there is at least two variant characters to which the same code is assigned, and if it is found, at least two or more specified by the variant code in the variant character selection stage. A desired variant character is selected from among the variant characters, and then a variant character code designating the selected variant character is generated at the code generation stage.

[0010]

Embodiments of the present invention will be described below with reference to the drawings.

As shown in FIG. 2, a general computer system, regardless of whether it is a stand-alone type or a connection type, has elements such as a CPU 1, a ROM 2, a RAM 3, a keyboard 4 and a CRT 5 as a basic configuration. Stores various programs for executing a series of kana-kanji conversion processing described in detail below.

Then, the CPU 1 executes a predetermined processing operation in accordance with various programs stored in the ROM 2 so that the data input from the keyboard 4 is CRT.
5 can be displayed.

Depending on the operating system, some or all of the programs stored in an external storage device (not shown) may be loaded on the RAM 3 to cause the CPU 1 to perform a predetermined operation. In the embodiments, the operation of the program will be mainly described, so that the existence thereof does not matter.

Next, the flow of kana-kanji conversion processing in the first embodiment of the present invention will be described with reference to FIG. First, the kana character string shown in FIG. 3 is input from the keyboard 4, and after processes such as kana division and morphological analysis are repeated,
When trying to select the candidate character of "taka", the candidate character having the reading of "taka" is presented to the user on the screen of the CRT 5 as shown in FIG. Kanji is selected.

Next, ON / O of the variant character presence flag associated with the character code of the Chinese character selected in S12.
The FF is judged. Here, instead of providing the variant character existence flag, the kana-kanji conversion dictionary may be re-searched to determine whether or not the variant character is included in the character code. Then, if the variant character existence flag is OFF, that is, if it is determined that there is no variant character, a character type code designating the character type is issued in S16, and the process ends.

Next, the operation when the variant character presence flag is ON, that is, when it is determined that a variant character is present, will be described. Among the candidate characters shown in FIG. This corresponds to the case where the Kanji with the number of is selected.

The above 1. By selecting the candidate character of, the candidate character of the variant character is displayed in S13 as shown in FIG. Then, in S14, the user selects a particular Kanji by pressing the key, and then in S15,
A glyph code and a glyph code designating the glyph of the kanji is issued, and the process ends.

In the above process, for example, at S11, a candidate character including a variant character as shown in FIG. 6 may be presented to the user to prompt the selection operation.
The flow of the operation is shown in FIG. 9 as the second embodiment of the present invention. Here, the processes of S13 and S14 shown in FIG. 1 are omitted, and the processes of S15 and S16 are the same as those shown in FIG.

Next, a third embodiment of the present invention will be described with reference to FIG. In this case, the processing of S11 is the same as the processing in the first embodiment shown in FIG. 1, but after that processing, the font code of the selected font is issued in S17. Then, in S12, the O of the variant character presence flag associated with the character code of the selected Chinese character is set to O.
N / OFF judgment is made. Here, for example, instead of providing the variant character presence flag, the kana-kanji conversion dictionary may be searched again to determine whether or not the variant character is included in the character code. After that, when it is determined that there is no variant character, the processing ends with that.

If it is determined that a variant character exists, the processes in S13 and S14 are the same as those in the first embodiment, and thereafter, in S18, the variant character code designating the selected character is designated. The process ends with the issue.

Further, for example, as a fourth embodiment of the present invention, it is configured so that it can be set whether or not to issue a variant code, and the setting state is set to ON for the variant character setting flag.
Alternatively, the determination may be made between S11 and S12 as shown in S101 of FIG. 11, and whether or not to issue the variant character code may be determined based on the determination result.

[0022]

As is clear from the above description,
According to the kana-kanji conversion method of the present invention, it is possible to make a device excellent in compatibility with multiple models by reducing obstacles in data exchange between different models, and to display or print fonts. Since it is possible to increase the number of types, it becomes easier to create documents and the like.

[Brief description of drawings]

FIG. 1 is a flowchart showing a first embodiment of a kana-kanji conversion method of the present invention.

FIG. 2 is a block diagram showing a configuration of a general computer system.

FIG. 3 is a diagram showing an example of a kana character string on which kana-kanji conversion is performed.

FIG. 4 is a diagram showing a display example of candidate characters having a pronunciation of “taka”.

FIG. 5 is a diagram showing a display example of candidate characters for variant characters of “Taka”.

FIG. 6 is a diagram showing a display example of candidate characters including variant characters having the pronunciation “taka”.

FIG. 7 is a diagram showing an example of fonts of variant characters.

FIG. 8 is a diagram showing an example of fonts of variant characters.

FIG. 9 is a flowchart showing the operation of the second embodiment of the present invention.

FIG. 10 is a flowchart showing the operation of the third embodiment of the present invention.

FIG. 11 is a flowchart showing the operation of the fourth embodiment of the present invention.

[Explanation of reference numerals] 1 CPU 2 ROM 3 RAM 4 keyboard 5 CRT

Claims (1)

[Claims] 1. A kana-kanji conversion method for performing kana-kanji conversion processing on a kana-character string, by referring to a kana-kanji conversion dictionary for the kana-character string to be converted and designating a character style code that specifies a character style extracted as a character candidate. There is a code determination step for determining whether or not there is at least two variant characters to which the same code is assigned, and at least a font code whose existence is determined by the code determination step is designated by at least It has a variant selecting step of selecting a desired variant from two or more variants, and a code generating step of generating a variant code designating the variant selected by the variant selecting step. A kana-kanji conversion method characterized by.