JPH0731674B2 - Kana-Kanji mutual conversion device - Google Patents

Description

TECHNICAL FIELD 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.

[Conventional technology]

Conventionally, in a word processing function such as a Japanese word processor, a conversion mechanism for converting a kana into kanji has been provided. By inputting the reading of a kanji in kana and specifying kana-kanji conversion, the conversion mechanism is changed. I was getting the kanji corresponding to the target reading.

[Problems to be solved by the invention]

Thus, in the past, conversion from kana to kanji was possible, but conversely, conversion from kanji to kana was not possible. Therefore, for example, when a certain document is called from a document file and kanji or idiom readings are to be output, or when kanji of a certain specific type is to be returned to kana and then output, the conversion is impossible. .

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

[Means for solving problems]

The kana-kanji mutual conversion device of the present invention has an index table searched based on kana, has a first conversion means for converting kana into kanji, and an index table searched based on kanji. , Second conversion means for converting kanji into kana, first specifying means for specifying kana-kanji conversion and next candidate kanji selection, and second specifying means for kanji-kana conversion and next candidate kana selection
And the first designating means performs the first designating operation to convert the kana to be converted by the first converting means to output Kanji, and the first designating means designates the next and subsequent times. The first control means for sequentially outputting the next candidate kanji by operation, and the first specifying operation by the second specifying means converts the kanji to be converted by the second converting means and outputs a kana, and It is provided with a second control means for sequentially outputting the next candidate kana in subsequent assessment operations by the second designating means.

[Work]

When converting kana / kanji, the first designating means designates the start of conversion and selects the next candidate of the converted kanji.
Further, when converting kanji / kana, the second specifying means specifies the start of conversion and selects the next candidate of the converted kana.

When the first designating means is operated, the kana character string to be converted is converted into kanji by the first converting means and displayed. After this kana-kanji conversion, when the first designating means is further operated, the next candidate kanji is selected and displayed by the first control means.

When the second designating means is operated, the kanji to be converted is converted into a kana by the second converting means. After the Kanji-kana conversion, when the second designating means is further operated, the second candidate kana (reading) is selected and displayed.

By having a mutual conversion function between kana and kanji in this way, not only conversion from kana to kanji but also conversion from kanji to kana can be realized by a simple operation.

〔Example〕

 (1) Configuration of Embodiment FIG. 1 is a block diagram showing an embodiment of the present invention.

In the figure, 10 is a CPU that controls the entire apparatus and performs various document processes. Here, "Kanji conversion / next candidate" will be described later.
With the key operation such as the key and "Kana conversion / next candidate" key,
The conversion process of Kana-Kanji or Kanji-Kana, and the next candidate process of the converted characters are selectively executed.

Reference numeral 11 is an input unit provided with a kana character key for document input and further various function keys. Here, as a function key for character conversion, kana-kanji conversion and next candidate kanji selection are designated. A “Kanji conversion / next candidate” key, a “Kana conversion / next candidate” key for designating Kanji-kana conversion and selecting a next candidate kana are provided.

12 to 15 are CP at the time of mutual conversion of kana and kanji
These are dictionaries and tables referenced by U10. Among these, 12 is a kana index table for searching the parent character (first kanji) from the conversion target kana character string during kana kanji conversion, and 13 is the conversion dictionary for the parent character searched by this kana index table 12. Kanji index table for searching the area pointer address, 14 is a conversion dictionary memory in which the base characters and their readings are stored in association with each other, 15 is a prefix, a particle including post suffix, auxiliary verb, etc. are stored It is a word dictionary memory.

Reference numeral 16 is a display unit for displaying input and edited documents.
At the time of each conversion of kanji and kanji-kana, the character string to be converted is specified and the converted character or character string is displayed. A printing unit 17 prints out each of the above documents.

Reference numeral 18 is a document memory that stores the document information that has been input or is to be edited. Reference numeral 19 is a ROM which stores a character generator and various control programs including conversion processing of kana-kanji and kanji-kana by table / dictionary search as shown in FIG.

Reference numeral 20 is a work RAM of the CPU 10. Regarding conversion processing between kana and kanji, parent character pointer, kanji pointer, kana pointer, kanji buffer, kana buffer, kana index table pointer, and kana not shown / Kanji / next candidate determination flag F and the like are provided.

FIG. 2 is a flow chart showing a flow of conversion processing between Kana and Kanji and selection processing of the next candidate in accordance with the key operation of the "Kanji conversion / next candidate" key and the "Kana conversion / next candidate" key in the above embodiment. is there.

FIG. 3 is a diagram showing the index order of tables and dictionaries and a specific character search example for explaining the conversion processing operation in the above embodiment.

FIGS. 4 (a) to 4 (g) are diagrams showing examples of character display for each conversion processing step in the above embodiment.

(2) Operation of Embodiment [Conversion from Kana to Kanji] A document including a character or a character string to be converted is displayed on the display unit 16, and the character string to be converted in the document is designated by the cursor. When the “Kanji conversion / next candidate” key of the input unit 11 is operated, the conversion process shown in FIG. 2 is executed under the control of the CPU 10.

When the "Kanji conversion / next candidate" key is operated, the contents of the kana / kanji / next candidate determination flag F are checked (step S1 in FIG. 2).

Here, if the content of the kana / kanji / next candidate determination flag F is "0", and it is determined that it is the first "kanji conversion / next candidate" key operation after the already-converted kanji candidate is confirmed. Prior to the kana-kanji conversion process, the kana / kanji / next candidate determination flag F is set to "1" indicating that the "kanji conversion / next candidate" key will be the next candidate selection key for kanji ( Figure 2 step S2).

Then, the kana index table 12 is indexed based on the character code of the above kana character or kana character string to be converted, and the base character of the kanji corresponding to the reading represented by the kana to be converted (the first kanji character Search code (Fig. 2 step)
S3).

Next, the Kanji index table 13 is indexed based on the base character searched from the kana index table 12 to obtain the address (base character address) in the conversion dictionary memory 14 in which the base character is stored (first character 2 step S4).

This parent character address is stored in the parent character pointer in the work RAM 20. Further, when there is a Chinese character attached to the base character (that is, when the conversion target is a idiom), a Kanji pointer in the work RAM 20 that specifies the address of the attached Chinese character is set to the above-mentioned initial address. The address indicating the storage position of the first candidate Kanji that forms a phrase together with the above base character, which is obtained by adding a specific value to the base character, is set, and a reading pointer that specifies the address of the reading of that Kanji is set. An address indicating the storage position of the first reading of the Chinese character is set as the initial address.

Next, a specific value is added to the base character address stored in the base character pointer to obtain an address storing the first reading of the base character, and this address and the reading address stored in the reading character pointer. Conversion dictionary memory based on and
14 is indexed, and the phonetic reading including the base character and the Chinese character accompanying it is read (step S5 in FIG. 2).

The phonetic reading read from the conversion dictionary memory 14 is compared and collated with the conversion target character string (or character) designated by the cursor (step S6 in FIG. 2).

If the readings match, the conversion dictionary memory 14
Read the kanji corresponding to each reading (eg, kanji) and store it in the kanji buffer and kana in the work RAM 20, and then convert the kanji (eg kanji (kanji) and its reading). Display section 16
Is displayed on the screen (steps S7 and S17 in FIG. 2).

In addition, the comparison and collation of the phonetic reading read from the conversion dictionary memory 14 and the conversion target character string (or character) (step in FIG. 2).
If no match is found in S6), the reading pointer in the work RAM 20 is updated, and the updated reading is again compared and collated with the conversion target character string (or character) (No. (2) Steps S5, S6, S18, S19). Further, at this time, if the address of the unreadable pointer goes through the reading of the kanji that accompanies the base character, the kana index table pointer in the working RAM 20 is updated and the same comparison as above is performed for the next base character. Collation is performed (steps S5, S6, S18.S19, S20 in FIG. 2).

When the Kana-Kanji conversion is performed and the converted candidate Kanji is displayed, if the "Kanji conversion / next candidate" key is operated again, the contents of the Kana / Kanji / next candidate determination flag F will be changed. , After confirming that it is "1" indicating that the next candidate selection of kanji is designated, the pointer is updated in the same manner as above, and further the comparison and collation similar to the above is performed for the updated reading. (Fig. 2 Steps S1, S18 ~ S20, S5, S
6).

At this time, the kana / kanji / next candidate determination flag F is reset to "0" every time the displayed candidate kanji is determined by operating the "select" key or the like. Also, a kana / kanji / next candidate determination flag F associated with the operation of the “Kanji conversion / next candidate” key
At the time of identification (step S1 in FIG. 2), when the content is "2", the key input is ignored and no function (NF) is set.

In this way, the readings of kanji input in kana are sequentially converted to kanji.

FIG. 3 shows the index procedure of each table and dictionary at the time of the conversion process, and the index examples are shown in FIGS. 4 (a) to 4 (c).
Is shown in.

[Conversion from kanji to kana] A kanji mixed sentence to be converted is displayed on the display unit 16, and a kanji or kanji character string (for example, after a idiom) to be converted in the document is designated by the cursor and then input. When the “kana conversion / next candidate” key of the section 11 is operated, the conversion process shown in FIG. 2 is executed under the control of the CPU 10.

When the "kana conversion / next candidate" key is operated, the contents of the kana / kanji / next candidate determination flag F are first examined (step S8 in FIG. 2).

Here, if the content of the kana / kanji / next candidate determination flag F is "0" and it is determined that it is the first "kana conversion / next candidate" key operation after the candidate of the already converted kanji is determined. Prior to the kanji-kana conversion processing, the kana / kanji / next candidate determination flag F is set to "2" indicating that the "kana conversion / next candidate" key will be the next candidate selection key for kana ( Figure 2 step S9).

Then, a Kanji character string (for example, a compound word) to be converted is searched for a base character, the Kanji index table 13 is indexed based on the searched base character, and the conversion character is stored in the conversion dictionary memory 14 in which the base character is stored. An address (base letter address) is obtained (steps S10 and S11 in FIG. 2).

This parent character address is stored in the parent character pointer in the work RAM 20. Further, when there is a Kanji character accompanying the base character (that is, when the conversion target is a compound word), the Kanji pointer in the working RAM 20 that specifies the address of the Kanji character that accompanies the Kanji character will be used as the initial address. The address indicating the storage position of the first candidate Kanji that forms a phrase together with the above base character, which is obtained by adding a specific value to the base character, is set, and a reading pointer that specifies the address of the reading of that Kanji is set. An address indicating the storage position of the first reading of the Chinese character is set as the initial address.

Next, the conversion dictionary memory 14 is indexed based on the base character address stored in the base character pointer and the address stored in the Chinese character pointer, and the corresponding Chinese character (for example, a idiom) is read ( 2 step S12).

Next, the Chinese character (for example, the idiom) read from the conversion dictionary memory 14 is compared and collated with the Chinese character designated as the conversion target designated by the cursor (step S13 in FIG. 2).

If the Chinese characters match, the phonetic reading is read from the conversion dictionary memory 14, stored in the phonetic reading buffer in the working RAM 20, and then displayed on the display unit 16 (FIG. 2). Steps S14, S17).

Further, when there is no match in the comparison and comparison between the Kanji read from the conversion dictionary memory 14 and the Kanji to be converted (step S13 in FIG. 2), the Kanji pointer in the work RAM 20 is updated, The same comparison and collation as above is performed again for the updated kanji (steps S12 to S16 in FIG. 2).

In addition, when Kanji-Kana conversion is performed and the converted candidate Kana character string is displayed, "Kana conversion / next candidate" is displayed again.
When the key is operated, it is confirmed that the content of the kana / kanji / next candidate determination flag F is “2” indicating the designation of the next candidate selection of kana, and then the unreadable pointer is updated. The reading on the display unit 16 is updated (steps S8, S21, S14, S17 in FIG. 2).

At this time, the kana / kanji / next candidate determination flag F is reset to "0" every time the displayed candidate kana character string is confirmed by operating the "select" key or the like. In addition, the above “Kana conversion /
When the kana / kanji / next candidate determination flag F is identified (step S8 in FIG. 2) associated with the operation of the "next candidate" key, if the content is "1", the above key input is ignored and no function (NF) And

In this way, the designated kanji are sequentially converted into a kana character string according to the reading.

An example of mutual conversion operation from kana to kanji and from kanji to kana at this time is shown in FIGS. 4 (a) to 4 (g).

As described above, conversion from kana to kanji and selection of the next candidate of the candidate kanji can be performed by repeating the same key operation, and conversion of kanji to kana and selection of the next candidate of the candidate kana character string can be performed. Since each can be performed by repeating the same key, not only ordinary kana-kanji conversion, but also kanji in any kanji mixed sentence can be converted into kana corresponding to its reading.

In the above embodiment, the means for designating the character or character string to be converted with the cursor has been shown as an example, but the present invention is not limited to this. For example, the entire display page or the designated document can be displayed. It is also possible to sequentially perform the above-described conversion processing as a conversion target.

〔The invention's effect〕

As described above in detail, according to the kana-kanji mutual conversion device of the present invention, in the device having the document processing function, the kana-kanji mutual conversion function is provided, and the kana-to-kanji conversion and the next candidate kanji It has a first designating means for designating each selection and a second designating means for designating conversion from kanji to kana and selection of next candidate kana, respectively, and kana-kanji conversion and output of next candidate kanji, or Since the kanji-kana conversion and the output of the next candidate kanji are performed by the common designating means, the kana to kanji conversion and the kanji to kana conversion can be realized by a simple operation.

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration according to an embodiment of the present invention, FIG. 2 is a flow chart showing the processing flow of the above embodiment, and FIG. 3 is a table for explaining the conversion processing operation in the above embodiment. And a diagram showing an index order of the dictionary and a specific character search example thereof, and FIGS. 4 (a) to 4 (g) are diagrams showing a character display example at each conversion processing step in the above embodiment. 10 …… CPU, 11 …… Input section, 12 …… Kana index table, 1
3 ... Kanji index table, 14 ... conversion dictionary memory, 15 ...
… Adjunct dictionary memory, 16 …… Display, 17 …… Printing, 18
…… Document memory, 19 …… ROM, 20 …… Work RAM.

Claims (1)

[Claims] Claim: What is claimed is: 1. A kana character is converted into a kana by having an index table searched based on the kana and having a first conversion means for converting the kana into kanji and an index table searched based on the kanji. Second converting means for converting; first specifying means for specifying kana-kanji conversion and selecting next candidate kana; second specifying means for specifying kanji-kana conversion and selecting next candidate kana;
In the first specifying operation by the specifying means, the kana to be converted is converted by the first converting means to output the kanji, and in the subsequent specifying operation by the first specifying means,
First control means for sequentially outputting the next candidate kanji, and the second control means
In the first specifying operation by the specifying means, the Kanji to be converted is converted by the second converting means and a kana is output, and in the subsequent specifying operation by the second specifying means,
A kana-kanji mutual conversion device, comprising: a second control means for sequentially outputting the next candidate kana.