JPH0666065B2 - Document processor with furigana addition function - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a document processing apparatus with a furigana addition function, which is preferably implemented to add furigana to a name written in Chinese characters, for example.

In the prior art, in the case of horizontal writing, the furigana is entered in advance, and the corresponding kanji is entered in the line below it.

Therefore, the operation is complicated. In particular, in a document processing device that has the function of inputting kana characters and converting them into corresponding kanji or kanji kanji sentences, the kana characters must be input to input kanji, and the same kana The operation is troublesome because you have to input.

An object of the present invention is to provide a document processing device with a function of adding a pseudonym with improved operability.

FIG. 1 is an overall block diagram of an embodiment of the present invention. The keyboard device 1 has a front surface thereof shown in FIG. 2, and kana keys 11 arranged in the order of Japanese syllabary and a conversion key 12 for instructing conversion from kana characters to kanji or kanji mixed sentences, that is, a conversion instruction. Means, a ruby key 13 for setting a kana character for adding a kana to the kanji read by this conversion, that is, a kana instructing means, and a display device 9 such as a cathode ray tube display device, that is, an input position of a display screen of the display means. A cursor key 15 for moving the cursor mark to a desired position, that is, cursor means is included. The keyboard device 1 outputs the character code corresponding to the operated key, the control code or the coded signal related to those keys to the output line 10. Processing circuit 2
Performs the following processing according to the editing program 3a stored in the read-only memory 3. The read-only memory 3 also has a conversion table 3b for converting a normal character code input and stored into a ruby key character code having a smaller size than that. The random access memory 4 which is a buffer means is (a)
A sentence buffer 21 that stores the input sentence data, converts the kana sentence into a kanji or kanji mixed sentence, and stores the edited sentence data in the input order, and (b) a one-line sentence that is being input and edited. The data is stored and the line buffer 22 that is edited in this and transferred to the sentence buffer 21 when the editing of one line sentence is finished, and (c) the kana or kana sentence that was input to be converted into the kanji mixed sentence is temporarily An input buffer 23 to be stored, and (d) a kana sentence input in the ruby mode in order to convert the inputted kana character into a ruby character, and the ruby buffer 24 to be further converted into a ruby character and stored. (E) Counter 25 that counts the number of input characters
And (f) a stack register 26 for temporarily storing the contents of this counter 25, (g) a rube flag 27 indicating that there is a ruby mode in the input line, and (h) for other editing processing. And an area 28 for storing the buffers and flags used.

When re-editing the text data already edited and stored in the character buffer 21, the text of the corresponding line is transferred to the line buffer 22. At this time, the line of the text buffer transferred from the text buffer 21 is erased. The text data includes, for example, a character code defined by Japanese Industrial Standard JIS C6226 and, in addition to these character codes, a code of, for example, 1/2 ruby characters smaller than these character sizes. The kana-kanji conversion circuit 5, which is kana-kanji conversion means, is provided with a dictionary for converting kana sentences into kanji or kanji kanji kanji sentences. Stored at Buffer 28. The printer control circuit 6 is a dot printer 7
Control and record the desired sentence stored in the sentence buffer 21. The display control circuit 8 controls the display device 9, and includes a display memory 29 corresponding to the display screen,
It has a storage area divided for each character display section of the display screen, and is provided with a cursor buffer 30 for storing the position of the cursor mark indicating the input position on the display screen, and the desired text data of the text buffer 21 and Display the text data of the line buffer.

A normal sentence input operation, that is, an operation without adding a kana will be described. The operator inputs the kana sentence from the kana character key 11 according to the sentence to be input, whereby the operations after step 110 in FIG. 3 are performed. Moving from step 110 to step 111 and step 112,
The counter 25 is incremented by 1, and the kana characters input in step 113 are stored in the input buffer 23. This input character is inserted into the input 1 of the line buffer 22 at step 114, the position data of the cursor buffer 30 is incremented and updated by one character at step 115, and the data of the line buffer 22 is displayed at step 116. Write in the 29 corresponding row areas. Thus, the input kana character is displayed on the display screen of the display device 9, and the cursor mark is displayed at the next input position. Each time a kana character is input, such an operation is repeated and the input kana sentence is displayed on the display screen of the display device 9.

When the operator completes the input of a kana sentence corresponding to a desired kanji or kanji kanji sentence, the operator operates the conversion key 12 in order to convert the kana sentence to kanji or kanji kanji sentence. When the conversion key 12 is operated, the operations after step 130 are performed. In step 132, the data of the input buffer 23 is given to the kana-kanji conversion circuit 5, whereby the kana or kanji spelled sentence, that is, the conversion sentence, corresponding to the kana-kanji conversion circuit 5 is stepped.
It is output at 133 and is stored in the output buffer 28 together with the number of characters of this conversion sentence. In step 134, this conversion sentence is written in the area where the kana sentence was stored before the line buffer 22. Therefore, the previous kana sentence is erased. Then, in step 135, the number of characters in the kana sentence is compared with the number of characters in the converted sentence to obtain the difference, and in step 136, the kana sentence remaining in the line buffer 22 is deleted, and the step is deleted.
At 137, the data representing the cursor position of the cursor buffer 30 is corrected by the difference. Next, the data in the row buffer 22 is transferred to the corresponding row area of the display memory 29 by step 13.
Write in 8 and erase previous display data. Therefore, the kanji or kanji magic sentence converted in this way is displayed in place of the kana sentence, and the cursor mark is displayed at the next input position. Generally, the number of characters in the conversion sentence is
Equal to or less than the number of characters in the kana sentence. When the displayed conversion sentence is not a desired Kanji character, the next candidate conversion sentence is read again from the Kana-Kanji conversion circuit 5 and displayed on the display device 9. Move from step 139 to step 140, correct the counter 25 by the above difference, and enter the input buffer 23.
Is cleared in step 141. In this way, by inputting a kana and converting the kana into a kanji or kanji magic sentence, a desired kanji or kanji magic sentence is inputted. After that, by operating the cursor keys 15 to switch lines or by specifying a line feed, the data in the line buffer 22 is inserted into the corresponding line area of the text buffer 21, and the editing of one line sentence is completed. To be done.

The operation of ruby mode for adding kana to kanji will be described.
FIG. 4 shows a state displayed on the display screen of the display device 9. It is assumed that a sentence is created as shown in FIG. 4 (1). The symbols shown in FIG. 4 are shown in FIG. The symbol in FIG. 5 (1) indicates a space character and is blank. FIG. 5 (2) shows a cursor mark, and FIG. 5 (3) shows a line feed code. Input is made to the lines 51 and 52 shown in FIG. 4 (1) in accordance with the above-described operation. In line 53, the "name" is entered by the operation described above. At this time, it is displayed on the display device 9 as shown in FIG. 4 (2), and the line buffer 22 stores the character data of "name". Here, the operator is
Is operated in step 100 to set the ruby mode in step 101. Then, the kana character "Yamada" is input to move from step 110 to step 111 to step 118. In this step 118, the input kana character is stored in the ruby buffer 24, and then the step
The operations of 113 to 116 are performed as described above. Here, step 112 is not performed, and the number of characters until the input of "name" is stored and retained. By repeating this operation, “Yamada” is input, and the display of FIG. 4 (3) is displayed on the display device 9.

Subsequently, the operator operates the conversion key 12 in order to convert into Kanji. Therefore, steps 130 to 138 are executed as described above, and the line buffer 22 stores "Name Yamada" and is displayed on the display device 9. After that, since it is the ruby mode, step 139 to step 150 shown in FIG.
Move on to.

Referring to FIG. 6, in step 150, the data in the line buffer 22 is searched and it is determined that the line feed data is stored. If the line feed data is not stored, step 151 is executed.
Move to and store the line feed data at the cursor mark position.
The text data of the line buffer 22 is inserted into the corresponding line area of the text buffer 21 at step 152, and the data of the line buffer 22 is stored in the display memory 29 at step 153 and stored in the display memory 29 first. Erase. Since the ruby flag 27 has been reset, the routine moves from step 154 to step 155, the ruby flag 27 is set, the line buffer 22 is initialized in step 156, and the line feed code is stored in the line buffer 22 in step 157. (That is, the ruby flag 27 is a flag for automatically reserving the line for outputting the furigana (steps 156 and 157), and whether or not the line for outputting the furigana is reserved by setting or resetting it. The space character of the data text of the counter 25 previously stored in the row buffer 22 is then stored in step 159. In step 160, the kana characters of the ruby buffer 24 are converted into ruby characters, and in step 161, the line buffer 22 is written.
Is inserted after the space character. Step 162
Then, the number of kana characters, that is, three characters in this embodiment, is increased in the counter 25 and stored in the stack register 26 in step 163. In step 164, the row buffer 22
Data is inserted into a corresponding area of the display memory 29, that is, a line 55 between the line 52 in FIG. 4 (1) and the line 53 in which the name Yamada is stored, and the data is stored in the line buffer 22 in step 166. The line of "name Yamada" in which the data of "." Then step 166
Initialize the row buffer 22 at.

The number of characters of the conversion sentence stored in the output buffer 28 of the kana-kanji conversion circuit 5 is transferred to the counter 25 at step 167,
At step 168, the data of the next line, that is, the line storing "name Yamada" is transferred from the text buffer 29 to the line buffer 22, and at step 169, the corresponding line of the text buffer 29 is erased. At step 170, the difference between the counter 25 and the stack register 26 is obtained. At step 171,
At the line feed code position of the line buffer 22, the number of space characters corresponding to the difference of the difference is inserted. Replace the data in row buffer 22 with the previous display data in display memory 29 and
In step 173, the contents of the cursor buffer 80 are stored in step 173.
The contents of stack register 26 are
Transfer to 25 at step 174. By performing such an operation, the kana character is converted into the ruby character and displayed as a kana in the line immediately above the previous kanji as shown in FIG. 4 (4).

Kana characters may be in katakana or hiragana. Further, the present invention may be carried out in association with not only horizontal writing but also vertical writing.

As described above, according to the present invention, a kana can be added to a kanji by a simple operation.

Further, according to the present invention, a kana character is input to the position designated by the cursor means, stored in the buffer means, and the converted kanji or kanji spelling is displayed on that line, and the kanji on the previous line is displayed. The kana character stored in the buffer means is displayed as a kana character at a position directly above. As a result, it is possible to perform a display in which the correspondence between Chinese characters and furigana can be easily grasped.

[Brief description of drawings]

FIG. 1 is an overall block diagram of an embodiment of the present invention, FIG. 2 is a front view of the keyboard device 1, and FIG. 3 is a flow chart for explaining the operation of the embodiment shown in FIG. Fourth
FIG. 5 is a diagram showing the display state of the display device 9, FIG. 5 is a diagram for explaining the symbols used in FIG. 4, and FIG. 6 is a diagram for explaining the ruby mode operation of the embodiment shown in FIG. It is a flow chart to do. 1 ... Keyboard device, 2 ... Processing circuit, 3 ... Read-only memory, 4 ... Random access memory, 5 ...
Kana-Kanji conversion circuit, 7 ... Printer, 9 ... Display device

 ─────────────────────────────────────────────────── ─── Continuation of the front page (56) Reference JP-A-55-124836 (JP, A) JP-A-56-80729 (JP, A) JP-A-55-44616 (JP, A)

Claims (1)

[Claims] Claim: What is claimed is: 1. In a document processing device for converting kana or kanji mixed sentences by inputting kana characters, a cursor means for specifying a kana input position, a kana kana instructing means for inputting a kana, and a kana kanji conversion The first buffer means for storing the kana characters input for that purpose, the conversion instructing means for instructing the kana-kanji conversion, the second buffer means for storing the kanji or kanji mixed sentences corresponding to the previous kana characters, and the furigana instruction. When the means is not operated, the kana character stored in the first buffer means is displayed on the line where the cursor is located, and the kanji or kanji stored in the second buffer means is subsequently displayed based on the conversion instruction. The magic sentence is displayed by replacing the kana character with the kana character indicating means being operated,
The kana character stored in the first buffer means is displayed on the line where the cursor is located, and the kanji or kanji spelling stored in the second buffer means is replaced with the kana character and displayed based on the subsequent conversion instruction. With that, when furigana characters are not displayed in front of the line where the cursor is positioned, in the newly inserted furigana character display line before the line where the cursor is positioned, before the line where the cursor is positioned When the line is a furigana character display line, a display means is provided at a position directly above the kanji character on the furigana character display line to display the furigana character obtained by ruby-converting the kana character stored in the first buffer means. A document processing device with a function for adding a pseudonym, which is characterized in that