JPS62168263A - Kana-kanji mutual converter - Google Patents

Abstract

PURPOSE:To attain easy KANA(Japanese syllabary)/KANJI(Chinese characters) conversion and vice versa by providing a mutual converting function to a KANA /KANJI converter and therefore deciding whether characters to be converted are equal to KANJI or KANA when the start is instructed for conversion. CONSTITUTION:A document including characters or character strings to be converted is displayed at a display part 16 and the character string to be converted is designated in the document. Then a conversion key of an input part 11 is operated and conversion processing is executed under the control of a CPU 10. It is decided whether the characters or character strings designated by a cursor and to be converted are equal to KANA or KANJI after operation of the conversion key. If KANA is confirmed for the characters to be converted, '1' is set to a KANA/KANJI deciding flag F of a working RAM 20 to show confirmation of KANA characters prior to the KANA/KANJI conversion. Thus the converting process is carried out. While '0' is set to the flag F to show KANJI when the KANJI are decided for characters to be converted.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field 1] The present invention relates to a kana-kanji mutual conversion device in a device having a document processing function such as a Japanese word processor.

[Summary of the Invention J This invention provides a device having a document processing function that has a mutual conversion function between kana and kanji, and when an instruction to start conversion is given, whether the character to be converted is a kanji or a kana If it is a kanji, it is converted to kana, and if it is kana, it is converted to kanji.This makes it possible to convert kana to kanji and kanji to kana with simple operations. be done.

[Prior Art] Conventionally, document processing devices such as Japanese word processors have a conversion mechanism that converts kana to kanji, and by inputting the reading of kanji in kana and specifying kana-kanji conversion, The conversion mechanism had obtained the kanji corresponding to the reading to be converted.

[Problems to be Solved by the Invention] As described above, in the past, it was possible to convert kana to kanji, but on the other hand, it was impossible to convert kanji to kana. Therefore, for example, when a document consisting of a document file is called up and it is desired to output the pronunciation of a kanji or a compound word, or when a specific type of kanji consisting of a kanji is desired to be output back to kana, conversion is not possible.

The present invention provides a kana-kanji mutual conversion device that can easily convert between kana and kanji characters with a simple operation for any character or character string in an input document.

[Means for solving problems] FIG. 1 is a functional block diagram of the present invention.

In FIG. 1, reference numeral 1 indicates a conversion start specifying means for specifying the start of conversion; 2 indicates a character type determining means for discriminating the character type of a character to be converted when conversion start is specified by the conversion start specifying means 1; and 3 4 is a kana-kanji conversion means that converts the corresponding kana into a kanji when the character type discrimination means 2 determines that the character type to be converted is a kana, and 4 indicates that the character type to be converted is a kanji by the character type discrimination means 2. This is a kanji-kana conversion means that converts the corresponding kanji into kana when it is determined.

[Operation] As shown in FIG.
When the start of conversion is specified, the character type determination means 2 determines the character type of the character to be converted, and if the character type is kana, it activates the kana-kanji conversion means 3 to convert the kana to kanji, and , if it is a kanji, the kanji-kana conversion means 4 is activated to convert the kanji into a kana.

By having such a mutual conversion function between kana and kanji, it is possible to convert not only kana to kanji but also kanji to kana with simple operations.

[Example] (1), Configuration of the example FIG. 2 is a block diagram showing an embodiment of the present invention.

In the figure, reference numeral 10 is a CPU that controls the entire device and performs various document processing.Here, according to the conversion specification associated with the conversion key operation described later, the character type determination process of the character to be converted is executed. Selectively execute kanji conversion processing or kanji-kana conversion processing.

Reference numeral 11 denotes an input unit equipped with kana character keys for document input and various function keys. A "next candidate" key, a "conversion" key for specifying mutual conversion between kana and kanji, and the like are provided.

12 to 15 are dictionaries and tables referred to by the CPU 10 when mutually converting kana and kanji. Of these, 12 is a kana index table for searching the parent character (first kanji) from a kana character string to be converted during kana-kanji conversion, and 13 is this kana index table 1.
2 is a kanji index table for searching the area pointer address in the conversion dictionary for the parent character searched for; 14 is a conversion dictionary memory in which parent characters and their pronunciations are stored in correspondence; 15 is a prefix 3! i, particles including suffixes, auxiliary verbs, etc. are stored in the attached word dictionary memory.

Reference numeral 16 denotes a display section for displaying input and edited documents, and during mutual conversion between kana and kanji, the character string to be converted is clearly displayed, and the converted characters or character strings are also displayed.

17 is a printing unit that prints out the document.

Reference numeral 18 denotes a document memory for storing input document information or document information to be edited. 19 is a character generator, and kana and dictionary search as shown in Figure 3.
This is a ROM that stores various control programs including kanji mutual conversion processing.

20 is a working RAM for the CPU 10, and for mutual conversion processing between kana and kanji, it stores a parent character pointer, kanji pointer, reading pointer, kanji buffer, reading buffer? , a kana index table pointer, and a kana/kanji determination flag F (not shown).

FIG. 3 is a flowchart showing the process flow of mutual conversion between kana and kanji in response to the operation of the "conversion" key in the above embodiment.

FIG. 4 is a diagram showing the index order of a table and dictionary and a specific character search example for explaining the conversion processing operation in the above embodiment.

FIGS. 5(a) to 5(Q) are diagrams each showing an example of character display for each conversion process step in the above embodiment.

(2) Effect of the embodiment [Conversion from kana to kanji] If the document containing the character or character string to be converted is the representation part 16
is displayed, and after the character string to be converted in the document is specified with the cursor, when the ``Conversion J'' key on the input section 11 is operated, the conversion process shown in FIG. 3 is performed under the control of the CP IJ 10. executed.

When the "conversion" key is operated, it is first determined whether the character or character string to be converted specified by the cursor is a kana or a kanji (step 81 in FIG. 3).

Here, if it is determined that the character to be converted is a kana character, the kana/kanji determination flag F in the working RAM 20 is set to 1'', which indicates that it is a kana character, prior to the kana-kanji conversion process. (Step 82 in Figure 3).

Then, the kana index table 12 is indexed based on the character code of the kana character or kana character string to be converted, and the parent character (the first kanji character) of the kanji corresponding to the reading expressed by the kana to be converted is code) (step 83 in FIG. 3).

Next, the kanji index table 13 is indexed based on the parent character retrieved from the kana index table 12, and the address (parent character address) on the conversion dictionary memory 14 where the parent character is stored is obtained (base character address). Figure 3 step S4).

This parent character address is stored in the parent character pointer in the working RAM 20. Additionally, in the WA where there is a kanji attached to the parent character (i.e. when the conversion target is a compound word), a work RAM is used to specify the address of the annexed kanji.
The address indicating the storage position of the first candidate kanji that forms a compound word with the above parent character, which is obtained by adding a specific value to the above parent character, is set as the initial address to the kanji pointer in 20, and the address indicating the storage position of the first candidate kanji that forms a compound word with the above parent character is set as the initial address, and The address indicating the storage location of the first reading of the kanji is set as the initial address in the reading pointer that specifies the address of the reading of the kanji.

Next, a specific value is added to the parent character address stored in the parent character pointer to obtain the address that stores the first pronunciation of the parent character, and this address and the address of the pronunciation stored in the pronunciation pointer are obtained. Based on this, the conversion dictionary memory 14 is indexed, and the pronunciations including the parent character and its accompanying kanji are successively displayed (step 85 in FIG. 3).

The pronunciation read out from the conversion dictionary memory 14 is compared with the character string (or character) to be converted specified by the cursor (step 86 in FIG. 3).

Here, if the readings match, the conversion dictionary memory 1
4, the kanji (e.g., idioms) and their pronunciations corresponding to each reading are read out and stored in the kanji buffer and reading buffer in the working RAM 20, respectively, and then the conversion processing contents (i.e., the kanji (e.g., idioms) and (pronunciation) is displayed on the display section 16 (steps 87 and 88 in Figure 3).
.

Also, if a match cannot be found in the comparison between the pronunciation read out from the conversion dictionary memory 14 and the character string (or character) to be converted (step 86 in FIG. 3), the working RAM
The reading pointer in 20 is updated, and the updated reading is compared again with the character string (or character) to be converted (steps 35, 86, 818, . . . in FIG. 3).
819). Furthermore, at this time, once the address of the reading pointer has gone through the readings of the kanji attached to the parent character, the kana index table pointer in the working RAM 20 is updated, and the same comparison as above is performed for the next parent character. Verification is performed (steps 85, 86, 818, 819, 820 in FIG. 3).

Also, when the "Next Candidate" key is operated with the converted kanji displayed, it is confirmed from the contents of the kana/kanji determination flag F that the conversion mode is kana-kanji conversion, and then
The same pointer update as above, and the same comparison and verification as above for the updated pronunciation are performed (third
Figure steps S5, S6, 817-520).

In this way, the pronunciations of the kanji written in kana are sequentially converted into kanji.

The indexing procedure for each table and dictionary at this time is shown in FIG. 4, and examples of the search are shown in FIGS. 5(a) to (C).

[Conversion from Kanji to Kana] A sentence containing kanji to be converted is displayed on the display section 16,
After the kanji or kanji character string (for example, a compound word) to be converted in the document is specified with the cursor, when the "conversion" key of the input unit 11 is operated, the process shown in FIG. 3 under the control of the CPU 10 is performed. The conversion process shown in is executed.

When the "convert" key is operated, it is first determined whether the character or character string to be converted specified by the cursor is a kana or a kanji (step 81 in FIG. 3).

Here, if it is determined that the conversion target character is a kanji, the work RAM 20 is used prior to the kanji-kana conversion process.
"OII", which indicates that the character is a kanji character, is set in the kana/kanji determination flag F (step 89 in FIG. 3).
.

Then, the parent character of the kanji character string (for example, a compound word) to be converted is searched, the kanji index table 13 is indexed based on the searched parent character, and the parent character is searched for in the conversion dictionary memory 14 in which the parent character is stored. Obtain the address (M character address) (step S10.811 in FIG. 3).

This parent character address is stored in the parent character pointer in the working RAM 20. Furthermore, when there are kanji attached to the parent character (i.e. when the conversion target is a compound word),
Working RAM 2 to specify the address of the accompanying kanji
The initial address of the kanji pointer in 0 is set to the address indicating the storage location of the first candidate kanji that forms a compound word with the above parent character, which is obtained by adding a specific value to the above parent character, and that kanji is The address indicating the storage location of the first reading of the kanji is set as the initial address in the reading pointer that specifies the address of the reading of the kanji.

Next, the conversion dictionary memory 14 is indexed based on the parent character address stored in the parent character pointer and the address stored in the kanji pointer, and the corresponding kanji (for example, an idiom) is read out. Figure 3 step 512).

Next, the kanji (for example, a compound word) read from this conversion dictionary memory 14 is compared with the kanji specified as the conversion target specified by the cursor (step 513 in Fig. 3).
).

Here, if the kanji match, the reading is read out from the conversion dictionary memory 14, stored in the reading buffer in the working RAM 20, and then displayed on the display unit 1G (Fig. 3). Step 814.S8).

Furthermore, if a match cannot be found in the comparison between the kanji read from the conversion dictionary memory 14 and the kanji to be converted (step 513 in FIG. 3), the kanji pointer in the working RAM 20 is updated. , the same comparison as above is performed again for the updated kanji (step 812 in Figure 3).
~816).

Also, when the "Next Candidate" key is operated for a converted kana character string, the reading is changed after it is confirmed that the conversion mode is Kanji-Kana conversion from the contents of the Kana/Kanji determination flag F. The pointer is updated, and the pronunciation on the display unit 16 is updated (steps S17, S21, and S1 in FIG. 3).
4. Si2).

In this way, the specified kanji are converted into kana character strings according to their readings.

Examples of mutual conversion operations from kana to kanji and from kanji to kana at this time are shown in FIGS. 5(a) to (CJ).

As mentioned above, conversion from kana to kanji and conversion from kanji to kana can be specified by the common "conversion" key operation. You can convert kanji to kana corresponding to their reading.

In the above embodiment, the method of specifying the character or character string to be converted using the cursor was shown as an example, but the method is not limited to this. For example, the method of specifying the entire display page or the entire specified document It is also possible to sequentially perform the above-mentioned conversion processing on the conversion target.

[Effects of the Invention] As detailed above, according to the kana-kanji mutual conversion device of the present invention, in a device having a sentence 1 processing function, the device has a mutual conversion function between kana and kanji, and the start of conversion is instructed. When
By determining whether the character to be converted is a kanji or a kana, and converting a kanji to a kana and a kana to a kanji, it is possible to convert from kana to kanji and from kanji to kanji. Conversion to kana is achieved with a simple operation.

[BRIEF DESCRIPTION OF THE DRAWINGS] FIG. 1 is a functional block diagram of the present invention, FIG. 2 is a block diagram showing a configuration according to an embodiment of the invention, FIG. 3 is a flowchart showing the processing flow of the above embodiment, and FIG. 4 is a diagram showing the index order of a table and dictionary for explaining the conversion processing operation in the above embodiment, and a specific character search example thereof, and FIGS. It is a diagram showing an example of character display for each conversion process step. 10... CPU, 11... Input unit, 12... Kana index table, 13... Kanji index table, 4...
Conversion dictionary memory, 15... Associated word dictionary memory, 16.
...Display section, 11...Printing section, 18...Document memory, 19...ROM, 20...Working RAM.

Claims (1)

[Claims] A means for specifying the start of conversion, a means for determining the character type of a character to be converted according to the specification of the means, and a means for converting the same kana character into a kanji when the character to be converted is determined to be a kana by the means. 1. A kana-kanji mutual conversion device comprising: means for converting a kanji into a kana character when it is determined that the character to be converted is a kanji.