JPS61250772A - Kana/kanji converter - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a kana-kanji conversion device that converts a reading that is a target of kana-kanji conversion into a sentence containing kanji and kana. The present invention relates to a kana-kanji conversion device that can convert .

[Background of the invention]

Conventionally, the method for converting solid input into kana-kanji was ``
“Hitachi Review” May 1980, Volume 63, No. 5 rHITAC
A method combining longest match and backtrack described in "L-320/30H, 50H Document Processing Function" (hereinafter referred to as Document (1)), Proceedings of the 19th National Conference of the Information Processing Society of Japan, 1971, 5E- 4. The two-clause longest match method described in ``Kana-Kanji conversion system for solid writing'' (hereinafter referred to as Document (2)), Information Processing Society of Japan Computational Linguistics Study Group Material 25-6, 1981 r-table method. The phrase structure analysis algorithm used and its efficiency are well known, such as the method for minimizing the number of phrases described in J (Reference (3) below).

The method in document (1) extracts an independent word from the left end of the input using the longest match, and then repeats the clause conversion process of assigning adjuncts that can be grammatically connected to the independent word until it reaches the right end. If it does not reach the target, it backtracks, tries another phrase conversion, and moves on.

The method in document (2) extracts all possible conversion candidates over two clauses from the left end of the input, selects the one with the longest sum of the lengths of the two clauses, and selects the one that has the longest sum of the lengths of the two clauses. Then, by repeating the same process using that point as the starting point, the conversion is performed while determining the break for each clause.

The method in document (3) is to extract phrases starting from the left end in a brute force manner, and select a combination with the minimum number of phrases from among them to use as a conversion result.

Above, we have described an example of a method for converting kana-kanji using solid writing input, but in general, when converting the input reading into a sentence containing kanji and kana, due to the characteristics of Japanese, many conversion candidates are generated. Furthermore, in multiple clause input Kana-Kanji conversion, where multiple clauses are input and converted at once, there is more room to choose where to place the breaks between clauses, so there are more options for conversion than in the case of bunsetsu bone cursive writing. There is a problem in that it takes more time and effort to convert to the candidate intended by the user. Therefore, when inputting a reading that is subject to kana-kanji conversion, a function was needed that could convert some of the readings into sentences containing kanji and kana.

[Purpose of the invention]

An object of the present invention is to provide a kana-kanji conversion device capable of converting only the part of the reading that an operator wants to convert into a kanji-kana mixed sentence when the reading to be converted into kana-kanji is input.

[Summary of the invention]

The present invention is characterized by a kana-kanji conversion device having an input section for inputting the reading to be converted into kana-kanji, a conversion processing section for converting the designated reading into a sentence containing kanji and kana, and a display section for displaying the conversion result. , a means for storing readings input from the input unit in a storage unit, and a movement key for specifying readings to be excluded from conversion among the input readings;
A mask control processing means for identifying and displaying readings to be excluded from conversion specified by the movement key on a display unit, and a conversion target reading input extraction processing means for extracting readings to be converted, the operator can It is possible to specify the part of the inputted reading that you want to convert and convert it into a sentence containing kanji and kana.

[Embodiments of the invention]

An embodiment of the present invention will be described below.

FIG. 2 is a block diagram showing the configuration of the kana-kanji conversion device according to the present invention, which includes a kana input section 1, a display section 4, a control section 2, a conversion processing section 5, and a storage section 3.

The input unit 1 is, for example, a keyboard for inputting kana input, designation of conversion target reading, and inputting conversion, and the display unit 4 is, for example, a CRT for displaying reading input and conversion results.
It consists of a display, etc. The control unit 2 controls the execution of kana-kanji conversion and is configured using a CPU. The storage unit 3 temporarily stores input kana character strings and data used in conversion. The conversion processing section 5 converts the pronunciation to be converted into a sentence containing kanji and kana.
It is composed of the following programs.

FIG. 3 shows an example of the configuration of the input section 1. here.

In this embodiment, the input device shown in FIG.

The arrangement of the keys and the number of keys are not particularly specified, and the reading key 70 is generally composed of a plurality of keys such as kana and alphabet keys.

FIG. 1 is a flowchart of the processing functions of kana-kanji conversion using the hon-kana-kanji conversion device, and one part of the process will be explained below according to the figure.

The operator inputs the conversion target reading character from the input unit 1 using the conversion target reading input key 70 shown in FIG. In the control unit 2, it is determined whether the conversion key is manually processed before or after (10), and the initial setting of the establishment flag and the starting point management pointer, which will be explained later, requires kana-kanji conversion, such as creating one document. In this embodiment, the initial value "0" is stored when entering the state. In the input oyster determination process (60), it is determined that it is a read oyster, and in the reading input storage process (20), the reading input from the input unit 1 is stored in the storage unit 3. If you want to convert part of the input reading into a sentence containing kanji and kana, press the start or end left/right cursor key 80 shown in FIG. 3 from the input unit 1, and as a result, the mask control shown in FIG. In the process (30), the input pronunciations that are not subject to conversion are shaded, for example, so that the pronunciations that are subject to conversion and the pronunciations that are not subject to conversion can be distinguished;
Output to the display section 4. By pressing the conversion key 9o shown in FIG. 3, the unshaded portion of the pronunciation to be converted is stored in the conversion target reading manual buffer (40), and in the conversion process (50), it is stored in the conversion target reading input buffer. Convert a certain reading into a sentence containing kanji and kana. Further processing (501)
At , the shaded reading among the input readings before the reading to be converted and the results converted in the conversion process (50) are set in the output display buffer in order.

The establishment flag is set to "1" (501), and the display unit 4
Output the conversion result to . After conversion, processing is performed in accordance with the type of key input in confirmation processing (55).

Hereinafter, the above-mentioned reading input storage processing (20) will be described.

The operations of the mask control process (30), the conversion target read input extraction process (40), and the confirmation process (55) will be described in more detail.

FIG. 4 is a brooch yard showing the operation of the reading input storage process (20) of FIG. Read the reading input from the conversion target reading key 70 in Figure 3 and store it in the input storage buffer 201), and if the input reading is the first reading to be converted, the reading input in the process (204) A start point management pointer (MS) that manages the start end of the conversion target reading, a start point pointer (S) that manages the start end of the conversion target reading, an end management pointer (ME) that manages the end of the input reading, and a terminal end that manages the end of the conversion target reading. The initial value "1" is set in each pointer (E). Also.

If the input reading is not the first reading, process (203
) at terminal pointer (E) and terminal management pointer (ME)
For example, as shown in Figure 6, if you input "He called the pheasant," increase the value of rlJ.
), and the start point management pointer (MS) stores rlJ, which is the position of "ka", and the end pointer (E) and end management pointer (ME) respectively store the value of "9", which is the position of "da". I remember.

Next, FIG. 5 shows the operation flow of the mask control process (30) in FIG. In process (301), it is determined whether the pressed key is the starting left cursor key, and if it is the starting left cursor key, the process (301) is performed.
304), the start end pointer (S) and start end management pointer (
MS) are equal. If they are equal, do no processing and end mask control processing.0 If not equal, process (
In step 307), the value of the start point pointer (S) is decreased by "1", and the mesh at the reading indicated by the start point pointer (S) is canceled.

If the pressed key is the last left cursor key, process (30
5), the terminal pointer (E) and terminal management pointer (ME
) are equal. 8 If equal, do not process and end mask control processing. 0 If not equal, increase the end pointer (E) by rlJ and set the end pointer (E)
Remove the reading net indicated by . If the key pressed is the start end right cursor key or the end end left cursor key, process (3)
In step 03), it is determined whether the start pointer (S) exceeds the end pointer (E), and if it does, the mask control process ends, and if it does not, the start end pointer (when pressing the right cursor key) returns the start end pointer. The reading indicated by the pointer (S) is shaded (311).

The starting point pointer (S) is increased by "1" (312).

When pressing the end left cursor key, the reading indicated by the end pointer (E) is shaded (313), and the end pointer (E) is set to "1".
” decrease (314).

The example in FIG. 7 is the output result of the display unit 4 when the start end right cursor key is pressed once from the output state in FIG. 6, and the example in FIG. 8 is the output result from the output state in FIG. Cursor key 1
This is the output result of the display unit 4 when the button is pressed twice. Furthermore, the ninth
The figure shows the output result of the display section 4 when the start end left cursor key is pressed in the output state of FIG. 8.

FIG. 10 shows the operational flow of the conversion target read input extraction process (40) when the conversion key 90 in FIG. 3 is pressed. In process (401), the value of the start pointer (S) is set to the control pointer (P). In the process (402), it is determined whether the control pointer (P) exceeds the end pointer (E), and if it does not, the reading indicated by the control pointer (P) is stored in the conversion target reading input buffer (403), Increase control point'/'i (P) by rlJ (404
).

When the number of readings is exceeded, the number of readings stored in the conversion target reading input buffer is calculated and stored in the reading count buffer. Based on the reading set in the conversion target reading input buffer and the number of readings, the conversion process (50) converts it into a sentence containing kanji and kana.1 For example, if you press the conversion key in the output state shown in Figure 11, the conversion target Store “Kijiwo” in the reading input buffer,
Store "3" in the reading count buffer. Based on the information, a conversion process (50) is performed to create a sentence containing kanji and kana, ``article'', and the result is output to the display unit 4 as shown in FIG.

FIG. 13 shows the operational flow of the confirmation process (55) for the output results.

In the process (551), it is determined whether the candidate change key 95 indicating that the candidate output as the conversion result is not the candidate intended by the operator has been pressed. If it is the candidate change key 95, the next candidate is created in the process (552), and the value indicated by subtracting "1" from the value of the start point pointer (S) from the reading indicated by the start point management pointer (MS) is stored in the output display buffer. Until reading, and.

Set the next candidates created in the process (552) in order 55
3) Display on the display section 4. If it is not the candidate change key 95, it is determined in process (554) whether the values of the end pointer (E) and the end management pointer (ME) are the same, and if they are not equal to 1, the value of the end pointer (E) is changed in process (555). )of"
1” is added. In the process (556), the read net indicated by the end pointer is removed and stored in the location indicated by the start end management pointer of the read input storage buffer. In the process (557), the start management pointer (MS) is increased by "1", and the process (544)
), if they are equal, it is determined in step (55B) whether the starting point management pointer (MS) is [1].

That is, in the process (556), it is determined whether an unestablished reading has been read and set in the input storage buffer. When the starting point management pointer (MS) is "1", the starting point management pointer (MS)
559) to indicate that there is no reading in the reading input storage buffer. In addition, the start end management pointer (M
If S) is not "1", in the process (560), the value obtained by subtracting "1" from the value of the start point management pointer (M S ) is set in the end pointer and the end management pointer, and the start end pointer (S) and , set rIJ in the starting point management pointer (MS), respectively.

Further, in the process (561), the establishment flag is set to "0". FIG. 14 shows the output result of the display section 4 when the conversion target input reading key "ga" is input in the output state of FIG. 12.

〔Effect of the invention〕

According to the present invention, it is possible to convert a part of a reading input over multiple clauses into a sentence containing kanji and kana, so corrections can be made when the result of kana-kanji conversion for the input reading is not the candidate intended by the operator. This can be done quickly, and as a result, the time required for document creation can be shortened.

[Brief explanation of drawings]

Figure 1 is a flowchart showing the conversion execution method according to the present invention, Figure 2 is a block diagram of the Kana-Kanji conversion device according to the present invention, Figure 3 is a diagram showing an example of an input key, and Figure 4 is a reading input. FIG. 5 is a flowchart showing the operation of the storage process, FIG. 5 is a flowchart showing the operation of the mask control process, FIGS. 6 to 9, and 11 are views showing screen display information, and FIG. 1O is the conversion target reading input extraction process. FIG. 12 is a flowchart showing the operation of FIG. 11, and FIG. 12 is a diagram showing screen display information of the conversion result in FIG. FIG. 13 is a flowchart showing the operation of the confirmation process after conversion, and FIG. 14 is a diagram showing an example of screen display information after the confirmation process. 1... Input section, 2... Control section, 3... Storage section, 4
... Output section, 5... Conversion processing section.

Claims (1)

[Scope of Claims] 1. A kana-kanji conversion device having an input section for inputting the reading to be converted into kana-kanji, a conversion processing section for converting the input reading into a sentence containing kanji and kana, and a display section for displaying the conversion result. means for storing readings input from an input unit in a storage unit, a movement key for specifying readings to be excluded from conversion among the input readings, and a conversion target specified by the movement key. A kana-kanji conversion device comprising: a mask control processing means for identifying and displaying a reading to be converted on a display unit; and a conversion target reading input extraction processing means for extracting a reading to be converted. 2. The kana-kanji conversion device according to claim 1, further comprising an establishment processing means for excluding the reading to be converted from among the input readings after determining the reading to be converted.