JPH0749870A - Japanese syllabary-chinese character conversion processing method - Google Patents

Abstract

PURPOSE:To smoothly perform a converting process and a resetting process for an inputted KANA (Japanese syllabary) character string. CONSTITUTION:The KANA character string which is inputted from a key input part 11 is stored in an input buffer 13 and a conversion candidate obtained by converting the KANA character string by using a conversion dictionary 15 is stored in a candidate buffer 16. The conversion candidate ate displayed at a display part 14. When determining operation is done while the conversion candidate is displayed, the conversion candidate is stored in a text memory 18 and the conversion candidate and corresponding KANA character string are deleted from the input buffer 13 and candidate buffer 16.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion processing method for converting an input character string into a mixed kanji character string.

[0002]

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

[0003]

When it is found that there is an error in the conversion candidate character string after the conversion candidate character string converted as described above is displayed, the error is input in the kana character string. May be wrong. In such a case, the conversion candidate character string having the error is designated, the conversion candidate character string is returned to the original kana character string, and then the character is deleted or the character is added to the kana character string. Will be corrected. For example, when there is an error in a conversion candidate, a desired conversion result may be obtained by simply deleting a part of the input kana character string corresponding to the candidate. In such cases, conventionally,
Since 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 the case like the above, the kana character string There has been a problem that the key operation for returning and the key operation for deleting a part of the kana character string have to be performed separately, and smooth correction work cannot be performed. An object of the present invention is to return the conversion candidate character string to the original kana character string even after converting the input kana character string to the kana kanji conversion candidate character string, and to easily delete the kana character string. To be able to do it.

[0004]

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 display screen when a specific operation is performed. The converted character string displayed above is changed to the input character string before conversion of the converted character string and displayed, and after the changed display, when the specific operation is further performed,
It is characterized in that the changed and displayed input characters are deleted.

[0005]

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 display screen when a specific operation is performed. The conversion string displayed above is changed to the input string before conversion of the conversion string and displayed, and after the above change display,
Further, when the specific operation is performed, the changed and displayed input character is deleted. Therefore, even after converting the input kana character string to the kana-kanji conversion candidate character string, by performing a specific operation continuously, the conversion candidate character string is returned to the original kana character string, and You can delete a character string.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be specifically described below based on 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, reference numeral 11 denotes a key input section. In addition to character keys and the like, a conversion key KA for designating 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. An enter key KC for transferring to the text memory for confirmation, a release key KD for releasing the function currently being executed, a left cursor key KE for moving the cursor position to the left, and a right cursor key KF for moving the cursor position to the right. It 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 the 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, for example, 78 character unconverted kana character string data, and this character string data is displayed in the input display area IDA for one line provided on the display unit 14. Also,
In response to the operation of the conversion key KA, the CPU 12 converts the kana character string data in the input buffer 13 to 1 using the conversion dictionary 15.
Kana-Kanji conversion is performed for each phrase and stored in the candidate buffer 16 and displayed in the input display area IDA of the display unit 14. 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 content thereof is 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. The recording paper P set in the section 19 is printed.

The contents of the input buffer 13, the candidate buffer 16, and the clause management buffer 17 are the corresponding pointer N ₁ ,
It is processed in phrase units according to the values of E ₁ , N ₂ , E ₂ , N ₃ , and E ₃ . It should be noted that pointers N ₁ , N ₂ and N ₃ are pointers indicating the start position of the designated phrase in the corresponding input buffer 13, candidate buffer 16 and phrase management buffer 17, and pointers E ₁ , E ₂ and E ₃ are corresponding input buffers. 13 is a pointer indicating the final position of the data stored in the candidate buffer 16, the clause management buffer 17, and the phrase management buffer 17. Further, the cursor pointer 20 is a pointer for designating each character for the input buffer 13 and the candidate buffer 16 for each phrase, and the unconverted pointer 21 is for the input buffer 13.
It is a pointer indicating the start position of unconverted kana character string data among the data in 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 is 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 is the corresponding phrase of the candidate buffer 16. The attribute code is stored in the third byte, which is the number of characters (candidate length) included in the character string data. In this case, as the 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 enabled state. There is an enterable attribute (?) That indicates that.

[0010] Operation Now, detailed explanation of the operation of this embodiment 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 on the IDA. When the conversion key KA is operated in this state, kana-kanji conversion is performed, and conversion candidate character string data as 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 leading 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 pointer E ₁ ,
By adding "1" to the values of E ₂ and E ₃ (initially "0") and setting the result to the corresponding pointers N ₁ , N ₂ and N ₃ , the start position of the clause 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 obtained by the kana-kanji conversion is stored in the Y register
Further, 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 "Fukubunsettsu" of the first bunsetsu has a "reading number" of 7 characters, and the conversion candidate character string data "complex phrase" has a "candidate length" of 4 characters. ,
“7” is set in the Y register and “4” is set in the K register. Then, the input buffer 13 and the candidate buffer 1
6, pointer E ₁ corresponding to the phrase management buffer 17,
The values of E ₂ and E ₃ 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 the phrase management buffer 17 indicated by the pointer E _3.
To the position (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 head 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 and the next one phrase of unconverted kana character string data is cut out and kana-kanji conversion is performed. I do. Less than,
The above 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 the input display area I of the display unit 14 is displayed.
Of the conversion candidate character string data in the candidate buffer 16 displayed on the DA, 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, in which the last phrase “conversion” is displayed in appearance, underline is added under all the displayed conversion candidate character string data, and the data is It is shown that it 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, release key KD continuously 4
By performing the operation twice, the conversion candidate character string data is displayed as shown in
As shown in (F) to (B), the desired correction is possible.

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 kanji of compound phrase" shown in FIG. 3 (F) is corrected to "kana-kanji conversion of compound phrase", the kana character following it is first displayed in the display state shown in FIG. 3 (F). When a column is input, the input character string is highlighted as shown in FIG.

When the left cursor key KE is operated several times in this state, the display state shown in FIG. 3 (K) is obtained. After this,
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 phrase management buffer 17 at this time are shown in FIGS. 6C and 6D.

<Confirmation Process> 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 D1). In this case, the final character position of the designated clause is obtained as follows. The designated clause is now shown in Figure 3.
As shown in (L), the “kana” that is displayed as a ghost,
Since the N ₂ position is at the first character “ka” of the specified phrase, the number of characters in the phrase (K register value) is added to the value of this pointer N ₂ . 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 designated phrase is stored in the text memory 18, the reading character string up to (cursor pointer + Y-1) is deleted from the input buffer 13. (Step D2). That is, the value for the Y character is added to the value of the cursor pointer 20 (N ₂ position), and “1” is added from the addition result.
The kana character string data up to the character position obtained by subtracting is deleted from the input buffer 13. And
As described above, the conversion candidate character string data stored in the text memory 18 from the candidate buffer 16 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),
Then, the contents of the phrase management buffer 17 are deleted from the beginning to the specified phrase, that is, up to the (N ₃ +2) th byte where "2" is added to the value of the pointer N ₃ (step D).
5). Then, remove a few minutes decremented byte and the value of the pointer E ₃ (step D6), and sets "1" to the pointer N _2, N ₃ in the next (step D7).

When the confirm key KC is operated in this manner, the character string data from the beginning of the conversion candidate character string data to the designated phrase is confirmed and stored in the text memory 18, and the confirmed character string data is stored in the candidate buffer 16. And the unconverted kana character string data in the input buffer 13 is deleted correspondingly. FIG. 3M 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, FIG. 3 (N)
The display state shown in (3) appears, and the cursor is set at the beginning position of the unconverted kana character string data. That is, since the cursor moves in the unit of phrase on the conversion candidate character string data and in the unit of character on the unconverted kana character string data, like the left cursor key KE described above, the right cursor key KF is operated once. Only by doing so, the result is as shown in FIG.

Thus, when the conversion key KA is operated with the cursor set at the head position of the unconverted kana character string data, the operation according to the flow of FIG. 4 is executed, resulting in the unconverted kana character string data. Is converted into candidate character string data containing a mixture of Kanji characters, as shown in FIG. 3 (O), and the desired correction content is obtained.

After the correction is made in this way, the kana character string following the correction is inputted (see FIG. 3 (P)). Then, when the conversion key KA is operated, the input kana character data is converted into candidate character string data containing a mixture of kanji characters.
As shown in (Q).

If this display candidate is correct, the enter key KC
To operate. 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 conversion candidate character string data from the beginning to the specified phrase is selected. The character string is confirmed. Therefore, if there are long conversion candidates, it is not easy to check all of them, but you can make a break at the stage when the check is completed halfway, and do the text check work speedily and surely. You can Also, since the conversion candidates up to that point can be confirmed when the check up to the middle is finished, even if the number of characters that can be converted at one time is limited, input operation without being aware of it. You can In the above embodiment, the conversion candidate character string data is specified in units of clauses, but may be specified in units of characters.

[0024]

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 can be converted into the original character by continuously performing a specific operation. You can restore the kana character string 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)

[Claims] 1. A character string is input, the input character string is displayed, the input character string is converted into a converted character string containing kanji, the converted character string is displayed, and 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 specific operation is further performed after the change display. In addition, the kana-kanji conversion processing method characterized in that the changed and displayed input character string is deleted.