JPS62208162A - Kana/kanji converter - Google Patents

Abstract

PURPOSE:To immediately correct the misinput of a part of reading KANA (Japanese syllabary) and to shorten a sentence forming time by storing characters to be converted in an input buffer for reading KANA data to be converted through a conversion key and converting the characters to be converted into a KANJI (Chinese character)/KANA mixed sentence by the conversion processing. CONSTITUTION:When a proposed character for conversion obtained after depressing a convesion key is established, a control part 2 decides an input key, and if the input key is an input key for a reading KANA data to be converted, the reading KANA data inputted from an input part 1 are stored in a storage part 3. On the other hand, indicators 91-94 nets or releases the inputted reading character string. When the conversion key 96 is depressed, the reading KANA to be converted is stored in the input buffer for the reading KANA data to be converted and the reading KANA data stored in said input buffer are converted into a KANJI/KANA mixed sentence by a conversion processing part 5.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an improvement in a kana-kanji conversion device that converts kana readings to be converted into kana-kanji characters into a character string containing kanji and kana.

[Conventional technology]

Conventionally, as a method for converting solid input or character strings into kana/kanji, Hitachi Review May 1980, Vol. 63, No. 5% rH
Icho ACL-320/30) (,508 document processing function)
(hereinafter referred to as Document (1)), a method combining longest match and backtracking, Proceedings of the 19th National Conference of the Information Processing Society of Japan, 1971, 5E-4r Kana-Kanji conversion system for solid writing. ” (hereinafter referred to as Document (2)), the two-clause longest match method, Information Processing Society of Japan Computational Linguistics Research Group Material 25-6, 1981, About the phrase structure analysis algorithm using the r-ura method and its efficiency. ”
The method of minimizing the number of clauses described in (hereinafter referred to as Document (3)) is well known.

The method in Reference (1) extracts an independent word from the left end of the input (the beginning of the input kana character string) by the longest match, and performs a bunsetsu conversion process that assigns an attached word that can be grammatically connected to the next independent word. This is repeated until the end of the kana string is reached. If the right end is not reached, backtrack (
), try another phrase conversion, and move forward.

The method in document (2) extracts all possible conversion candidates over two clauses from the left end of the input in a brute force manner, and selects two from among them.
In this method, the one with the longest sum of the lengths of the bunsetsu is selected as the break for the first bunsetsu, and this time the same process is repeated using that point as the starting point, thereby determining the break for each bunsetsu and converting it.

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.

However, when performing solid input, generally a large amount of Yomi-Kana data is input at once, so it often happens that some of the input Yomi-Kana data is not the reading that the operator intended (incorrect input). There is a problem with that.

As a correction method in case of the above-mentioned incorrect input,
Conventionally, there is a method of deleting characters one by one from the end of an input character string, deleting the corresponding erroneously input characters, or inserting new reading data, and then inputting the original reading characters again.

Other correction methods include masking each character from the end of the input string and deleting the incorrectly input characters, or inserting new kana reading data and then canceling the masking described above. There is.

[Problem that the invention seeks to solve]

However, according to the former method, after correcting the erroneously input character string, the character string that has been input once must be re-entered, making the operation cumbersome.

In addition, according to the latter method, if there is an incorrectly input character at or near the beginning of a character string that has been entered, it must be masked one character at a time up to the corresponding position at or near the beginning. There is an unavoidable hassle,
Although this method has better operability than the first correction method described above, there is still room for improvement.

The present invention has been made in consideration of the above points, and includes:
The purpose of this is to correct incorrectly input characters faster than before when some of the reading data input to create kanji-kana mixed characters does not read as intended by the operator. The present invention aims to provide an improved kana-kanji conversion device that can shorten the time required for document creation.

[Means for solving problems]

The purpose is to provide an input section for inputting reading-kana data to be subjected to kana-kanji conversion, a means for storing reading-kana data inputted from the input section in a storage section, and converting the input reading-kana to a character string containing Kanji-kana. In a kana-kanji conversion device that has a conversion processing unit that controls the execution of kana-kanji conversion, a control unit that controls the execution of kana-kanji conversion, and a display unit that displays the conversion results, all the readings input from the input unit are excluded from the kanji conversion target at once. a first instruction means for specifying the input kana characters that have been specified as not to be converted into conversion targets one by one; a third indicating means; and a fourth indicating means for converting at once all of the kana readings in the part specified to be excluded from conversion; A mask control processing means for identifying on the display unit the reading to be converted and the conversion target reading, and a conversion target reading kana data input/retrieval processing unit for retrieving the conversion target reading kana data from the storage unit. This is achieved by

[Effect]

As described above, the kana-kanji conversion device of the present invention includes a first instruction means that excludes all the readings input from the input section from being converted into kanji at once, and inputs that are specified as not being converted. A second instruction means for specifying kana readings to be converted one by one, a third instruction means for specifying kana readings one by one to be excluded from conversion, and a third instruction means for specifying kana readings to be excluded from conversion one by one. A fourth instruction means for converting all the kana readings of a part at once, and for identifying on the display unit the readings specified by the instruction means that are to be excluded from the conversion and the readings to be converted. Since it is equipped with a mask control processing means and a conversion target reading kana data input retrieval processing means for retrieving the reading kana data to be converted from the storage unit, the first to fourth instruction means can be combined as appropriate. This allows you to quickly correct erroneously input reading/kana data. In other words, if there is an incorrect input in a character string that has been input once, and if the incorrectly input character t is located at or near the end of the string,
As before, you can mask each character from the end of the input string to delete incorrectly input characters, or insert new kana reading data and then unmask the characters one by one. . On the other hand, if there is an incorrectly input character at the beginning or near the beginning of a character string that has been input, mask all of the relevant character strings at once.
After deleting the corresponding erroneously input characters or inserting new kana reading data, the above-described masking may be canceled at once.

〔Example〕

Hereinafter, the present invention will be explained based on one embodiment of the drawings.

FIG. 2 is a block diagram of the kanji conversion device according to the present invention, in which a kana input section 12 a display section 4. Control unit 2. It consists of a conversion processing section 5 and a storage section 3.

The input section 1 inputs kana and specifies the kana reading to be converted.
The display unit 4 is, for example, a keyboard for inputting conversions, and the display unit 4 is composed of, for example, a CRT or the like for displaying reading and kana input and conversion results.

The control unit 2 is responsible for controlling the execution of kana-kanji conversion.
It is configured using PU. The storage unit 3 is.

Temporarily holds input Kana strings and data used in conversion. The conversion processing unit 5 converts the reading kana data to be converted into a sentence containing kanji and kana.

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

Note that the input device shown in FIG. 3 is not particularly limited to this example with respect to the key arrangement and the number of keys. Further, the reading/kana input key is generally composed of a plurality of keys such as kana, alphabet, etc.

FIG. 1 is a flowchart showing the execution operation of the kana-kanji conversion process by the apparatus of the present invention, and the execution operation of the apparatus of the present invention will be explained below based on FIG.

The operator operates any of the keys shown in FIG. 3 from the input unit 1 to input processing commands or character data.

The control unit 2 first determines whether the conversion candidate after the conversion key is pressed in processing step 10 is in an unestablished state (hereinafter referred to as an unestablished state) or if it is not.
Set when entering a state that requires Kana-Kanji conversion, such as 1 step, initialization of the end pointer 5, and document creation. In this embodiment, an establishment flag "0", a start point pointer "1", and an end pointer "0" are stored as initial values. If yes, the input key is entered in processing step 12.14.
In the case of the conversion target reading kana data input key shown in FIG. . Also, in step 14, the third
First instruction means 91 and second instruction means 92 shown in the figure. Third instruction means 93. In the case of the fourth instruction means 94, the process moves to mask control processing step 30, where the input character string is shaded or removed. In step 12, if the conversion key 96 shown in FIG. 3 is pressed, the process moves to step 40, and the conversion target reading kana, which is the part that is not shaded in the mask control processing step 30, is inputted as conversion target reading kana data. The conversion processing unit 5 (step 50) converts the reading kana data in the conversion target reading kana data input buffer into a sentence containing kanji and kana (step 60). At this time, in order to change the established state to an unestablished state, set the establishment flag to "1".
is set, and the conversion result is output to the display section 4 (step 62).

When the establishment flag is "1", that is, in an unestablished state, it is determined whether the input key is a non-conversion key in step 16, and if it is a non-conversion key, step 70 is performed.
, perform the non-conversion process and erase the conversion result displayed on the display unit 4. If it is not a non-conversion key, proceed to step 8.
0, the candidate confirmation process is performed, and in order to change the unestablished state to the established state, the establishment flag is set to "0" (step 82
).

Hereinafter, the input reading kana data storage processing step 20 mentioned above will be explained. Mask control processing step 30. The operation of the conversion target kana data input/extraction processing step 40 will be explained in more detail.

FIG. 4 is a flowchart showing the operation of reading kana data input storage processing step 20 of FIG.

First, in processing steps 201 and 202, the key pressed by the operator is determined. If the input key is the conversion N target reading Kana data input key shown in FIG. 3, in processing step 203 it is determined whether or not there is a shaded part of the already input reading Kana character string. Note that the start pointer (S), which will be described later, manages the start end of the input kana character string, and the end pointer (E)
manages the end of the input Kana character string.

In addition, the mask pointer (M) is used to manage the beginning of the input kana character string to the shaded pronunciation.For example, as shown in Figure 5, "He called the pheasant." , the start pointer (S) stores ``1'' indicating the position of ``r''.

The end pointer (E) is "9" indicating the position of "da", and since the mask pointer (M) has only a shaded reading, the value "10" of the end pointer +1 is stored. As shown in FIG. 6, when "Yonda" is shaded, the mask pointer (M) stores rIJ indicating the position of "Ryo". In processing step 203, if the input yomi kana character string is not shaded, that is, if a new yomi kana is input after the last input yomi kana, in processing step 208, the mask pointer (M ), and in processing steps 209 and 210, the end pointer (E
) and the value of the mask pointer (M) are increased by [1].

If there is shading in processing step 203, step 2
At step 08, a new reading kana is inserted at the position indicated by the mask pointer (M) of the input reading kana storage buffer. Then, in processing steps 209 and 210, the values of the end pointer (E) and mask pointer (M) are increased by "1". If it is determined in processing step 201 that the input key is a back key, it is determined in processing step 211 whether or not the input pronunciation exists, and if so, in processing step 212, the input pronunciation is shaded. Determine if there is. If there is no shading, the terminal pointer (E
) and the value of the mask pointer (M) are decreased by "IJ".

If there is shading, processing steps 214゜215.2
16, the input reading kana that is one character before the beginning of the input character with the input reading kana storage buffer is deleted. Then, the values of the end pointer (E) and mask pointer (M) are decreased by "1".

For example, if you input "A" which is the Kana data input key to be converted into the output state shown in Figure 6, the output state will be as shown in Figure 7, and if you input the backward key in Figure 7, the output state will be as shown in Figure 6. become.

Next, FIG. 8 shows the operational flow of the mask control process shown in step 30 in FIG.

In processing steps 301, 305, 306, and 310, the first instruction means 91 and the second instruction means 92 shown in FIG. Third instruction means 93. It is determined which key of the fourth instruction means 94 is manually operated.

In the case of input from the first instruction means, processing step 302'
, 303 and 304, the input kana indicated by the mask pointer (M) is shaded until the value of the mask pointer (M) becomes "1". In other words, all of the input kana readings are shaded. In the case of the fourth instruction means input, in processing steps 314, 315, and 316, the input reading indicated by the mask pointer (M) is changed until the value of the mask pointer (M) becomes larger than the value of the end pointer (E). Remove the shading. That is, all the shaded input kana characters are unshaded. In addition, in the case of third instruction means input, in processing step 307, it is determined whether the input reading Kana exists at the position indicated by the value decreased by "1" from the value of the mask pointer (M), and if it exists, is processing step 308
, 309, the input reading kana is shaded. In the case of second instruction means input, it is determined in processing step 311 whether an input reading kana exists at the position indicated by the mask pointer (M), and if it exists, processing step 312.3
At step 13, the shading of the input reading kana is removed. For example, if the younger brother 1's instruction means is input in the state shown in FIG. 5, the state will be as shown in FIG. 9, and if the fourth instruction means is input in the state shown in FIG. 9, the state will be as shown in FIG. Furthermore, if the third instruction means is input in the state shown in FIG. 5, the state shown in FIG. 10 will be obtained.
Furthermore, when the second instruction means is input, the state returns to the state shown in FIG.

Therefore, by appropriately combining the first to fourth instruction means, it is possible to quickly correct the erroneously inputted gaze kana data. In other words, if there is an incorrect input in a character string that has been entered once, and if the incorrectly input character is located at or near the end of the string, it will be masked one by one from the end of the input string as before. After deleting the corresponding erroneously input characters or inserting new kana data, you can remove the masking mentioned above one character at a time. Stay close! If there are any incorrectly entered characters, you can mask the corresponding characters at once and delete the incorrectly entered characters, or insert new reading and kana data, and then mask as described above. All you have to do is release it at once, and it has excellent operability.

If the input key is determined to be a conversion key in processing step 12 of FIG. It is stored in the buffer for kana-kanji conversion, and converted into a sentence containing kanji and kana in step 50 of the conversion process.For example, if the conversion key is input in the output state shown in Figure 6, "He is Kiji" is stored in the buffer for kana-kanji conversion. '' is stored, and in a conversion process step 50, a sentence containing kanji and kana is created, ``He writes an article'', and the result is output to the display unit 4 as shown in FIG.

FIG. 12 shows the operation flow of the candidate confirmation processing step 80 for the output result.

In processing step 801, the initial value of J is stored as "0",
In step 802, it is determined whether there is shading in the input reading. If it does not exist, store "0" in the terminal (E) and "1" in (M), and perform the initial settings. If there is a shaded area, input the input reading with the shaded area. Go to the beginning of processing steps 804, 805, 8
At 06° 807, the number of shaded characters processing step 808 is stored in the terminal pointer (E), and in the processing step 809, the number of shaded characters +
1 is stored and initialization is performed.0 For example, if the conversion target reading kana input key "ga" is input in the output state shown in FIG. 11, the output state will be as shown in FIG. 13.

〔Effect of the invention〕

The present invention is as described above, and as is clear from the explanation of the illustrated embodiment, according to the present invention, part of the reading kana data input to create kanji-kana mixed characters is changed to the reading intended by the operator. It is possible to obtain an improved kana-kanji conversion device that can correct the incorrectly inputted character more quickly than before when it is not a kana character, and shorten the time required to create a document.

[Brief explanation of drawings]

The drawings show one embodiment of the present invention; FIG. 1 is a flowchart showing the execution operation of the kana-kanji conversion process by the device of the present invention, FIG. 2 is a block diagram of the kana-kanji conversion device of the present invention, and FIGS. FIG. 4 is a flowchart showing the operation of reading kana data input and storage processing, FIGS. 5 to 7, and FIG. 9. FIG. 10 is a diagram showing screen display information, and FIG. 8 is a flow chart diagram showing the operation of mask control processing. FIG. 11 is a diagram showing the screen display information of the conversion result in FIG. 6, FIG. 12 is a flowchart diagram showing the operation of the confirmation process after conversion, and FIG. 13 is a diagram showing an example of the screen display information after the confirmation process. It is. 1... Input section, 2... Control section, 3... Storage section, 4
. . . Display unit, 5 . . . Conversion processing unit. 1', 11' Agent Patent attorney Fuao Nagasaki; -7 '+'i J (1 other person) Figure 2, 3, 40, 1 Is it a pedestal product? Ink (S)
Soft winter JIb Bo 4 > Yu (E) No. 6 Concave power 1 埒t 1 う う ゛ 1 し [False 1]
[Wozu] 170] Female occupation island ho04 Nta (S)
Mask pointer (barrel) No. 7 Figure 717X #t It Moji' Σ
A [)Mecho] I; [Ramiun] 8th Hou 9th / 2 34 56 7 δ 910 Okajima Ho 4
<S) Winter-fat pointer (ε) 70th power ＼ east 1 yon [7th] /
2 3 4 5 6 7 8 9 /. Mother-in-law 15bo'f>7CS) Hate negative omitted Ho ink <E) Early /2 day Yonta' ■ Placement stand゛i bottle h4〉ri (S) Concave force \゛■ Shield %t @4ζi〉 Ri(E)

Claims (1)

[Scope of Claims] 1. An input unit for inputting reading-kana data to be subjected to kana-kanji conversion, means for storing reading-kana data inputted from the input unit in a storage unit, and converting the input reading-kana into kanji-kana. In a kana-kanji conversion device that has a conversion processing unit that converts into a character string, a control unit that controls the execution of kana-kanji conversion, and a display unit that displays the conversion result, all of the readings input from the input unit can be read at once. a first instruction means for excluding the input kana characters from being converted into kanji; a second instruction means for changing the designation of the input kana characters that have been specified as non-conversion objects character by character; a third instruction means for specifying, and a fourth instruction means for making all kana readings of the part specified to be excluded from conversion at once, a mask control processing means for identifying on a display unit Kana pronunciations to be excluded from conversion and Kana pronunciations to be converted;
1. A kana-kanji conversion device comprising: conversion target reading kana data input/retrieval processing means for retrieving reading kana data to be converted from a storage unit. 2. The input unit has a correction means that makes it possible to delete a part of the reading kana that is the conversion target from among the reading kana for which the conversion target reading kana range is specified, or to insert a new reading kana. A kana-kanji conversion device according to item 1 of the scope.