JPS60103438A - Kana/kanji converter - Google Patents

Abstract

PURPOSE:To reduce the load of an operator of a KANA(Japanese syllabary)/ KANJI(Chinese character) converter by cutting a KANA character string corresponding to the KANJI reading from the head of KANA character strings written with no space and converting the separated character string into KANJI characters through a means. CONSTITUTION:For instance, seven characters bearing an upper line with possibility for conversion into KANJI are designated and then compared with the reading within a KANJI dictionary DIC. When no coincidence is obtained from this comparison, the last one character is deleted from those seven ones for the second comparison with the reading within the DIC. This action is repeated until the coincidence is obtained. When no coincidence is finally obtained, the reading KANA characters and their corresponding KANJI characters are all stored to a homonym buffer BU. When the extraction is through with all KANJI characters, the KANJI characters corresponding to the reading are displayed by a cursor. Thus an operator performs the KANA/KANJI conversion processing.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field) The present invention relates to a kana-to-kanji conversion device for converting kana to kanji.

(Explanation of Conventional Techniques) Conventionally, the following method has been adopted as a method for inputting kana and converting it into kanji.

ii) A method of converting kana to kanji by inputting only the parts of the kana that correspond to the kanji reading, separated by specific symbols.

(c) A method of converting into kanji while inputting kana separated by phrases.

etc. have been adopted.

However, A) Both methods have the disadvantage that symbols or input signals other than the characters necessary to compose the sentence must be given to the device, which reduces the input speed and places a burden on the inputter. Ta.

(Purpose) The purpose of the present invention is to input only the kana necessary for the sentence you want to input, cut out the kana character string corresponding to the reading of the kanji from the beginning of the solid kana character string, and convert it into kanji. By providing a kana-kanji conversion device that compensates for the drawbacks mentioned above, for example, when creating a sentence such as ``I make mechanical products,'' at first I simply write ``I make a mechanical product.'' on the keyboard KB. Enter more information. All characters input at this time are displayed with an upper line. That is, as shown in FIG. 7 (IL), the display ``Create a message'' is displayed on the LCD.

This upper line has the potential to be converted into kanji.

The present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an embodiment according to the present invention. Here, the CPU is the central processing unit, and is in charge of various calculations and control of peripheral devices. The ROM is a program memory that stores execution programs for the central processing unit IcPU as shown in FIGS. 3, 4, 6, and 9. B
L is a pass line that connects other memories, peripheral devices, etc. and transmits signals. KB is a keyboard, which performs an input function. RAM is a random access memory that includes document memory ME, homophone buffer BU, and homophone counter CO.
1 document end address EAD, cursor address CAD
, an insertion flag IF, and the zero document memory ME stores characters input from the keyboard KB, converted Kanji characters, and the like. - The homophone buffer BU stores readings and kanji corresponding to the readings. The homophone counter Co stores the 0 document end address EAD, which specifies the display order of the homophones stored in the homophone buffer BU, and the last address where a character exists in the 1 document memory ME. The cursor address CAD stores the position of the cursor. The insertion flag IF serves as a switch for determining whether or not to perform insertion processing.

The LCD is a liquid crystal display that displays character strings input from the keyboard Kn, contents of the document memory ME, and other information such as a cursor.

The DCT is a display controller that controls a liquid crystal display (LCD).

The CG is a character generator that stores fonts corresponding to two-character codes.

The DIC stores kanji that correspond to pronunciations in the kanji dictionary.

FIG. 2 is an overview diagram showing details of the keyboard KB of FIG. 1. Among these, kana and symbol key group are.

Equipped with multiple character/symbol keys such as hiragana, katakana, ",", ",", etc. Move cursor left.

The cursor right movement key is a key for moving the cursor left and right. UL has the function of adding an upper line to the character on the cursor display with the upper line key, and SC has the function of comparing kana character strings with dictionary readings and creating a homophone buffer with the search key.

It has functions such as confirming the selection of homophones. TR is a conversion key that has the function of sequentially displaying kanji in the homophone buffer.

With the above configuration, the operation of the embodiment of the present invention will be explained with reference to flowcharts.

When this device is powered on, it first proceeds to step Sl in FIG. 3. In step Sl, the random access memory RA'
Perform initialization processing such as clearing the document memory ME, homophone buffer BU, and homophone counter CO in M, setting the recurrent document end address EAD to 0, setting the cursor address CAD to 1, and turning off the insertion flag IF. After that, Proceed to step S2 and the keyboard K shown in FIG.
The state of waiting for key input from B is maintained. If any key is input, the process proceeds to step S3, the input key is determined, and the process proceeds to any of steps 54 to 10. Step S"4 is a character・Perform processing when a symbol key is operated.

A detailed flowchart of the above-mentioned character input processing step S4 is shown in FIG. First, in step S4.l, an upper line bit is added to the input character code.

Here, the difference in internal code between normal display characters and characters with an upper line will be explained.

Typically, the document memory of a character processing device consists of 1 word or 16 bits per character. The code for each character consists of 15 bits, and +1 is given to each bit in correspondence with l to l, but the most significant bit, ie, the pinto O, serves as the upper line bit UB. For example, as shown in Figure 5(a), the code for "A" is r2422J in hexadecimal notation, but the code for "A" with an upper line is < rA42j2+ as shown in Figure 5(b). It has become.

Now, in step S4.2, it is determined whether the insertion flag IF in the random access memory RAM is in the ON state or the OFF state, and if it is OFF, step 54-
4, when it is ON, the process advances to step S4#3.

When the insertion flag is ON, in step S4.3,
In the document memory ME, the cursor address CAD shifts the character array after the address indicated backward one character at a time.

Next, in step S4.4, the cursor address CA
The input character code is stored at the address in the one-document memory ME indicated by D. Thereafter, in steps S4 and 5, 1 is added to the cursor address CAD, and the character input process S4 in the flowchart of FIG. 3 is ended.

In step S5, the search key SC is operated.

FIG. 6 shows details of the search process in step S5, and FIG. 7 shows [4! ! Make mechanical products. This is a diagram showing the process of creating the sentence ``'', and the search key SC is operated from 7(a) to 7(b), 7(b), and 7(b).
d) to Fig. 7(e), Fig. 7(f), Fig. 7(g)
) to Fig. 7(h) to Fig. 7(i), Fig. 7(i)
From Fig. 7 (D to Fig. 7 (h), from Fig. 7 (+) to Fig. 7 (shoes) to Fig. 7 (n), from Fig. 7 (n) to Fig. 7 (0) 7 (p), and from 7 (p) to 7
After passing through Figure (q), we proceed to Figure 7 (r), the above seven steps. Note that kanji candidates for the reading kana are displayed using the conversion key TR, which will be described later.

First, in step S5.l, it is determined whether an upper line is attached to the character on the cursor.

When there is no upper line, that is, Fig. 7(a),
In the case as shown in FIG. 7(q), the process proceeds to step 55-4. When Upper Line is published, that is, Fig. 7(d),
Figure 7 (g), Figure 7 (i), Figure 7 (1), Figure 7 (
n), as shown in Figure 7(p), the characters to be confirmed are 1. If there is an upper line, proceed to step 35-2, set the upper line bits of all the character codes of the character on the cursor and the character string with continuous upper lines to the left to 0, and display the upper line bits on the display screen. Now erase the upper line as shown in Figure 7(e), Figure 7(b), Figure 7(j), Figure 7(m), Figure 7(0), Figure 7(q). .

Through this process, the homophone has been selected and confirmed.Next, the process proceeds to step S5.3, where the kanji whose pronunciation is the same as the kanji selected and confirmed in step S5.2, and all characters with that pronunciation are marked with an upper line. All character strings are searched from the beginning of the document memory, and if they exist, those character strings are replaced with the kanji code of the upper line bit 0 selected in step S5.2.

Therefore, kanji without upper lines are displayed. Of course, at this time, if the number of kanji characters to be replaced is less than the number of characters in the reading, processing is also performed at the same time to fill up the document memory so that there are no gaps.

The process then proceeds to step S5.4, where the character string to the right of the cursor is examined to determine whether there is even one character with an upper line. If it exists, that is, Fig. 7(e), Fig. 7(h), Fig. 7(j).
, Figure 7 (intestine), Figure 7 (o), step S
Proceed to step 5.8, but if it does not exist, as shown in Figure 7 (q), proceed to step 5505, check the character string to the left of the cursor, and check if at least one character with an upper line exists. Check whether or not it exists, and if it exists, that is, Fig. 7 (
If the case is as shown in a), proceed to step S5/7, and if it does not exist, that is, as shown in FIG. 7(q), proceed to step S55.
116. Therefore, in steps S5 and S6, the upper line bits of all character codes on the one-document memory are O because there are no characters with upper lines on the cursor or on the left and right sides of the cursor.

At this time, in order to prepare for inputting the next character, set the cursor address to the document end address +1 so that the cursor is placed one fingertip from the document end address, as shown in Figure 7 (R
). On the other hand, in step S5-7 when it is determined that an upperline character exists only on the left side of the cursor in step S5-5, the cursor address is set to 1 in preparation for searching for a character with an upperline from the beginning of the document memory. set. Further step 55-
8, there is at least one character with an upper line in the character string on the right side including the character on the cursor, so for example 7 from the beginning of those characters with an upper line.
The characters are extracted and compared with the readings in the kanji dictionary DIC, and if they do not match, the last one character is deleted from the seven characters and compared again with the readings in the kanji dictionary DIC. If it does not match, the last character is deleted again and the same process is repeated until it matches.If a matching reading exists in the kanji dictionary DIC, that reading and all the corresponding kanji are stored in the homophone buffer BU. do.

Furthermore, all the kanji in the kanji dictionary DIC corresponding to the pronunciation by omitting the last character of the pronunciation are also extracted and stored in the homophone buffer BtJ together with the pronunciation.

The above-described procedure is repeated to extract all the kanji in the kanji dictionary DIC corresponding to the first character among the upperlined characters and store them together with their readings in the homophone pack IBU. A check code is stored at the end of the homophone buffer BU.

Also, if the beginning of a character with an upper line is [, such as j, and there is no corresponding reading in the kanji dictionary, only that one character is stored in the homophone buffer BU, and the check code COD is stored in the next area. . This situation will be explained with reference to FIG. First, the area in the homophone buffer BtLlt for storing one word is made up of seven words. This corresponds to searching from the seven characters mentioned above. Therefore, ``Kikai'' and its corresponding kanji are stored as ``opportunity'', ``machine'', and ``bizarre'', and ``Kika'' and its corresponding kanji characters ``naturalization'' and ``geometry'' are stored in the first place. ``ki'' and the corresponding r tree J [ki] [ki] are stored.

Finally, when the check code CCD is entered and the processing of 0 or more is completed, the homophone counter CO is set to 1.
, and in order to display the cursor at the same character position as the last character of the reading stored in the first area of the homophone buffer BU, move the cursor address CAD to the character position in the document memory shown in Figure 7(a). Set it under the ``i'' of ``Kikai'' and then display the cursor.

Next, a detailed procedure of the above-mentioned step S6 conversion process will be explained with reference to FIG. First, in step S6.l, the homophone counter co is incremented by 1. This is to indicate the next homophone area of the currently displayed homophone. Subsequently, in step S6.2, the character code in the above-mentioned new homophone area is checked. If the code is COD, the process proceeds to step S6.3, and the homophone counter is set in preparation for redisplaying the homophone buffer γBU from the beginning. c.

Set to 1. On the other hand, if the check code is other than COD in step s6.2, the process proceeds to step S6#4, and the character code in the area corresponding to the homophone counter co is stored in the document memory ME. At this time, the document memory ME is filled up when the number of characters is small so that there is no space left in the document memory ME. Further, the cursor address CAD is set to the position of the last character of the word "ki" newly transferred to the document memory ME, for example, in the case of "ki" in FIG. 8, the position where the kana character "ki" was located. After that, the document memory ME and the cursor are displayed.

Process 7 performs processing when the cursor left movement key or cursor right movement key is operated, that is, in the case of the cursor left movement key, 1 is subtracted from the cursor address on the random access memory RAM, and the cursor right movement key is pressed. On the contrary, it is 1 when
Add it. After such processing, move the cursor to the LCD display L.
Display it on the CD.

Step S8 for performing upper line processing is a process when the upper line key UL is operated, and sets 1 to bit 0 of the character code stored at the address on the document memory ME indicated by the cursor address CAD, that is, the upper line bit. It is set to the state before the selection is confirmed, and the cursor address CAD is incremented by 1 and the cursor is displayed.

Step S9 is a process when the insert key is pressed, and turns on the insert flag IF in the random access memory RAM.
When it is OFF, turn it OFF, and when it is OFF, turn it ON.

Step SlO is a process when the delete key SK is pressed, and one character at the address on the document memory ME indicated by the cursor address CAD is deleted, and the character code after that character is filled in one address at a time.

Note that although the above-mentioned upperlined kana is cut out with seven characters, the gist of the present invention is not impaired even if the number is more than eight characters or less than six characters. However, in that case, each area of the homophone buffer B-U must consist of the same number of words as the number of characters.Furthermore, the mark of the part to be converted to kanji is set as an upper line, but the display method is as follows. The gist of the present invention may be used even if methods such as inverted characters, colored characters, underlining, etc. are used, and although the display device of the present invention is a liquid crystal display, a display such as a CRT may also be used.

(Effects) As explained above, according to the present invention, when inputting a kana character string, the operation of inputting symbols and input signals that are not necessary for the text can be omitted, and the effect is that the kana character string can be input in solid form. There is.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention. Figure 2 is an external view of the keyboard. FIG. 6 is a diagram showing upper line bits of a character code. FIG. 3 is a diagram showing the state of the phonetic word buffer. FIG. 9 is a diagram showing the process of conversion processing. BU/Fist/Homophone buffer, CO...Homophone counter, SC-, search key, TR...Conversion key, UL/
■Upper line key. Figure 7 (9) Machine learning rma]-1 (h) Create machine-made color λ. (L) Machinery products IゝT off (j) Create 1% of the machinery. (k) Deliver mechanical products. (1) Eat one mechanical product. (m) Mechanical products 1 Zhao ■ Ding C72] Hu I prefecture products λ work ■ Ding (of Mechanical products 1 伜 1; (P) Mechanical products lining 6%) Machine 1 h also 1 making work (1-) Machinery ! Craft 11 items.

Claims (1)

[Claims] a human power means for inputting kana; a storage means for storing the character string input by the ill entry means; a kana-kanji conversion means for converting kana into kanji; a dictionary storing pronunciations and kanji corresponding to the pronunciations; Comparison means for comparing some kana characters in the kana character string stored in the storage means with pronunciations stored in the dictionary, the kana character string recorded in the storage means and the kanji characters stored in the dictionary; In the kana-kanji conversion device, a predetermined number of characters are cut out from the storage means, and the kanji are displayed on the MiJ notation display for the character string whose pronunciation matches the comparison means. Kana-kanji conversion device α that can be used.