JPS6351306B2 - - Google Patents

Description

[Detailed Description of the Invention] The present invention relates to a kana-kanji conversion device used in Japanese input devices, text editing devices, etc., which inputs kana characters according to the pronunciation of the characters and outputs kanji or kanji-kana mixed sentences. It is.

To be more specific about this kana-kanji conversion device, it is equipped with a kana input key as a character input key, and by operating this key, input is made in units of words or phrases, and this input word is supplied to the kana-kanji conversion table. It converts the text into a corresponding sentence mixed with kana and kanji, stores it in a text memory, and outputs it to a printer for document creation.

By the way, in the case of the above-mentioned kana-kanji conversion device, compared to a tablet system equipped with a large number of kanji input keys, there is no need to search for kanji arranged on the keyboard, and input is relatively easy. On the other hand, once kana characters have been converted into a sentence mixed with kanji, if the converted sentence (word) is to be corrected again, this correction operation is complicated.

In other words, after performing a conversion operation on a certain sentence, if a word in the middle of the sentence is misspelled, the phrase to which the word was misspelled is deleted once, and then the entire phrase is entered in kana again and the conversion operation is performed. The procedure was followed.

The present invention was proposed in order to solve the above-mentioned problems of conventional kana-kanji conversion devices, and in particular, even if an error is noticed after converting one line of text. This correction operation can be easily performed, further improving the ease of input operations that this type of device has.

First, the outline of the text editing device shown as an embodiment of the present invention will be explained.In accordance with the document to be created, a kana sentence is inputted using the kana input key.
Operate the conversion key each time you enter the equivalent of one block of phrases or words. Through this operation, the kana sentence is converted into a corresponding kanji-mixed sentence (only the kanji part of the kana sentence is changed to kanji), and the converted sentence is sequentially stored in the sentence memory. When the desired text is stored by repeating this operation, a document in accordance with a predetermined document format is created by the printing device.

Next, the structure of FIG. 1 showing the above text editing device will be explained.

Reference numeral 1 denotes a kana input keyboard, and the specific configuration of this keyboard 1 is shown in FIG.
Kana input keys are arranged in this order, followed by keys for space, line break, page break, katakana conversion, voiced sound, half-voiced sound, kudotaku, etc. When an input operation is performed from this key, a corresponding key signal is outputted and supplied to the encoding circuit 3 (see FIG. 1).

Reference numeral 2 denotes a control keyboard, and specifically, the keys 26 to 34 in FIG. Supplied.

To explain each control key here, “conversion”
The key 26 is a key for instructing to convert a kana sentence into a sentence mixed with kanji, the "no conversion" key 27 is a key for instructing a kana sentence to be converted into a sentence as it is, and the "cancel" key 28 is a key that is a feature of the present invention. It is an instruction key to return a converted kanji-mixed sentence to its original kana sentence, and the "←" key 29 moves a cursor mark (a mark that indicates the input position and editing position on the display device). , is a key to move the cursor mark to the left, that is, to the front of the text, the "→" key 30 is a key to move the cursor mark to the right, that is, to the back of the text, and the "Print" key 31 is a key to move the cursor mark to the right, that is, to the back of the text. This is a key for instructing printing of the text to be memorized, and the "registration" key 32 is a key for storing the data in the text memory in a non-volatile memory device such as a floppy disk.
The "execute" key 33 is a key that causes the operation of the control key input before this key is operated. 34
is an instruction key for erasing one character at a time out of a kana sentence input in kana or a converted sentence mixed with kanji, and in combination with the cursor key, erases one character at a time.

Returning to FIG. 1 again, the encoding circuit 3 is a circuit that generates a code signal corresponding to the input key signal, and the kana key is input to the input buffer (IN).
4, and the control key is supplied to the editing sequence circuit 5. The input buffer (IN) 4 is supplied to the editing sequence circuit 5, and eventually the memory (M) 1
2 is stored.

The editing sequence circuit 5 performs editing control as shown in the flowcharts of FIGS. 3 to 8 based on the operations of the control keys and kana input keys. Further, this circuit 5 has a built-in code determination circuit 23, and is further connected to a control signal line L ₁ and a data transfer signal line L ₂ .

Furthermore, flags F ₁ , F ₂ , and F ₃ are provided to indicate each control state, and F ₁ indicates a state in which the cursor mark has been moved to a position already input using the ← key 29, that is, an insertion state. show. _F2 indicates a state in which the preparation process for inserting characters in the above-mentioned insertion state has been completed. _F3 indicates a normal input state, that is, a state in which kana is input to a new position.

Reference numeral 6 denotes a text display device corresponding to one line of text, and displays text data stored in a display buffer (D) 7. Further, a cursor mark is displayed at the character position according to the value of a cursor counter (KC) 15 in the memory 12, which will be described later. In this example, a display device for one line is shown, but a device capable of displaying multiple lines, such as a CRT display device, may be used.

12 is a memory circuit, and an address circuit 17 designates a read or write position. This memory 12 includes a buffer (A) 13 having a capacity for multiple lines for storing kana sentences entered using the kana input key, and a buffer 1 for storing kanji-mixed sentences converted from this buffer (A) 13. A buffer (B) 14 having a capacity for a line, a cursor counter (KC) 15 indicating the display position of the cursor mark on the display device 6 counted by the cursor keys 29, 30 and the kana key, and a conversion Sentence memory (M) 1 that stores kanji-mixed sentences
6.

18 to 22 are pointers that temporarily store address positions in the memory 12, and PA ₀ 18 and
PA ₁ 19 is a pointer to the kana buffer (A) 13, PB ₀ 20 and PB ₁ 21 are pointers to the kanji mixed sentence buffer (B) 14, and PM 22 is a pointer to the sentence memory (M) 16. be.

The pointers PA ₀ 18 and PB ₀ 20 normally indicate the beginning of the clause (or word) at the cursor mark position, and PA ₁ 19 and PB ₁ 21 normally indicate the end of the clause at the cursor mark position.

Reference numeral 9 denotes a conversion table made of a ROM or the like, which receives the kana sentence supplied from the conversion circuit 11 as search data, outputs the corresponding sentence mixed with kanji, and stores it in the output buffer (out) 10. This output buffer 10 further outputs to the data signal line _L2 .

Reference numeral 8 denotes, for example, a 24×24 dot printer that prints the text data in the text memory (M) 16 to create a document.

Next, the operation of the present device will be explained according to the flowcharts shown in FIGS. 3 to 8.

Now, when the operator wants to create a document as shown in FIG. 9A, he inputs it by operating the kana input key as shown in FIG. 9B.

When a phrase is input here, the conversion key is operated to convert it into a sentence mixed with kanji. Note that in FIG. 9, the "/" mark is a break code that is not related to key input.

As a result of this operation, each phrase is converted into a sentence mixed with kanji, as shown in FIG. 9C. In this way, the sentence shown in Figure 9A is obtained.

By the way, after the text shown in Figure 9 A is created,
If you want to correct a single phrase, for example, change the phrase "in the public gazette" to a sentence mixed with other kanji characters, use the ← key 29 (or → key 30) to display the phrase on the display device 6. Move the cursor mark KM to the corresponding text position in Figure 9 A. When the cancel key 28 is operated, the phrase is returned to its original kana sentence and is further displayed as shown in FIG. If the conversion key 26 (or non-conversion key 27) is operated again to convert to another sentence mixed with kanji, a new sentence mixed with kanji (or kana sentence) will appear.

Further, a part of the kana sentence shown in FIG. 9 can be corrected (deletion or insertion) into a new kana sentence, and can be corrected into a new kanji-mixed sentence.

Another feature of the present invention is that it is possible to partially correct a completed sentence (a sentence containing kanji) as shown in FIG. 9C. For example, if you delete "Open" in "Public Notice" and enter the kana "Koku", it will be displayed as shown in Figure 9, and by converting in this state, you can correct the sentence to "Public Notice". (Figure 9).

Next, the above series of operations will be specifically explained with reference to FIGS. 3 to 8.

The arrows (→) in FIGS. 3 to 8 mean data transfer, and +1 and -1 mean counting up or down the address value by one character.

The pointer name in parentheses indicates the source address value or the destination address value.

By the way, if you want to create a sentence like the one shown in Figure 9 (a), press the kana input key 25 in Figure 2 as shown in Figure 9 (b).
When a kana key is input, a code signal corresponding to the kana key is stored in the input buffer (IN) 4 (hereinafter simply referred to as IN), and the flow shown in FIG. 3 is operated. In the initial stage, all flags F ₁ to _{F 3} are reset, and each pointer PB ₀ 20, PB ₁ 2
1, PA ₀ 18, and PA ₁ 19 indicate the start addresses of the B buffer 14 and the A buffer 13. Therefore, F ₃ is set and the _9th
The position in the bottom row of the figure is read to determine whether it is a delimiter code (step 103).

In the initial stage, nothing is stored in A13, so the process proceeds to step 104, where the delimiter code is stored and the code signal of IN4 is further inserted.
At this time, the delimiter code moves to Figure 9,
A code signal corresponding to "ko" is stored.
Subsequently, A13 and B14 are combined, transferred to the display buffer D7, and displayed on the display device 6. Furthermore, execute PA ₁ +1 to indicate the position and add 1 to the cursor counter KC15 (from step 100).
108).

Next, when "no" is operated using the kana key 25, since _F3 has been set, the program will start from step 100.
The process advances to steps 110 and 105, and the above operations are repeated (however, the delimiter code is not stored). This operation is repeated to input a kana sentence (one clause) to the positions shown in FIG. 9B, and when this is completed, the conversion key 26 (or no conversion key 27) is operated. Then, a corresponding sentence mixed with kanji is input (if the non-conversion key 27 is used, the sentence is input as is).

Furthermore, if the operator makes a mistake in inputting a kana sentence before this operation, it is possible to correct the kana sentence by combining the cursor keys 29 and 30.

To explain this operation, if you forget to input "tsu" at the position shown in FIG. According to this example, the character "ha" is displayed at the position.

This progresses through the flow shown in Figure 5, and since _F3 is set first, it progresses from step 250 to steps 267 and 268, performs PA _1-1 (the delimiter code indicates the position), and then KC. -1 and set F ₁ (250, 267, 268, 265, 266). Here “tsu”
When inputting , the flow returns to the flow shown in Figure 3, and now F ₁ and F ₃ are set, and steps 100,
110, 105-108 are operated and the character "tsu" is inserted at position ( _PA1 ).

Also, if an extra kana character is input in the ~ position in Figure 9 (b), the above cursor keys 29, 30
It can be erased using the erase key 34 in combination with the above.

That is, this progresses through the flow shown in Figure 8 and now _F3 is set, so steps 400 to 403,
419 is operated, the upper characters from the position indicated by PA ₁ of A13 are shifted to the left, and the character at the PA ₁ position is deleted.

Once the input of the kana sentence is completed using the main topic return kana key 25, the conversion key 26 is operated.

This proceeds to the flow shown in FIG. 4 and resets F ₂ and F ₃ . Furthermore, read the PA ₁ position of A13,
It is determined whether or not it is a delimiter code, and if it is not a delimiter code, PA ₁ +1 is executed and the above operation is repeated.

This is because there is a possibility that PA ₁ is located in the clause due to the operation of the cursor keys 29 and 30, and this is to indicate the position of the delimiter code at the end of the clause (150 to 152, 170).

Furthermore, the kana sentences from PA ₀ to PA ₁ of A13 (in this example, the kana sentences of ~) are transferred to the conversion circuit 11,
Convert to a corresponding kanji-mixed sentence.

Furthermore, the converted sentence with kanji is transferred to out10 while counting the number of characters m ( _F1 is reset), and sequentially transferred to B14 from the position indicated by PB ₀ , and then PB ₀ + (m + 1) → PB ₁ is executed, and the delimiter code is stored at the end of the clause, that is, at the position of PB ₁ of B14. Furthermore, the letter B14 is D
7 and displayed on the display device 6 as shown in FIG. 9 (153-160).

Here, if the desired sentence does not contain kanji, the operator operates the conversion key 26 again. Then, B14
The clauses shown in PB ₀ to PB ₁ are cleared, and PB ₀ →
PB ₁ (return PB ₁ to the beginning of the clause) is executed to perform the above conversion process, and the next candidate sentence containing kanji is read out. The conversion table 9 is arranged such that one of the sentences containing kanji is read out in order of frequency of use (175 to 177).

When the desired kanji-mixed sentence is read through the above operations, pressing a key other than the conversion key 26, such as the next kana input key, completes the conversion and presses PA ₁ +1.
Transfer to PA ₀ and PA ₁ , and further transfer PB ₀ +1 to PB ₀ and PB ₁
and point each pointer to the beginning of the position where the next clause is to be stored. Furthermore KC15
Set to the value corresponding to PB ₁ . That is, a cursor mark is displayed on the display device 6 at the next input position (163-165).

By repeating the operations described above, the kana sentence shown in FIG. 9(b) is converted into the kanji-mixed sentence shown in FIG. 9(c).

Here, when B14 reaches one line or when the line feed key is operated, the judgment means determines that the line editing has been completed, and therefore the process proceeds from step 164 in Fig. 4.
Proceeding to 180, one line of text stored in B14 is sequentially transferred to M16 from the position indicated by PM. Furthermore, execute PM+1, A13, B14, D7,
While resetting KC15 using the reset means,
Set PA ₀ , PA ₁ , PB ₀ , PB ₁ to initial values and set 1
The text input for the line is completed (180 to 183).

In addition, in the above explanation, only the conversion key 26 was used, but when inputting a kana sentence that does not include kanji, after inputting a predetermined kana sentence, the non-conversion key 26 is used.
Operate 7. This proceeds to step 200 in FIG. 4, performs the same operations as steps 150-152, 170 described above in steps 200-202, 206, and then proceeds to step 204. Further, the kana sentences stored in PA ₀ to PA ₁ of A13 are sequentially transferred to the PB ₀ position of B14 while counting the number of characters m. Then PB ₀ +m → PB ₁
(PB ₁ indicates the delimiter code position), and B1
4 is transferred to D7 and displayed on the display device 6 (204, 205, 209). Next, the process proceeds to step 163 of the operation of the conversion key 26. In this way, the input kana sentence becomes the input sentence as it is.

Next, correction processing, which is a feature of the present invention, will be explained.

The correction method of this device is the first method described above, that is, the method of once reverting to a kana sentence and correcting it. This method will be explained.

An example of this is “in the public gazette” shown in Figure 9 C.
This example shows the case where the statement "in the public notice" is corrected.

First, the operator moves the cursor mark to the desired position, that is, the "open" position. Then, when the cursor key (← key 29) is operated (assuming that the cursor mark is located at the position shown in Fig. 9A),
Both F ₂ and F ₃ have been reset, so PB ₁ is counted down by one character and the character code at the PB ₁ position of B14 is successively output, and the determination circuit 23 determines whether or not it is a delimiter code.

Now, PB ₁ indicates the position of 〓〓 in Fig. 9C, so it is a delimiter code, and PB ₁ -1, PB ₁ → PB ₀ are executed. As a result, PB ₁ and PB ₀ indicate the position 〓〓. Furthermore, the PB ₀ position of B14 is read and it is determined whether it is a delimiter code, and if it is a delimiter code,
Execute PB ₀ -1 and repeat the operation of 256 above (251
~258). Further, when the delimiter code appears, the process advances to step 259. It will be understood that at this time, PB ₀ indicates the position 〓〓.

Furthermore, perform PB ₀ +1 (indicates PB ₀ position 〓〓),
Perform PA ₀ -2 and PA ₁ -1. Note that when the cursor mark is at A in FIG. 9, PA ₀ and PA ₁ should indicate A13. Therefore, PA ₀ indicates the position and PA ₁ indicates the position 〓〓 (259, 260).

Furthermore, the position of PA ₀ of A13 is read to determine whether it is a delimiter code, and if it is not a delimiter code, PA ₀ -1 is performed and the above operation is repeated.

On the other hand, when the delimiter code appears (position),
Proceed to step 264, perform PA ₀ +1 (position), and perform the operations of previous steps 265 and 266 (261~
266).

As mentioned above, when the cursor mark moves beyond one clause by operating the cursor key 29 once, PA ₀ indicates the beginning of the clause of A13,
PA ₁ indicates the position of the delimiter code at the end of the clause. or
It will be appreciated that PB ₀ indicates the beginning of the clause in B14 and PB ₁ indicates the position in B14 that corresponds to the cursor mark position.

By repeating the ← key 29 in the manner described above, the cursor mark will be at the character position for "open", PA ₀ will indicate the position of A13, which is the clause of the corresponding kana sentence, and PA ₁ will indicate the position. . Also, PB ₀ indicates the position 〓〓, and PB ₁ indicates the position 〓〓.

The cursor key (→ key 30) is not directly related here, but to explain its operation, the operation of this key 30 advances to Fig. 6, and now F ₂ ,
Since F ₃ has been reset, step 301 from step 300.
Proceed to. If _F1 has been set by the ← key 29, the process advances to step 302. If F ₁
has been reset, the → key 30 will not operate. This is because when _F1 is in the reset state, the cursor mark indicates the next character input position. Therefore, when _F1 is set by the ← key 29 and the correction mode is entered, the → key 30 becomes valid.

In step 302, PB ₁ +1 is performed, and B
The PB ₁ position of No. 14 is read and it is determined whether it is a delimiter code or not. If it is not a delimiter code, the process advances to 314, performs KC+1, and moves the cursor mark to the right by +1. Also, if it is a delimited code, PB ₁ +
1, and then PB ₁ → PB ₀ . In other words, it means that the phrase has been crossed to the right, and PA ₁ +1 is further performed (305 to 307).

Next, the position of PB ₀ of B14 is read and it is determined whether there is a character or not. If there is no character, it is found at the input position (cursor mark position in Figure 9 A), reset F ₁ and perform KC+1. (308,
309, 313, 314). If there are letters, A13 PA ₁
is read and it is determined whether or not it is a delimiter code. If it is not a delimiter code, PA ₁ +1 is performed and the above operation is repeated (310, 311, 312).

Then, when the delimiter code is read, KC+1 is performed. That is, after 304, when one clause is exceeded, as with the operation of the ← key 29, PA ₀ indicates the beginning of the clause of the kana sentence in A13, and PA ₁ indicates the last delimiter code position of the clause. And PB ₀ is B1
4 indicates the beginning position of the clause, and PB ₁ indicates the character position corresponding to the cursor mark position.

Also, when inputting a kana sentence ( _F3 set), if the → key 30 is operated, the flow advances from step 300 to step 315 in FIG. 6, reads the PA ₁ position of A13, and checks whether it is a delimiter code If it is a delimiter code, the cursor keys will not work (315, 316).

If it is not a delimiter code, perform PA ₁ +1, KC+1 and move the cursor mark to the right (316,
317, 318). Furthermore, the PA ₁ position of A13 is read and it is determined whether it is a delimiter code (the position where the cursor mark has moved), and if it is a delimiter code, F ₁
(319-322).

By the way, if the cursor mark is moved to the "open" position in Fig. 9 C and the cancel key 28 is operated, the program proceeds to Fig. 7, performs PB ₁ +1, and reads out the PB ₁ position (〓〓) of B14. It is determined whether the code is a delimiter code (350-352). If it is not a delimiter code, repeat the above operation. This changes the position of the cursor mark
PB ₁ indicates this, so it is intended to indicate the position of the delimiter code at the end of the clause at the cursor mark position.

Generally, it is difficult for the operator to judge the break between clauses from the displayed text in FIG. 9A, so it is conceivable to move the cursor mark to the correction position.

Next, the kanji-mixed sentences (〓〓~〓〓) from the beginning of B14 to PB ₀ -1 are transferred sequentially from the beginning (0) of D7 (354), and then the kana sentences from PA ₀ to PA ₁ of A13 are transferred sequentially from the beginning (0) of D7. (~) is successively transferred from the position of D7 (up to m) (355). Furthermore B1
After PB ₁ (〓〓) of 4, the data is sequentially transferred to D7 (356). Further, KC is set to a position corresponding to PA ₁ (357).

Therefore, on the display device 6, as shown in FIG. 9, the entire phrase is returned to its original kana sentence and displayed for correction.

Here, the kana sentence is corrected by moving the cursor key and inserting the erase key 34 and the kana input key 25 as explained earlier, and by conversion, it is corrected to a new sentence with kanji mixed in, and the correction instruction in B14 is made. Can be replaced with phrases.

This progresses from step 156 to step 169 in Figure 4, where the characters at the PB ₁ +1 position are sequentially left-shifted to the PB ₀ position (169), and then from out10 to B1
The delimiter code is inserted into the position of PB ₀ of PB 4 while counting the number of characters m, and is executed by executing PB ₀ +(m+1)→PB ₁ and inserting a delimiter code into PB ₁ (171 to 173).

The same steps apply to non-conversion keys.
By the operations 210, 207-208, the kana sentence in A13 is transferred to B14 and replaced.

Next, the second correction method will be explained.

As explained above, the operator presses the cursor keys 29,
30 moves the cursor mark KM to the correction position.

In other words, the character "open" is erased using the erase key 33, and the kana input key 2 is pressed to insert the character "announcement".
5, by inputting and converting "Koku", "Koku" is inserted.

This is because it is easier for the operator to understand if the correction is made using kana sentences.

As explained above, by moving the cursor keys, PB ₀ indicates the 〓〓 position, and PB ₁ indicates the cursor mark position 〓〓. Also, PA ₀ corresponds to A13
PA ₁ shows the position of the clause.

When the erase key 34 is operated here, the flow shown in FIG. 8 is operated, and now F ₂ and F ₃ are in the reset state, and only F ₁ is set. And PB ₀ =
Since it is not PB ₁ , proceed to step 430 and proceed to B14.
Store the delimiter code in the PB ₁ position. That is,
The character code 〓〓 is replaced with the delimiter code.

Furthermore, the character code of PB ₀ position 〓 〓 of B14 is A1
It is transferred to the PA ₀ position of 3, and the character code of “this” is replaced with “public” (431). followed by PA ₀
+1 ( ), PB ₀ +1 (〓〓) is performed to determine whether PB ₀ =PB _1. If PB ₀ ≠PB ₁ , the above steps 431 and 432 are repeated (431-433).

By this operation, the code of the kanji or kana character to the left of the cursor mark position of the designated phrase is transferred to A13 and replaced. If they are equal (PB ₀ =PB ₁ ), the delimiter code is replaced at the PA ₀ position () of A13 (434). followed by PA ₀ +
1, ()PB ₀ +1 (〓〓) is performed (435), and then PA ₀ →PA ₁ and PB ₀ →PB ₁ are performed (436). Subsequently, the PB ₁ position (〓〓) of B14 is read and it is determined whether it is a delimiter code. Since it is a character code now, proceed to 409 (437, 438).

Again, the character code of PB ₁ position (〓〓) of B14 is A
13 and is transferred to the PA ₁ position () and replaced. Subsequently, PA ₁ +1 () and PB ₁ +1 (〓〓) are performed to read the PB ₁ position of B14, and it is determined whether it is a delimiter code (410-412). The above operation is repeated until the delimiter code is read, and then the process moves to step 413.

In this state, as shown in Figure 9 D, kanji or kana characters are transferred and replaced, and PB ₀ →
PB ₁ (〓〓) is performed, and then the PA ₁ position () of A13 is read and it is determined whether it is a delimiter code, and if it is not a delimiter code, A13 is changed to PA ₁
Upper positions are shifted to the left (414, 415,
416). Also, when the delimiter code is read, KC
Set to the value corresponding to PB ₁ (〓〓) (418). Furthermore, A and B are combined and transferred to D7 for display.

Therefore, on the display device 6, "open" in FIG. Further, PA ₀ indicates the bottom position in FIG. 9D, and PA ₁ shows the bottom position.

Here, the operator can input the kana sentence "koku" to be corrected using the kana input key 25.
This progresses to the flow shown in Figure 3, and now only _F1 is set, so steps 100, 110, 111, 112
It works. As explained earlier, this means that PB ₀ =
PB ₁ (〓〓), therefore, the process proceeds to step 113 and performs PA ₀ →PA ₁ (〓〓), and a delimiter code is inserted at the PA ₁ position 〓〓 of A13, which corresponds to the previous kana input key operation. Similarly, the kana character code of IN4 is A13.
Inserted at PA ₁ position (105-108). This is the 9th
As shown in Figure E, the character code “ko” is inserted at the 〓〓 position.

As described above, each time the kana input key is input, the steps 100, 110 to 114, 105, to 108 are repeated and stored in A13 as shown in FIG. 9 (display in FIG. 9).

Here, by operating the conversion key 26 (or no conversion key 27), the B14
The information is stored in the file and further displayed as shown in FIG.

If the above-described cancel key is operated once again, the kana sentence of any of the designated phrases shown in FIG. 9 will be restored and displayed.

However, a phrase that has been corrected in the form of a sentence with kanji is displayed as a sentence with kanji instead of becoming a kana sentence. This is because each character in a kanji-mixed sentence does not correspond to each character in a kana sentence, and if they were to be made to correspond, each character would have to be converted inversely using the conversion table, which would complicate the kanji table. Further, there are problems such as the processing becomes complicated and the processing time becomes long. Therefore, here, in order to reduce this problem, uncorrected characters in a sentence mixed with kanji are transferred to A13. Therefore, it is also possible to correct character units within a clause.

Next, a description will be added of the flow chart that was not used in the above embodiment.

In FIG. 8, when the first character of a phrase is deleted, that is, when "Ko" (〓〓) in FIG. 9 is deleted, steps 405 to 407 are operated from step 404,
If the number of characters in the phrase is 1 or more, step
408 to 409 are operated and B14 as in the previous explanation.
Each character of the clause is transferred to the corresponding clause position of A13 and replaced.

Also, if the phrase is only one character, 420-428, 418
-419 is operated, and the character of B14 is transferred to A13 and replaced.

If you want to erase the last character of a clause, press
439 to 442 are operated from 438 and replaced in the same manner as above.

On the other hand, when inserting other words into a phrase, the left and right words in the phrase are separated by a delimiter code around the cursor mark position in the same way as with the erase key 38, and each character in B14 is separated by a delimiter code. Replacement is performed by separating the left and right parts around the separation point and transferring them to A13. This is the third
By proceeding to steps 100, 110 to 112, and 115 in the flowchart in the figure, and then operating steps 115 to 130, each character in B14 is transferred to A13, and a sentence containing kanji is separated from a kana sentence. remembered in form.

As described above, in the present invention, the first storage means stores the kana input characters inputted from the kana input section, and the kana character converts the kana input characters into kanji or kanji-mixed sentences for each word or phrase. In the kana-kanji conversion device, which comprises a kanji conversion means, a second storage means for storing the converted kanji or a sentence mixed with kanji, and a display device, the kana-kanji conversion device performs correction and editing of a sentence while looking at the display device; a delimiter information insertion means for inserting delimiter information for delimiting each word or phrase unit converted by the conversion means into the storage means and the second storage means in connection with the conversion operation; a determining means for determining that line editing has been completed based on a line feed instruction by operating a line feed key and inputting a preset number of input characters;
reset means for transferring kanji or sentences mixed with kanji from the storage means to the text memory and clearing the kana input characters, kanji or sentences mixed with kanji from the first and second storage means; position holding means for searching a delimiter information section of a first storage means corresponding to the cursor movement position and holding this section position information when the cursor is moved to the position of a desired kanji or a sentence mixed with kanji; a cancellation instruction means for issuing a conversion cancellation instruction for converting Kanji characters or sentences mixed with Kanji characters in the delimiter information section specified by the delimiter information section into kana characters; a first control means for extracting a kana character from a corresponding kana character section of the storage means; an erasure instruction means for issuing an erasure instruction to correct the kanji specified by the cursor; a second control means for erasing the kanji in the second storage means at the cursor position and the kana in the first storage means corresponding to the kanji, the kanji or kanji at any position in the line when editing the line input; This is a kana-kanji conversion device that can reversely convert mixed sentences into kana characters within the delimiter information section and delete only the specified kanji. Even if you notice an incorrect conversion later when editing a line input, it can be corrected. To provide a kana-kanji conversion device which can simply and easily perform kana without inputting kana again, and can also erase only designated kanji for correction, and can efficiently perform line input editing processing by combining these two functions.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the circuit configuration of the kana-kanji conversion device of the present invention, FIG. 2 is a diagram showing the keyboard surface of the device, FIGS. 3 to 8 are flowcharts showing the control operation of the device, and FIG. FIGS. 9A to 9C are diagrams showing the display state and buffer state during control, respectively. 1: Kana input board, 2: Control board, 5: Edit sequence circuit, 6: Display device, 7: Display buffer, 9: Conversion table, 11: Conversion circuit, 1
2: Memory circuit, 13: Buffer for kana input,
14: Buffer for sentences mixed with kanji, 15: Cursor counter, 18-22: Pointer, 26: Conversion key, 27: No conversion key, 28: Cancel key, 29
and 30: cursor movement key, 34: erase key.

Claims (1)

[Scope of Claims] 1. A first storage means for storing kana input characters inputted from a kana input section; a kana-kanji conversion means for converting the kana input characters into kanji or kanji-mixed sentences for each word or phrase unit; A kana-kanji conversion device comprising a second storage means and a display device for storing the converted kanji or a sentence mixed with kanji, and for correcting and editing a sentence while looking at the display device, wherein the first storage means and the first storage means a delimiter information insertion means for inserting delimiter information for delimiting each word or phrase unit converted by the conversion means into the storage means of 2 in connection with the conversion operation; a determining means for determining that line editing has been completed based on a line feed instruction by operating a line feed key and inputting a preset number of input characters;
reset means for transferring kanji or sentences mixed with kanji from the storage means to the text memory and clearing the kana input characters, kanji or sentences mixed with kanji from the first and second storage means; position holding means for searching a delimiter information section of a first storage means corresponding to the cursor movement position and holding this section position information when the cursor is moved to the position of a desired kanji or a sentence mixed with kanji; a cancellation specifying means for instructing conversion cancellation to convert Kanji characters or sentences mixed with Kanji in the delimiter information section designated by , into kana characters; a first control means for extracting a kana character from a corresponding kana character section of the storage means; an erasure instruction means for issuing an erasure instruction to correct the kanji specified by the cursor; a second control means for erasing the kanji in the second storage means at the cursor position and the kana in the first storage means corresponding to the kanji, the kanji or kanji at any position in the line when editing the line input; A kana-kanji conversion device that can reversely convert mixed sentences into kana characters within the delimiter information section and erase only specified kanji.