JPH0656844U - Kana-Kanji conversion processor - Google Patents

Abstract

(57) [Summary] [Purpose] To enable smooth conversion and cancellation of input kana character strings. A kana character string input from the key input unit 11 is stored in the input buffer 13, and conversion candidates obtained by converting the kana character string by the conversion dictionary 15 are stored in the candidate buffer 16. Then, the conversion candidate is displayed on the display unit 14.
When the confirmation operation is performed while the conversion candidate is displayed, the conversion candidate is stored in the text memory 18, and the conversion candidate and the corresponding kana character string are deleted from the input buffer 13 and the candidate buffer 16. It

Description

[Detailed description of the device]

[0001]

[Industrial applications]

 The present invention relates to a kana-kanji conversion processing device for converting an input character string into a mixed kanji character string.

[0002]

[Prior art]

 Conventionally, in a word processor, when a conversion key is operated after a kana character string is completely input, the kana character string is converted into a conversion candidate character string containing kanji and displayed.

[0003]

[Problems to be solved by the device]

 If, after displaying the conversion candidate character string converted as described above, it is found that this conversion candidate character string has an error, the error may be an input error of the kana character string. In such a case, specify the erroneous conversion candidate character string, restore this conversion candidate character string to the original kana character string, and then delete or add characters to this kana character string. It will be necessary to carry out correction work. For example, when a conversion candidate has an error, a desired conversion result may be obtained only by deleting a part of the input kana character string corresponding to the candidate. In such a case, conventionally, the key operation for returning the conversion candidate character string to the original kana character string and the key operation for deleting the kana character string were completely independent. Even in such a case, the key operation for returning to the kana character string and the key operation for deleting a part of the kana character string must be performed separately, and there is a problem that a smooth correction operation cannot be performed. The problem of the present invention is to return the conversion candidate character string to the original kana character string and delete the kana character string even after converting the input kana character string to the kana kanji conversion candidate character string. It should be easy to do.

[0004]

[Means for Solving the Problems]

 The means of the present invention are as follows. Input a character string, display this input character string, convert the above input character string into a conversion character string containing Chinese characters, display this conversion character string, and display the above when a specific operation is performed. When the conversion character string displayed on the display screen is changed to the input character string before conversion of the conversion character string and displayed, and when the above-mentioned specific operation is further performed after the change display, It is characterized in that the changed and displayed input characters are deleted.

[0005]

[Action]

 The operation of the means of the present invention is as follows. Input a character string, display this input character string, convert the above input character string into a conversion character string containing Chinese characters, display this conversion character string, and display the above when a specific operation is performed. When the conversion character string displayed on the display screen is changed to the input character string before conversion of the conversion character string and displayed, and when the above-mentioned specific operation is further performed after the change display, Delete the input characters that have been changed and displayed. Therefore, even after converting the input kana character string to the kana-kanji conversion candidate character string, by performing a specific operation continuously, this conversion candidate character string is returned to the original kana character string, and Kana character strings can be deleted.

[0006]

【Example】

The present invention will be described in detail below with reference to an embodiment shown in FIGS. The present embodiment shows an example applied to a word processor. Structure FIG. 1 is a block circuit diagram showing the basic structure of this word processor. In the figure, numeral 11 is a key input section. In addition to character keys and the like, a conversion key KA for specifying kana-kanji conversion, a non-conversion key KB for fixing kana characters without kana-kanji conversion, and kanji candidates will be described later on this keyboard. Enter key KC to transfer to the text memory to confirm, Release key KD to cancel the function currently being executed, Left cursor key KE to move the cursor position to the left, Right cursor key KF to move the cursor position to the right Is provided. The key code output from the text memory 1 corresponding to the operation key is input to the CPU (central processing unit) 12.

The CPU 12 controls execution of text creation processing, editing processing, display / print processing, etc. according to a microprogram stored in advance. That is, the CPU 12 stores the input kana character string data in the input buffer 13 and displays the character string data in the input buffer 13 on the display unit 14. In this case, the input buffer 13 can store unconverted kana character string data of, for example, 78 characters, and this character string data is displayed in the input display area IDA of one line provided in the display unit 14. . In addition, the CPU 12 converts the kana character string data in the input buffer 13 into kana-kanji characters for each phrase using the conversion dictionary 15 in response to the operation of the conversion key KA and stores the kana-kanji characters in the candidate buffer 16 and the display unit 14 Is displayed in the input display area IDA. In this case, the phrase management data for managing the kana-kanji converted phrases is stored in the phrase management buffer 17. Further, the CPU 12 confirms the conversion candidate character string data in the candidate buffer 16 and stores it in the text memory 18 in response to the operation of the confirm key KC, and deletes the confirmed data from the candidate buffer 16. The text memory 18 is composed of a random access memory, stores fixed sentences for a plurality of pages, and the contents thereof are read out under the control of the CPU 12 in response to a print command from the key input unit 11 and printed by a thermal printer or the like. It is printed on the recording paper P set in the section 19.

The contents of the input buffer 13, the candidate buffer 16, and the phrase management buffer 17 are processed in phrase units according to the values of the corresponding pointers N ₁ , E ₁ , N ₂ , E ₂ , N ₃ , and E ₃ . The pointers N ₁ , N ₂ and N ₃ correspond to the input buffer 13, the candidate buffer 16 and the pointer indicating the head position of the designated phrase in the phrase management buffer 17, and the pointers E ₁ , E ₂ and E ₃ correspond to them. It is a pointer that indicates the final position of the data stored in the input buffer 13, the candidate buffer 16, and the phrase management buffer 17. The cursor pointer 20 is a pointer for designating each character in the input buffer 13 and each candidate buffer 16 for each phrase, and the unconverted pointer 21 is one of the unconverted data in the input buffer 13. This is a pointer indicating the start position of the converted kana character string data. The clause management buffer 17 stores the values of the Y register and the K register for each clause. The Y register and the K register are arithmetic registers for obtaining the phrase management data.

Next, the contents stored in the phrase management buffer 17 will be specifically described with reference to FIG. The phrase management buffer 17 is composed of 1 phrase and 3 bytes, and the first byte corresponds to the number of characters (read length) included in the character string data in the corresponding phrase of the input buffer 13 and the second byte corresponds to the candidate buffer 16. The number of characters (candidate length) included in the character string data in the clause is stored in the third byte. In this case, as an attribute code, an attribute (*) indicating that kana-kanji conversion has been completed, or when the release key KD is operated during kana-kanji conversion, the conversion candidates are returned to the state before the conversion and set to the kana input ready state. There is an inputable attribute (?) That indicates that something was touched.

[0010] Operation Now, the operation of the present embodiment concrete described with reference to the display content corresponding to the key operations shown in FIG. FIG. 3A shows a state in which the input kana character string data stored in the input buffer 13 is displayed in ID A. When the conversion key KA is operated in this state, kana-kanji conversion is performed, and conversion candidate character string data shown in FIG. 3B is displayed in the input display area IDA.

<Kana-Kanji Conversion Processing> When the conversion key KA is operated, the operation according to the flow shown in FIG. 4 is executed. That is, kana-kanji conversion is performed by cutting out character string data for one phrase based on the longest matching method from the unconverted head character in the input buffer 13 designated by the unconverted pointer 21 (step A1). The one-phrase candidate character string thus converted is stored in the candidate buffer 16 (step A2). When the kana-kanji conversion for one phrase is performed, the values of the pointers N ₁ , N ₂ and N ₃ corresponding to the input buffer 13, the candidate buffer 16 and the phrase management buffer 17 are incremented (step A3). That is, the value of the pointers E ₁ , E ₂ and E ₃ (initially “0”) is incremented by “1” and the result is set to the corresponding pointers N ₁ , N ₂ and N ₃ , so that The start position is updated. As a result, “1” is initially set in each of the pointers N ₁ , N ₂ and N ₃ . Then, the number of characters (the number of readings) included in the kana character string data of the phrase in which the kana-kanji conversion is performed is set in the Y register, and the number of characters (candidate length) included in the conversion candidate character string data is set in the K register (step A4). ). Now, the kana character string data "Fukubunsetsu" for the first 1 phrase has a "reading number" of 7 characters, and the conversion candidate character string data "complex phrase" has a "candidate length" of 4 characters. Therefore, "7" is set in the Y register and "4" is set in the K register. Then, the values of the pointers E ₁ , E ₂ and E ₃ corresponding to the input buffer 13, the candidate buffer 16 and the clause management buffer 17 are incremented (step A5). In this case, the value of the Y register is added to the pointer E ₁ , the value of the K register is added to the pointer E ₂ , and “3” is added to the pointer E ₃ to update them. As a result, the value of the pointer E ₁ is “7”, the value of the pointer E ₂ is “4”, and the value of the pointer E ₃ is “3”. Then, sequentially set from the position shown "reading number" in the Y register (7) and the K candidate length in the register (4) pointer N ₃ in clause management buffer 17 (step A6), and the attribute code ( *) Is set to the position of the phrase management buffer 17 indicated by the pointer E ₃ (step A7). After setting the phrase management data in the phrase management buffer 17 in this way, the value of the unconverted pointer 21 is updated so that the value of the unconverted pointer 21 becomes the leading position of the unconverted kana character string data in the input buffer 13. (Step A8). As a result, the value of the unconverted pointer 21 is updated from "0" to "8". Then, it is checked whether or not the unconverted kana character string data remains in the input buffer 13 (step A9), and if there is, the process returns to step A1 to extract the unconverted kana character string data for the next one phrase and convert the kana-kanji character. I do. Thereafter, the above-described operation is repeatedly executed for each phrase, and when the conversion of all the contents of the input buffer 13 is completed, the process proceeds to the next step A10, and is displayed in the input display area IDA of the display unit 14. Among the conversion candidate character string data in the candidate buffer 16, the character string data for the number of characters (three characters) in the K register from the position indicated by the value of the pointer N ₂ is particularly displayed as a dummy display. Fig. 3 (B) shows this state. The "conversion" of the last clause is displayed in appearance, underline is added under all the displayed conversion candidate character string data, and It indicates that the data is a conversion candidate.

<Intermediate Processing> Now, by operating the cancel key KD, it is assumed that the conversion candidate character string data “of compound phrase kana-kanji mixed conversion” is corrected to “compound phrase kana-kanji”. In this case, by operating the release key KD four times in succession, the conversion candidate character string data changes as shown in FIGS. 3B to 3F, and the desired correction can be made.

That is, when the release key KD is operated, the operation according to the flow of FIG. 5 is executed, and when the operation according to the flow of FIG. 5 is repeated four times, the contents of the candidate buffer 16 and the clause management buffer 17 are changed. Changes as shown in FIGS. 6 (A) and 6 (B).

Next, when the “Kana-Kanji of compound phrase” shown in FIG. 3 (F) is modified to “Kana-Kanji conversion of compound phrase”, first, in the display state shown in FIG. When a column is input, the input character string is highlighted as shown in FIG.

If the left cursor key KE is operated several times in this state, the display state shown in FIG. 3 (K) is obtained. After that, when the non-conversion key KB is operated, the designated phrase is returned to the kana character string, as shown in FIG. The contents of the candidate buffer 16 and the clause management buffer 17 at this time are shown in FIGS. 6 (C) and 6 (D).

<Confirmation Processing> In this state, when the confirmation key KC is operated to confirm the character string from the beginning to the middle of the conversion candidate character string data, the operation according to the flow of FIG. 7 is executed. First, the character string data from the start position of the conversion candidate character string data in the candidate buffer 16 to the specified phrase is read and stored in the text memory 18 (step D 1). In this case, the final character position of the designated clause is obtained as follows. Now, specified clause as shown in FIG. 3 (L), is displayed shaded "kana", and since N ₂ position is the first character "or" in the specification clause, the value of this pointer N ₂ Add the number of characters in the phrase (K register value). Then, the N ₂ position becomes the start position of the next clause. Thus, N ₂ position by subtracting "1" from the addition result becomes the final character position of the specified clause.

In this way, when the character string data from the start position of the conversion candidate character string data to the specified phrase is stored in the text memory 18, the reading character string up to (cursor pointer + Y−1) is input from the input buffer 13. Delete (step D2). That is, the kana character string data up to the character position obtained by adding the value of the Y character to the value of the cursor pointer 20 (N ₂ position) and subtracting “1” from the addition result is input to the input buffer 13 Remove from. Then, the conversion candidate character string data stored in the text memory 18 from the candidate buffer 16 as described above is deleted from the candidate buffer 16 (step D3). Next, the value of the pointer E ₂ is decremented by the number of deleted characters (step D4), and the contents of the phrase management buffer 17 are added from the beginning to the specified phrase, that is, "2" is added to the value of the pointer N ₃ . Delete up to the (N ₃ +2) th byte (step D5). Then, the value of the pointer E ₃ is decremented by the number of deleted bytes (step D6), and then the pointers N ₂ and N ₃ are set to "1" (step D7).

When the confirm key KC is operated in this way, the character string data from the beginning of the conversion candidate character string data to the specified phrase is confirmed and stored in the text memory 18, and the confirmed character string data is stored in the candidate buffer. 16 is deleted, and correspondingly, the unconverted kana character string data in the input buffer 13 is deleted. FIG. 3 (M) shows the display state in this case.

<Other Processing> In the state of FIG. 3 (M), if the right cursor key KF is operated once, the display state shown in FIG. 3 (N) is obtained, and the cursor is positioned at the head position of the unconverted kana character string data. Is set. That is, as with the left cursor key KE described above, the cursor moves in phrase units on the conversion candidate character string data and in character units on the unconverted kana character string data, so the right cursor key KF is pressed. Only by operating it once, the result is as shown in FIG.

As described above, when the conversion key KA is operated with the cursor set at the start position of the unconverted kana character string data, the operation according to the flow of FIG. 4 is executed. Is converted into candidate character string data mixed with Chinese characters, as shown in FIG. 3 (O), and the desired correction content is obtained.

After the correction is performed in this manner, the kana character string that follows the kana character string is input thereafter (see FIG. 3 (P)). Then, when the conversion key KA is operated, the inputted kana character data is converted into candidate character string data containing kanji, and the result becomes as shown in FIG. 3 (Q).

If this display candidate is correct, the enter key KC is operated. Then, as a result of the operation according to the flow of FIG. 7, the conversion candidate character string data is determined and stored in the text memory 18.

As described above, in the present embodiment, when the conversion candidates are confirmed, if the confirmation key KC is operated for the time being when the candidates up to the middle are checked, the specified phrase starts from the beginning of the conversion candidate character string data. The character strings up to are fixed. Therefore, if there are long conversion candidates, it is not easy to check all of them, but at the stage when the check up to the middle is completed, you can make a cut for the time being, and the sentence check work can be done quickly and reliably. You can do it. Also, since the conversion candidates up to that point can be confirmed when the check up to the middle is completed, even if the number of characters that can be converted at one time is limited, do not be aware of it and perform input operation. You can In the above embodiment, the conversion candidate character string data is specified in units of phrases, but it may be specified in units of characters.

[0024]

[Effect of device]

 According to the present invention, even after the input kana character string is converted into the kana-kanji conversion candidate character string, the conversion candidate character string is converted into the original kana character string by continuously performing a specific operation. , And delete this Kana character string.

[Brief description of drawings]

FIG. 1 is a block diagram of an embodiment.

FIG. 2 is a diagram illustrating stored contents of a phrase management buffer.

FIG. 3 is an explanatory diagram of a display state.

FIG. 4 is a flowchart of a conversion operation.

FIG. 5 is a flowchart of a release operation.

FIG. 6 is a diagram illustrating stored contents of a candidate buffer and a clause management buffer.

FIG. 7 is a flowchart of a confirming operation.

[Explanation of symbols]

 11 key input unit 13 input buffer 14 display unit 15 conversion dictionary 16 candidate buffer 17 document management buffer 18 text memory

Claims (1)

[Scope of utility model registration request] 1. A means for inputting a character string and displaying the input character string, a means for converting the input character string into a converted character string containing kanji, a means for displaying the converted character string, and a specific character string. A means for changing the converted character string displayed on the display screen to an input character string before conversion of the converted character string when the operation is performed, and displaying the changed character string; A kana-kanji conversion processing device characterized by deleting the input character string that has been changed and displayed when a specific operation is performed.