JPS62189569A - Kanji/kana converting device - Google Patents

Abstract

PURPOSE:To expand the using scope of a KANJI (Chinese character) KANA (Japanese syllabary) converting device by applying the function to convert KANJI and KANA. CONSTITUTION:The device is equipped with a converting dictionary memory means 01, a memory position information memory means 02, a means 03 to read memory position information and a means to retrieve KANA to be read corresponding to the KANJI or an idiom of the converting object. The reading means 03 reads the memory position information to the KANJI and the idiom of the converting object from the memory position information memory means 02. A retrieving means 4 retrieves the KANA to be read corresponding to the KANJI or the idiom of the converting object from the converting dictionary memory means 01 designated by the read memory position information.

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] The present invention relates to a device for converting kanji to kana, and relates to a technical field applied to Japanese word processors and the like.

[Summary of the Invention] The present invention is a device for processing Japanese document data, and by adding a function to convert kanji to kana,
This is a device that allows you to expand the usage savings.

[Prior Art] Conventional Japanese GL word book processors are configured to convert kana to kanji, but there is no one that converts kanji to kana.

[Problems to be Solved by the Invention] With conventional devices, there are many cases where it is desired to output the readings of kanji or compound words at any time in a document that is already stored in the storage medium as a sentence containing kana and kanji. However, this was not possible with conventional equipment.

Furthermore, conventional kana-kanji conversion dictionaries are designed to convert kana to kanji, and are unsuitable for converting kanji to kana.

[Means for Solving the Problems] FIG. 1 is a block diagram of the present invention. 01 is a conversion dictionary storage means, 02 is a storage position information storage means, O3 is a means for reading out the storage position information, and 04 is a means for searching for a reading corresponding to a kanji or compound word to be converted.

[Operation In Figure 1, the reading means 03 reads the kanji to be converted,
Storage location information storage means 0 stores storage location information corresponding to the idiom.
The reading and searching means 04 searches the conversion dictionary storage means 01 designated by the read storage location information for the reading corresponding to the kanji or compound word to be converted.

[Embodiment] (1) Configuration FIG. 2 is a circuit configuration diagram showing an embodiment of the present invention. 1
is an input section, which includes means for inputting kana or kanji, as well as a kanji conversion/next candidate key 1a for specifying conversion of kana to kanji, and a kana conversion/next candidate key for specifying conversion of kanji to kana. It has a key 1b. 2 is CPtJ, which performs kana-kanji conversion or kanji-kana conversion by referring to the kana index table 3, the kanji index table 4, the conversion dictionary memory 5, and the adjunct word dictionary memory 6. As shown in FIG. 3, the kana-kanji search table 3 stores the parent characters of kana and idioms corresponding to this kana.

For example, the idioms corresponding to ``hanan'' are ``hongan'' and ``adaptation'', but the parent characters of this idiom, ``Vhon'' and ``han'', are stored. In this embodiment, the parent character is stored, but it is also possible to store the kana instead of the address of the parent character stored in the conversion dictionary memory 5, which will be described later, or the address where the pronunciation of the parent character is stored. It may be configured as follows. As shown in the fourth factor, Kanji index table 4 has kanji codes (in the figure, (A) (奔) (本) (translation)...
A parent character pointer (in the figure, 81... Ai, Ai +1, Ai +2...
) is memorized. As shown in FIG. 5, in the conversion dictionary memory 5, attached characters related to the parent characters "ben", "hon", "han", etc. are arranged continuously, and the readings of the parent characters and the attached characters are kanji. are sequentially arranged and stored in correspondence with each other. The same idiom with multiple readings,
For example, ``honmei'' is read as ``hanmiyo'' and ``hanmei,'' but as shown in the same figure, the same auxiliary characters and different readings can be read as ``life/myo'' and ``life/mei.'' be remembered. In addition, the parent character can be read in multiple ways, for example, ``hon'' is read as ``bon'' and ``chito,'' but as shown in the same figure, this also means that the auxiliary characters related to ``han'' and their readings are also read as ``bon.'' The attached characters related to the "original" and their pronunciations are continuously stored from the position divided by the NEXT code. Further, the search for a phrase related to the parent character is terminated at the position of the END code. The attached post-dictionary memory 6 is a memory that stores prefixes, suffixes, particles, auxiliary verbs, and the like. 7 is a document memory that stores sentences containing kana and kanji, and stores character strings to be converted or character strings resulting from conversion. 8 stores character patterns for printing and display and programs for processing operations of CPCI2;
It's OM. Reference numeral 9 denotes a RAM that stores various pointers and the like for processing operations to be described later. 10 is a display section, and 11 is a printing section.

(21 operation Figure 6 is a flowchart showing the processing operation of CPtJ2. 81 and below is a flowchart showing the operation when operating kanji conversion/next candidate key 1a@, and 82 (l and below kana conversion/next candidate key 1b is shown. A kana character string input from the input section 1 or a kana character string in the document memory 7 is displayed on the display section 10,
When the kanji conversion/next candidate key 18 is operated after specifying the kana character string to be converted with the cursor, the state of the flag F1 is detected at Sl. The flag Fs'Et and the flag F2, which will be described later, are flags that are set to O'' after the conversion result is finalized, and are stored in the RAM 9. In the first operation of the kanji conversion/next candidate key 1a, press Sl to set Fl-0. It was determined that $
The flag F1 is set to 1'' in step 2. Next, the 89-digit kana search table 3 is referred to, and the parent character of the compound word or kanji corresponding to the kana to be converted is read out. The parent character pointer corresponding to the specified parent character is read from the kanji index table 4. Next, in S5, the pronunciation corresponding to the parent character is read from the conversion dictionary memory 5 specified by this parent character pointer. The reading pointer indicating the storage location of the reading corresponding to the attached character associated with the parent character is updated.Then, the reading of the parent character and the reading of the attached character indicated by the reading pointer are combined. However, in the first process 85 from S4 to 85, only the pronunciation of the parent character is read out.In the next process 86, the pronunciation read out from the conversion dictionary memory 5 and the kana character string to be converted are compared. If there is a mismatch, the conversion dictionary memory 5 is
The process from 85 to S is repeated until the END code is detected. That is, the reading pointer is sequentially updated and compared with the character string to be converted. When the END code is detected in S7, it is detected in S8 whether or not another parent character pointer is stored in the kana search table 3, and if it is stored, the process returns to steps 84 and below. In S8, if there is no next parent character pointer and Fs - O is detected in Sg, the process ends. When Fs-1 is detected in Ss, as described later, the next homophone candidate has been specified, and in this case, the reading pointer is initially set to the position of the reading of the parent character. Then, the process returns to S5. Said S6
If a match is detected in the process, the idiom consisting of the parent character corresponding to the pronunciation or the composite character of the parent character and the attached character is read out as the converted kanji or idiom. In addition, it is determined whether the read kanji or compound words are grammatically correct or not by referring to the attached word dictionary memory 6, and grammatically incorrect words are determined.
If it is, the first character or the last character of the string to be converted is deleted or added (expanded) and the above-mentioned process below 83 is performed, but since this method is the same as before, the explanation is as follows. Omitted. Next, in step 812, the correctly converted data is written into the document memory 7, and after displaying it on the display unit 10 in step S13, Fs is set to II Ofl, and the process ends. If you wish to output other homophones of the displayed kanji or compound words, operate the kanji conversion/next candidate key 18 again.

In this case, Sl is determined to be Fs-1, and Sts is determined to be Fs
is set to ``1'', the above-mentioned processes 85 and below are performed, and the conversion dictionary memory 5 is searched for the next homophone.

Also, when converting a kanji to kana, after specifying the kanji to be converted with the cursor etc., press the Gana conversion/Next candidate key 1b.
operate. At this time, the CPLJ2 executes the processing operations from 8211 onwards in the flowchart of FIG. If the kanji to be converted consists of a compound word of 2N11 or more in S22, the first kanji is detected, and the parent character pointer corresponding to the first kanji is read from the kanji index table 4 in 32B. Next, in S24, the conversion dictionary memory 5 is designated by the parent character pointer, and a compound word in which the parent character and the accessory character attached to the parent character are combined is read out. Ancillary characters are specified using kanji pointers and are updated sequentially. Also, from S23 to 8
In the process of S24 at the first transition to 24, only the parent character kanji is read out. At 825, the kanji read from the conversion dictionary memory 5 and the kanji to be converted are compared. The pronunciation corresponding to the matched kanji in 829 is read out as a conversion result. When the kana conversion/next candidate key 1b is operated continuously, the next reading candidate is retrieved from the conversion dictionary memory 5 and output.

[Effects of the invention] As described above, according to the present invention, conversion from kanji to kana can be performed efficiently, so when applied to a Japanese word processing set, etc. The scope of its use is greatly expanded, as it allows you to convert phrases you want to add furigana to kana at any time, and it also allows you to convert phrases that are inappropriate for kanji back to kana.

[Brief explanation of drawings]

FIG. 1 is a block diagram of the present invention, FIG. 2 is a circuit configuration diagram showing an embodiment of the present invention, FIG. 3 is a configuration diagram of an ephemeral index table, FIG. 4 is a configuration diagram of a kanji index table, and FIG. 5 is a configuration diagram of a kanji index table. The figure is a block diagram of the conversion dictionary memory, and FIG. 6 is a flowchart showing the operation of the CPU 2. 1... Input unit, 2... CPU, 3... Kana index table, 4... Kanji index table, 5... Conversion dictionary memory. Shosei Kai, /, Tojio Town Seniso Kurama 4 Rainbow Figure 1 Figure 3 Figure 4

Claims (1)

[Claims] A conversion dictionary storage means for storing kanji or compound words in correspondence with their readings; a storage location information storage means for storing storage position information indicating a storage position of the conversion dictionary storage means in correspondence with kanji; and a conversion target. means for reading storage location information corresponding to a kanji character or a kanji character forming part of a compound word to be converted from the storage location information storage means, and storage in the conversion dictionary storage means specified by the read storage location information. A kanji-kana conversion device consisting of means for searching the reading corresponding to a kanji or compound word to be converted based on its position.