JPS63196972A - Kanji conversion processor - Google Patents

Abstract

PURPOSE:To select a candidate with high efficiency by displaying one by one at every converting instruction as for candidates up to a display rank order determined in advance, and displaying the remaining candidates in a lump. CONSTITUTION:A code of pin-in, etc. inputted from a keyboard 11 is held temporarily in a pin-in code register 12 and displayed. When a converting instruction is issued, and the same pin-in code is stored in a KANJI (Chinese character) code table 14, address information of a KANJI code memory 13 which is set to a pair is sent to an address controller 15, and the corresponding KANJI code is held as a candidate in candidate registers 16, 17. Subsequently, the display is released, instead of which a candidate code of a register 1 being a first candidate is displayed. When the converting instruction is issued again, a second and a third candidates are displayed, and when a fourth converting instruction is issued, all the candidates of registers 4-N are displayed. When a selection number corresponding to a desired KANJI is inputted, the corresponding KANJI code is stored in a sentence memory and displayed.

Description

[Detailed Description of the Invention] <Industrial Field of Application> The present invention relates to a kanji conversion processing device that converts a first character (junon) into a second character (kanji) in, for example, writing a Chinese sentence. .

<Prior art> In general, in a Chinese word processor, the first character that is the basis for kanji conversion is inputted as a double sound, and the corresponding kanji is obtained by referring to a dictionary to create a Chinese sentence. Candidate display in this type of device has adopted either a method of displaying one candidate at a time or a method of displaying all candidates at once.

<Problem to be solved by the invention> However, in Chinese character conversion, single kanji conversion is often used, and as a result, there are a large number of corresponding kanji candidates. ◇The latter method also has the problem of requiring selection instructions for selecting candidates, making the operation complicated.

The present invention has been made in view of these problems, and it is possible to display the first number of candidates (for example, 3 candidates) one by one in response to a conversion instruction, and to display a predetermined number of candidates. It is an object of the present invention to provide a kanji conversion processing device that can efficiently select candidates by displaying the remaining candidates all at once in response to a further conversion instruction if there is a further conversion instruction after the completion of the conversion.

Means for Solving Problems〉 The kanji conversion processing device of the present invention changes the display order of candidates up to a predetermined display order among all second character candidates corresponding to the first character each time a conversion instruction is given. The control means displays the remaining candidates one by one according to the conversion instruction, and displays the remaining candidates all at once based on the next conversion instruction.

Function> In the kanji conversion processing device of the present invention, conversion candidates up to a predetermined display order are displayed one by one according to the display order for each conversion instruction, and the remaining candidates are displayed in the next order. Display them all at once based on the conversion instructions.

<Example> A detailed explanation will be given below based on the drawings.

FIG. 1 is a configuration diagram of an embodiment according to the present invention. In this embodiment, the first three candidates are displayed one by one in response to a conversion instruction, and the fourth and subsequent candidates are displayed all at once. 0 to 11 are keyboards for inputting operation instructions such as parallel sounds or conversion instructions, and 12 is a double sound code register that temporarily stores the double sound code input from the keyboard 11. Reference numeral 3 denotes a kanji code memory that stores the kanji corresponding to each junji as a kanji code, and 14 a kanji code table that stores at which address in the kanji code memory 13 the kanji code of the kanji corresponding to each junji is stored. , 15 is an address control circuit.

16 is a candidate register that stores Kanji codes of candidates to be displayed one by one; 17 is a candidate register that stores Kanji codes of candidates to be displayed all at once; and 18 is a character generator that generates character patterns corresponding to the Kanji codes.

All of these constituent elements are controlled by a CPU (central processing unit), not shown.0 Figure 2 is a diagram showing the candidate display state of this embodiment. B2 is the second candidate display state according to the next conversion instruction, B8 is the third candidate display state according to the eighth conversion instruction,
C shows a state in which all candidates after the fourth candidate according to the fourth conversion instruction are displayed at once.0 Next, the operation will be explained using the flowchart shown in FIG.

Codes such as diatonic sounds inputted from the keyboard 11 are temporarily held in the diatonic code register (St, 2), and are displayed and output on the display section as shown in FIG. 2A via the character generator (B3). After that, when a conversion instruction is given by operating the conversion key (B4) on the keyboard II, it is checked whether or not the same code as the double sound code held in the above-mentioned double sound code register 12 is stored in the kanji code table 4. Be sure to check B5, 6), if the same double-on code is stored, check the address information of the kanji code memory 13 stored in the address where the double-on code is stored and the address set as busy. , is supplied to the address control device 15 (S7). Based on the supplied address information, the address control device 15 selects the kanji code stored at the address from the kanji code memory 1B as a candidate corresponding to the above-mentioned double phonetic code. It is output (B8) and held in candidate registers 16 and 17. Note that the candidates are stored in the candidate registers: the first candidate is stored in register 1 of candidate register 16 (B9), the second candidate is stored in register 2 of candidate register +6 (SIG, 11), and the eighth candidate is stored in register 1 of candidate register 16 (B9). The fourth candidate and subsequent candidates are held in each register of the candidate register 17 (S12.13).
S14,15).

When each candidate is held in each candidate register through the above process, the display of the diphonetic characters that have been displayed up to now is canceled (S16), and the candidate code held in register 1 of the candidate register 16 is replaced instead. It is displayed via the character generator 18 (S17, display state Bl in FIG. 2). At this time, when another conversion instruction 818 is given, the candidate code held in register 2 of the candidate register 16 is displayed instead of the first candidate through the character generator (S19, 20. Condition B2). Further, the same display process is performed in the third conversion instruction (S21) (S22, 28, display state B3 in FIG. 2).

Furthermore, when the fourth conversion instruction S24 is given, all candidate codes held in registers 4 to N of the candidate register 17 are supplied to the display section via the character generator 18, and the already created kanji and candidate kanji are Cancel the display and display it (S25゜26, display state C in Figure 2)
.

Furthermore, while each of the above candidates is displayed, another conversion instruction is given.
If the next candidate does not exist (519, 22°25) or all candidates after the fourth candidate are displayed (S26)
If there is a conversion instruction (S27), the first candidate is taken out from register l of the candidate register 16 again and displayed.

And when all candidates after the 4th candidate are displayed at once (
If the desired kanji exists in 526), the selection number corresponding to the kanji is inputted 328), and the kanji code is thereby supplied to the text memory (not shown) from the corresponding register of the candidate register 17 that holds the selected kanji. The kanji code is stored at a predetermined address (829), and the kanji characters corresponding to the kanji code stored in this text memory are displayed in a batch candidate display (S80).

Also, when the first to third candidates are displayed (517,
When a confirmation instruction is given to 20,2 (,26) (S3
1.32.88), the kanji code from the corresponding register is stored at a predetermined address in the text memory (S29), and the confirmation is displayed (530).

By repeating the above-described series of processes (S, 34), Chinese sentences are successively created.

In this embodiment, the number of candidates displayed for each l candidate is 3.
Although this is a candidate, it is not limited to this.

Also, although not specifically shown, depending on the selection of each candidate,
Needless to say, it has a so-called learning function that refers to the count value and displays candidates in order of frequency of use when displaying the next candidate based on the frequency of use of the core candidates.

<Effects of the Invention> The kanji conversion processing device of the present invention selects the candidate fi1 with the earliest display order.
The candidates are displayed one after another, and candidates with lower display rankings are displayed all at once, so candidates can be selected efficiently.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of one embodiment of the present invention, FIG. 2 is a diagram showing the display state of the same, and FIG. 8 is a flow chart explaining the same operation. II: Keyboard, I2: Double chord register, 13:
Kanji code memory, 14: Kanji code table, 16.
IT: Candidate register, I8: Character generator. Agent Patent attorney Takeshi Sugiyama (and 1 other person) Figure 1

Claims (1)

[Claims] 1. In a kanji conversion processing device that converts a first character into a second character, among all second character candidates corresponding to the first character, candidates up to a predetermined display order are A kanji conversion processing device characterized by comprising a control means that displays candidates one by one according to the display order each time there is a conversion instruction, and displays the remaining candidates all at once based on the next conversion instruction. 2. The kanji conversion processing device according to claim 1, wherein the display order is a frequently used order.