JPS62123558A - Kana-to-kanji converter - Google Patents

Abstract

PURPOSE:To omit the switch of the conversion unit with KANA (Japanese syllabary)/KANJI (Chinese characters) conversion between the sentences of different conversion units, by actuating a KANA/KANJI converting means against a non-converted character string obtained after the conversion is fixed under the control of the 2nd conversion designating means. CONSTITUTION:A processor 2 stores the input KANA code in an input buffer 4 and displays the corresponding KANA at a display part 3. When a conversion key 1-1 is pushed, the processor 2 performs the KANJI conversion and displays the candidate data at the part 3. When the buffer 4 stores the input characters, a paragraph mode flag 2-1 is set at 1 for execution of the paragraph conversion. While a single KANJI mode flag is equal to 1 when no input characters is stored in the buffer 4. Thus the single KANJI conversion is carried out. It is decided for execution of KANJI conversion whether the character codes stored in the buffer 4 are converted into KANJI for each paragraph or the KANA stored in a document memory 5 storing the fixed sentence data is converted into KANJI for each KANJI unit.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a word processor, and more particularly to a kana-kanji conversion device that performs kana-kanji conversion by controlling a circuit that converts unconverted kana character strings into kanji.

[Conventional technology]

Japanese word processors are used in various fields because they can correct input errors and edit sentences. Japanese word processors currently in use have a kana-kanji conversion function that inputs kana and converts the input kana to kanji.

Kana-Kanji conversion is divided into multiple phrase conversion, bunsetsu conversion, and single kanji conversion, but most word processors have functions beyond phrase conversion.

For example, sentences input in bulk in kana are converted sequentially from the beginning of the sentence in units of clauses.

In such compound clause conversion and bunsetsu conversion, kana is converted into kanji in sequence, so if there is no kanji that matches the input kana, the kanji will be temporarily determined to be the wrong kanji, or the part will be left as kana. After the conversion was completed, I entered the kana again to perform single kanji conversion, etc. - In boat fishing, phrase conversion and single kanji conversion are specified by the operator operating the word processor, so for sentences that contain a mixture of words that cannot be converted using phrase conversion, single kanji conversion mode and phrase conversion mode can be used. I switched and used it. As a result, a problem has arisen in which operations become complicated. Similar problems have also occurred in word processors that can perform compound clause conversion.

[Purpose of the invention]

In view of the above-mentioned conventional drawbacks, the present invention aims to provide a kana-kanji conversion device that does not require switching operations of conversion units when converting sentences with different conversion units into kana-kanji and can perform conversion processing at high speed.

[Key points of the invention]

In order to achieve the above object, the present invention provides a first conversion specification means for specifying conversion of kana to kanji in a conversion unit with a large number of conversion kana characters, and a conversion unit of conversion from kana to kanji with a small number of conversion kana characters. and a kana-kanji conversion means for converting kana into kanji, and the method includes a second conversion specification means for specifying conversion into kanji, and a kana-kanji conversion means for converting kana into kanji, and for an unconverted character string before the conversion is confirmed, the above-mentioned conversion specification means is controlled by the first conversion specification means. The kana-kanji conversion means operates, and the kana-kanji conversion means operates under the control of the second conversion designation means for the unconverted character string after the conversion is confirmed.

And its action is as follows.

In a Japanese word processor, the kana-kanji conversion means for converting kana to kanji is controlled by a first conversion specifying means to first perform conversion in units of conversion having a large number of converted kana characters, and then controlled by a second conversion specifying means. Conversion Kana Conversion is performed in conversion units with a small number of characters. In particular, the second conversion specifying means specifies converting kana characters after the cursor position of the fixed phrase displayed on the display unit where the Japanese word processor is located into kanji characters.

〔Example〕

Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is a circuit diagram of an embodiment of the present invention.

The key manual section 1 has keys necessary for a Japanese word processor. For example, the Kana key, and the conversion key 1-1 that specifies converting to kanji after inputting the kana, and the next candidate is specified when the candidates displayed by pressing the conversion key 1-1 do not match. Next candidate key 1-2, confirmation key 1-3 that is confirmed when the displayed candidate is the desired kanji when a candidate or next candidate is displayed.
and release keys 1-4 for canceling the designation of the conversion mode. In response to the depression of a key of the key human power section 1, the key human power section outputs the code of that key to the processor (CPU) 2. When the code of the pressed key is added, the processor 2 performs control processing corresponding to that key using an internal program. Since the embodiment of the present invention is a Japanese word processor, the processor 2 performs a process of storing the input kana code in the input cover sofa 4 and displaying the corresponding kana on the display section 3, for example. When the conversion key 1-1 is pressed and the code corresponding to the conversion key 1-2 is added to the processor 2, the processor performs kana-kanji conversion, which will be described later, and displays candidate data on the display unit 3. The processor unit 2 has a bunsetsu mode flag 2-1 and a single kanji mode flag 2-2, and when an input character exists in the input buffer 4, the bunsetsu mode flag 2-1 becomes "l".
” and phrase conversion is performed.Also, when there is no input character in input buffer 4, the single kanji mode flag becomes “1” and single kanji conversion is performed.In this case, input buffer 4
Since there are no characters in , the kana of the final text data stored in the document memory 5 is converted. The character number counter 6 counts the number of unconverted kana characters stored in the input cover sofa 4, and a determination section 7 to which this counter 6 is added determines whether or not there are input characters in the input cover sofa 4. The present invention converts the kana character code stored in the above-mentioned input cover sofa 4 into kanji in units of bunsetsu, or converts the kana character codes stored in the document memory 5 in which fixed sentence data is stored into kanji in units of kanji. , and performs kana-kanji conversion. As will be described later, even in the phrase conversion mode, when the character code data stored in the input cover sofa 4 is too small to form a phrase, single kanji conversion is performed.

FIG. 3 is a flowchart of the operation processing of the embodiment of the present invention for the conversion key, and FIG. 4 is a flowchart of the operation processing for the confirmation key and numeric key. Below, Figures 3 and 4
The operation shown in FIG. 1 will be explained in detail using the flowchart shown in the figure.

When the conversion key 11 of the key human power section 1 is pressed, the conversion key 1-
When the key code corresponding to 1 is added to bromo, tsu2,
Execute the process S1(K) in FIG.

First, a determination S1 is made as to whether or not the character number counter 6 is O. As mentioned above, each time the kana key code data added by the key input section 1 is stored in the input cover sofa 4, the character number counter 6 advances by the number of kana code data. The number of Kana character bones that have been converted will count down. Therefore, this discrimination S
Y when it is determined that the character number counter is 0 by 1
(YES) means that the code data to be converted does not exist in the input buffer 4, and conversely, when it is not O, it means that the code data to be converted does exist in the input buffer 4. is made by the judgment section 7 in FIG. 1, and the result is sent to the processor circuit 2.
In addition to this, the following processing is performed. When it exists, that is, when the character number counter 6 is not 0 (N (No)), a process of converting the kana data stored in the human cover sofa 4 into kanji is performed thereafter. First, a control signal from the processor 2 is applied, and the processor circuit 2 instructs the input selector 8, which selects the output of the document memory 5 or the input buffer 4, to select the large cover sofa 4 (S2).

Then, the output of the input buffer 4 selected by the input selector is selected by the converter selector 9 and output to the phrase converter 10 or the single kanji converter 11.

This selection is controlled by a selection signal output from processor 2. Note that in a state where data is stored in the input cover sofa 4, phrase conversion is performed at first, so at this time, the converter selector 9 adds the output of the input cover sofa 4 to the phrase converter 10. By adding this data, the phrase converter 10 performs phrase conversion processing S3. Clause converter 1
The phrase conversion processing S3 performed by the phrase converter S3, for example, breaks down the phrase into prefixes, independent words, suffixes, adjunct words, etc., and selects candidates for each by referring to a dictionary memory (not shown) possessed by the phrase converter. This process converts phrases into phrases that include kanji. The result of the conversion by the clause converter 10 is applied to the judgment unit 12, and the judgment unit 12 determines whether or not the clause conversion was possible (S4). For example, it is impossible to perform bunsetsu conversion when only one kana character is input, so the determining unit 12 (processing S4) determines when such conversion is not possible. The result is then applied to processor 2.

The processor 2 judges this result, and if it becomes impossible, controls the single kanji conversion process S5. Note that this control is a control in which the output of the large saw selector 8 is output to the single kanji converter 11 by the converter select 9. This control causes the single kanji converter 11 to operate. In the determination process S4, if Y (YES) or N (No
), after executing the single kanji conversion process S5, the process of specifying the bunsetsu mode flag 2-1 to the bunsetsu conversion mode is performed (S
6).

That is, processing is performed with the phrase mode flag set to 1. Note that the above-described processes 32 to S5 are the processes in the phrase conversion mode, but in the embodiment of the present invention, the phrase conversion mode is specified at this point. Naturally, it may be performed, for example, immediately after the determination process S1.

After the phrase mode flag is set by the processor 2, there is a process of storing the converted data added via the determination section 12 from the phrase converter 10 or the single kanji converter 11 via the determination section 12 into the candidate data memory 13. Perform S7. This process S7 is also performed under the control of the processor 2. As a result, the candidate data memory 13 stores, for example, a plurality of phrases and kanji as candidates. The stored candidates are first output to the processor 2, and the processor 2 outputs the character code data to the display unit 3 for display (S8). When this candidate display process S8 is finished, the process for the conversion key is finished.

On the other hand, in the determination S1 of whether or not the character number counter 6 is 0, when it is determined that it is 0 (Y), the processor 2 applies a control signal for selecting the document memory 5 to the input selector 8, and is selected (S9). In addition to displaying the character code data output from the processor 2, the display unit 3 has a function of displaying a cursor at a position specified by the address data output from the cursor address memory 14, and displays the value of the counter 4. When is 0, the sentence pointed to by this cursor is converted to kanji.

The contents of the document memory and the contents displayed on the display section 3 always have a one-to-one correspondence, for example, page by page, and since the output of the cursor address memory 14 is also added to the document memory 5, instructions can be given using this address data. The content of the converted document is output to the input selector 8, and is input to the single kanji converter 11 via the converter register 9, where it is converted into kanji (S
10).

The cursor address memory is controlled by the processor 2, and is sequentially changed and displayed when, for example, a kana character is input or a cursor movement key is pressed. Although not shown, the document memory 5 has a succession circuit that reads out at least one or more kana after the position specified by the address data added from the cursor address memory 14, and this single kanji conversion process When StO is operating, subsequent character data is output one after another. The single kanji conversion in the embodiment of the present invention is, for example, a single kanji conversion using the so-called longest match method, which preferentially converts up to five kana characters into a single kanji. Therefore, in the above-mentioned hiragana/kanji conversion processing SIO after the cursor position, if five kana characters exist in the document memory in succession,
The first candidate kanji to be detected is the kanji corresponding to the five kana characters. If there is no kanji that corresponds to the five kana characters, the next kana number, that is, the kanji character that corresponds to the four kana characters, becomes a candidate. The same applies to lower kana characters.

After the single kanji conversion process SIO of hiragana after the cursor position, processing S1 determines whether conversion into kanji is possible or not, that is, whether conversion has been performed.
l is done. If not converted, N indicates that the characters after the cursor position are kanji or characters that cannot be converted to kanji (numbers or “
Since this is a hiragana (such as "wo", "n", etc.), the conversion process has meaning, and the process ends.

The above-described discrimination process Sll is similar to the above-described discrimination process S4, and is performed by the judgment unit 12.

Therefore, when the conversion is possible, the processor 2 next performs processing S12 in which the single kanji mode flag is set to 1. Then, as in the case of phrase conversion described above, processing continues from step S7.

Similar to the operation processing flowchart for the conversion key shown in FIG. 3, when the converted candidate kanji is not the desired kanji, the next candidate pressed next is also processed. Note that at this time, although not shown, a work memory provided in the processor 2 for processing the next candidate is used.

Through the above-described operations, when the conversion key 1-1 is pressed, the processing contents change depending on the state in which the conversion key 1-1 is pressed, and single kanji conversion or bunsetsu conversion is performed. In particular, in the embodiment of the present invention, it is determined whether or not there is data in the input buffer 4, and if there is data, phrase conversion is performed, and if there is no data, single kanji conversion is performed.

In particular, single kanji conversion performed when no data exists in the input buffer 4 can convert the kana portion of document data that has been determined and stored in the document memory 5 into kanji. FIG. 4 is a flowchart of the document confirmation operation when the confirmation key 1-3 or the selection numeric key corresponding to the candidate display is pressed.

When the confirm key 1-3 or the numeric key is pressed, the corresponding processes SKK and SSK are started.

Although the start input for this process is different, the process itself is exactly the same. First, a process S1 is performed to determine whether the conversion key has been previously pressed and the conversion mode is currently in progress.
3 is done. For example, if a numeric key or the like is pressed while the conversion key is not pressed, it is determined that the conversion mode is not present (N) in the determination process S13, and another process SB (not shown) is executed. When the conversion mode is in effect (Y), next, a distortion force determination process S14 is performed to see if there is candidate data. Even if the conversion key is pressed and the conversion mode is set, there may be cases where there are no kanji characters that can be candidates in the conversion process described above, so the determination process 14 determines this. Since the operation flowchart shown in FIG. 4 is a confirmation process, when there is no candidate data (N), there is no process in this flow, and another separate process SB is executed. If it is determined in the determination process 514 that there is candidate data (Y), then a determination process S15 is performed to determine whether or not the phrase mode is set.

When in phrase conversion mode (Y), processing in phrase conversion is performed. First, the converted data in the input cover sofa 4 is deleted 816, and the candidate data is stored in the document memory 5 (S1
7). Then, after deleting 818 the candidate data in the candidate data memory 1.3, the process S1 of decrementing the character number counter
Do 9. Since the data to be converted is deleted in the process S16 described above, the deleted number is reduced by the character number count reduction process described above. The output of the candidate data memory 13 is added to the document memory, and the numerical data determined is sequentially output to the document memory and stored under the control of the processor circuit 2. Through these processes SL6 to S19, the kanji conversion confirmation process is performed in units of clauses. Since phrase conversion does not necessarily apply to all input kana, next a determination process S20 is performed to determine whether the content of the character number counter 6 is 0 or not. In the embodiment of the present invention, this determination is made by the determining section 7. When there is data stored in the input buffer 4, character conversion is first performed, so when the content of the character number counter 6 is not O (N) in the determination process S20, the next character conversion for the remaining kana is performed. Phrase conversion processing S21 is performed.

Also, when it is O (Y), the clause conversion mode is canceled S
22. After performing these processes 321 and 322, the main confirmation process ends.

The phrase mode determination process 315 described above ultimately determines the process performed depending on whether or not a kana is present in the entry cover sofa 4. Because character number counter 6
Each conversion data designation process S6. This is because S12 is selected and executed, and the confirmation process is executed by pressing the confirmation key depending on the result of conversion in that mode. Therefore, clause conversion mode determination processing S1
When the phrase conversion mode is not in step 5 (N), processing for converting kana in the document memory into kanji is performed.

First, since the candidate character has been confirmed (the data is stored in the candidate data memory 13 because the confirm key was pressed), the candidate character is deleted after performing the process S23 of deleting the converted data in the document memory 5. A process S24 is performed to store the file in the document memory 5.

This will convert the kana after the cursor to kanji. However, when it is not in the clause conversion mode, that is, when it is in the single kanji mode, only one kanji is converted from kana, so in this case, it is further determined whether or not a kana follows the converted kanji. If it continues, the single kanji conversion must be performed again. This is because if the process ends here, the cursor must be moved and the conversion key 1-1 pressed again. In order to prevent such a situation, in the embodiment of the present invention, a process S25 is performed to detect the kana following the conversion process. When there is no kana that follows (N), it is further searched to see if there is a kana in the subsequent sentence or phrase (S2
6) Do. Then, the search results are determined in determination processing S27.

When it is determined that there is no kana in the kana presence/absence determination process 327 (N), the single kanji conversion mode is canceled (328), and then all processes are terminated.

On the other hand, when the next character is a kana in the discrimination process S25 (Y), or when it is determined in the search process S26 that there is a kana in the discrimination process S27 (Y), the character corresponding to the contrasting kana is Kanji conversion processing 329 is performed. Then, the converted data is stored in the candidate memory S30 (S30)
At the same time, candidate display processing S31 is performed, and the processing ends.

Note that these processes S30. S31 is the process S7 described above.
゜Same as S8. In the above-described confirmation process, when all the kana to be compared are converted to kanji, the phrase conversion mode or single kanji conversion mode is canceled and the process ends. However, if there are further kana to be converted into kanji in the one-phrase conversion mode or the single kanji conversion mode, the remaining kana are converted and displayed, and the process ends.

Therefore, even if the user presses the confirm key, the remaining kana characters are automatically converted to kanji and displayed, so that conversion can be performed simply by pressing the confirm key again to the desired kanji.

FIG. 2 is an explanatory diagram of the operation of converting kana to kanji in the embodiment of the present invention. As shown in FIG. 2 (A), when "Kontoki" is inputted and stored in the document memory 5, and then the phrase "Wagashi Expenses" is inputted, the conversion key 1-1 is pressed.
By pressing , it is converted into the kanji ``This time, our company'' shown in Figure 2 (B) and displayed; the under par in the figure represents the phrase that is currently being converted. Since this is the desired kanji, when the operator presses the confirm key, the sentence is confirmed and a cursor is displayed after the sentence as shown in FIG. 2(C). For example, if the operator thinks that "tabi" in the sentence "Kontoki," should be written in kanji,
Press the cursor key Ajiyo to move the cursor to the position of ``ta'' in 1 (Fig. 2 D), and press the conversion key to select the candidate kanji corresponding to ``ta'' and the following ``bi''. “Degree” and “Travel” are displayed. In the case of the conversion mentioned above, ``Our Company'', there was only one candidate, so the conversion result is displayed in the displayed sentence, but in the case of ``Tabi'', etc., there are multiple candidate kanji, so the displayed sentence displayed below. And since ■ is the desired kanji, Figure 2 (F)
As shown in the figure, “tabi” changes to “degree” by pressing the mouth key.
and inserted into the sentence.

As described above, the present invention performs conversion by switching the conversion mode depending on the number of characters in the input buffer. However, in general, the present invention is not limited to this. For example, a flag is set for each character in the document memory, and for example, bunsetsu conversion is performed for undetermined kana, and single kanji conversion is performed for determined kana. It is possible to do the following. In addition, the first conversion in bunsetsu conversion mode and the subsequent conversion in single kanji conversion mode can be compared to the cursor shift key [controlling with the old operation, skipping kanji to the kana part with day operation, etc. By doing so, it is possible to further reduce the number of conversion operations.

Furthermore, although bunsetsu conversion and single kanji conversion are used in the present invention, the present invention is not limited to this, and is not limited to compound bunsetsu and bunsetsu, sentences, compound bunsetsu, bunsetsu,
It is also possible to do it in the order of single kanji, etc.

〔Effect of the invention〕

As mentioned above, the present invention not only converts input kana in units of clauses or single kanji, but also converts input kana into kanji again if it is kana, even if it is stored as a document. According to the present invention, it is possible to obtain a kana-kanji conversion device that eliminates the need for a conversion unit switching operation in kana-kanji conversion of sentences with different conversion units, and can perform conversion processing at high speed.

[Brief explanation of drawings]

Fig. 1 is a circuit configuration diagram of an embodiment of the present invention, Fig. 2 is a detailed explanatory diagram of the invention, Fig. 3 is a flowchart of operation processing for conversion keys, and Fig. 4 is a flowchart of operation processing for confirmation keys and numerical keys. It is. ■...Keyboard, ■-1...Conversion key, 1-3...Confirmation key, 2...Processor circuit 4...Input cover sofa, 5...Document memory, 6...Character number counter , 7... Judgment unit, 8... Input selector, 9... Converter selector, 10... Phrase converter, 11... Single kanji converter, 12... Judgment unit, 13...・Candidate data memory. Patent Applicant Casio Computer Co., Ltd. Published by A\J≦n
Tsukime Jukai's ΔKai ~ Bow Figure 2 Figure 3

Claims (3)

[Claims] (1) In a Japanese word processor, the first conversion specification means specifies converting kana to kanji in a conversion unit with a large number of conversion kana characters, and specifies converting kana to kanji in a conversion unit with a small number of conversion kana characters. It has a second conversion specification means and a kana-kanji conversion means for converting kana into kanji, and the kana-kanji conversion means operates under the control of the first conversion specification means with respect to the unconverted character string before the change is confirmed. . A kana-kanji conversion device, wherein the kana-kanji conversion means operates on the unconverted character string after the change is confirmed, under the control of the second conversion designation means. (2) The kana-kanji conversion means is comprised of a single-kanji conversion means and a bunsetsu conversion means, the first conversion specification means specifies conversion by the clause conversion means, and the second conversion specification means is the single-kanji conversion means. 2. A kana-kanji conversion device according to claim 1, characterized in that the conversion is specified by the following. do. (3) The second conversion specifying means specifies converting kana to kanji after the cursor position displayed on the display unit of the Japanese word processor. Kana-kanji conversion device.