JP2543501B2 - Word processor - Google Patents

Description

The present invention relates to a word processor.

(Prior Art) In a Japanese word processor having a kana-kanji conversion function, when a sentence consisting of a plurality of clauses is input by kana input using the character keys of the keyboard, one sentence is a character data string of many hiragana characters ( (Undetermined kana character string) is stored, and the undetermined kana character string is displayed on the display. When the Kanji conversion key provided on the keyboard is operated to exchange the Kana character string for Kanji, the Kana character string is converted to Kanji, and the Kanji converted character string is displayed on the display as a candidate character string. It is supposed to be displayed.
If another candidate character string exists, the displayed candidate character string can be changed to another candidate character string by operating the next candidate key provided on the keyboard.

(Problems to be solved by the invention) In a conventional Japanese word processor, when a kana character string is input and then the kana character string is converted to kanji, the input character string is generally in both hiragana and kanji notation. Even if it was used for, it was converted to Kanji, and even if I later tried to select Hiragana notation, I could not change it to Hiragana notation. Then, in such a case, enter the kana character string while delimiting it and operate the non-conversion key at the delimiter you want to write in hiragana, or once confirm all candidate character strings and delete the kanji of the desired part. I had to re-enter the hiragana there, and in each case the operation was very cumbersome.

(Object) The object of the present invention is to solve the above-mentioned problems, and when the input character string includes both kana and kanji notation,
When the change key is operated, one of the notations is preferentially selected, and when the selected notation is not the desired notation, the remaining notations are selected, and the finally selected notation is converted to the next notation. The purpose of the present invention is to provide a word processor that can be selected preferentially even in the case of, and can easily perform the operation of Kanji conversion processing.

(Means for Solving Problems) In order to achieve the above-mentioned object, a word processor of the present invention has an input means for inputting kana characters and a kana character string in which the kana characters input by the input means are undetermined kana character strings. As a piece of information regarding each of a large number of candidate character strings, kana character string data representing reading, kanji notation data, and which of kana notation and kanji notation has priority. The second storage means for storing the priority information and the second storage means for the candidate character string corresponding to the kana character string data that matches the reading of the undetermined kana character string to be changed in the first storage means. And a conversion control means for converting an undetermined kana character string into a priority candidate character string written in one notation form according to priority information, and a priority candidate character string converted by the conversion control means. To the other notation form of both notations, a confirmation means for confirming the priority candidate character string as the confirmed character string, and the priority information of the candidate character string corresponding to the confirmed character string confirmed by the confirmation means. And a rewriting control means for rewriting according to the notation at the time of confirmation.

(Operation) In the word processor of the present invention having the above-mentioned configuration, when a kana character is input by the input means, the first storage means sequentially outputs kana characters input by the input means as an undetermined kana character string. Remember. Then, the conversion control means causes the second storage means to store the candidate character string corresponding to the kana character string data that matches the reading of the undetermined kana character string to be converted in the first storage means. In step 2, the undetermined kana character string is converted into a priority candidate character string represented in one notation form according to the priority information.
Further, the changing unit changes the priority candidate character string converted by the conversion control unit to the other notation form of both notations. When the operator operates the fixing means to select the priority candidate character string or the priority candidate character string changed by the changing means as the fixed character string, the priority candidate character string is fixed as the fixed character string. Then, the rewriting control means rewrites the priority information of the candidate character string corresponding to the confirmed character string confirmed by the determining means according to the notation at the time of confirmation.

(Embodiment) An embodiment in which the present invention is embodied in a Japanese word processor will be described below with reference to FIGS.

In FIG. 2, the main body case 2 of the word processor 1 is shown.
Is provided with a keyboard 3 as input means on the front side, and a printer 4 on the rear side. The keyboard 3 has a liquid crystal display 5 having a plurality of lines each having 40 columns.
Is provided. Various operation keys are arranged on the keyboard 3, a character key 6 for inputting letters and numbers of alphabets and hiragana, a kanji conversion key 7, a next candidate key 8 as a changing means, and an execution key as a confirming means. Various other keys such as 10 and a cursor movement key 11 are provided.

The Kanji conversion key 7 is operated when the input Kana character string is to be converted into a candidate character string containing Kanji characters, and the next candidate key 8 is a candidate character string containing Kanji characters converted when performing Kanji conversion. It is used when you want to change to a candidate character string. Further, the execution key 10 is used when the candidate character string selected by the operator is desired to be a confirmed character string, and is also operated to execute other processing such as outputting a document line feed command signal. The cursor movement key 11 is used to move the cursor displayed on the display screen of the liquid crystal display 5.

Next, an electric configuration of the word processor 1 will be described with reference to an electric block circuit diagram shown in FIG.

The central processing unit (hereinafter referred to as CPU) 13 as the conversion control means and the rewriting control means built in the main body case 2 has a read-only memory (ROM) 14 and a readable and rewritable memory (RAM). A working memory 15 is connected. The working memory 15 is an input buffer section 15a as a first storage means for temporarily storing character code data input by the character keys 6, and a learning memory as a second storage means for temporarily storing candidate character strings. It has 15b etc. C
PU13 is the keyboard 3 via the keyboard drive 16
To the liquid crystal display 5 via the display controller 17, and to the printer 4 via the print driver 18 and the code table 20. Further, the CPU 13 is connected to various memories such as a kanji dictionary memory 19 and a document memory 21.

The ROM 14 includes a program memory 22 storing various control programs such as a Japanese word processor control program, a keyboard control program, a printer control program, and a liquid crystal display control program for operating the word processor in various ways, and a character generator 23. ing. Then, the CPU 13 operates according to the various control programs. The character generator 23 stores character pattern data such as characters and symbols to be displayed or printed in a dot matrix for each typeface.

The Kanji dictionary memory 19 stores various kinds of Kanji data necessary for Kana-Kanji conversion, and is appropriately selected and read at the time of Kanji conversion. That is, in the kanji dictionary memory 19, as shown in FIG. 4, character string data representing one reading 25, kanji character data 26 corresponding to the character string data, grammatical information 27, and hiragana and kanji notation are generally used. Stores the notation information 28 that indicates whether or not it is used, and if both notations are generally used, priority information 29 that indicates which one of the kana notation and kanji notation will be given priority. There is.

Further, the code table 20 stores codes corresponding to the respective characters and symbols, and signals are coded in accordance with the code table 20 at the time of input operation of the character keys or the like. In addition, the document memory 21 is a character key 6 of the keyboard 3.
Character data input by the operator operating the above is stored in the input buffer unit 15a, and is transferred and stored when storing the character data.

Next, the operation of the word processor 1 configured as described above will be described with reference to the flowchart of FIG.

When the power is turned on, step S1 (hereinafter, simply "S1"
, And the same applies to others), after a predetermined initial setting has been made, a so-called key scan state is set in S2,
The CPU 13 waits for key input.

When the operator operates any key on the keyboard 3, the determination in S2 becomes YES, and the CPU 13 determines in S3, S what the operated key is based on the keyboard control program.
It is judged in 6, S16 and S20.

When a key related to document input such as the character key 6 is operated, the determination in S3 becomes YES, and the CPU 13 causes the input buffer unit 15a of the working memory 15 to sequentially store the character data input in S4 and controls the liquid crystal display. S5 based on the program
The document is displayed on the liquid crystal display 5 according to the data stored in the input buffer section 15a. The kana character string before being converted to kana-kanji (hereinafter referred to as an undetermined kana character string) is displayed in reverse video. After that, the program returns to S2 again.

When the Kanji conversion key 7 is operated, the CPU 13 executes S based on the Kanji conversion command signal input from the Kanji conversion key 7.
If the determination in 3 is NO, the determination in S6 is YES, the CPU 13 determines in S7 whether or not there is an undetermined kana character string in the input buffer unit 15a, and if not, an error such as sounding the buzzer in S15. After processing, the process returns to S2. On the other hand, if there is an undetermined kana character string, the CPU 13 determines YES in S7, reads the undetermined kana character string to be converted based on the cursor address, and in S8 the reading candidate character corresponding to the learning memory 15b. The column is searched and it is determined in S9 whether or not there is a corresponding candidate character string in the learning memory 15b. Since no candidate character string to be read is initially stored in the learning memory 15b, the process moves to S10 and the Kanji dictionary memory 19 is referenced to search for a candidate character string corresponding to the corresponding reading 25. Next, in S11, the CPU 13 displays kana based on the notation information 28 among various data corresponding to the retrieved candidate character string.
It is determined whether or not the user has both the Kanji notation. If the CPU 13 determines that there are both notations, then the CPU 13 determines in S12 based on the priority information 29 whether or not the Kanji notation has priority, and YES.
In the case of, the CPU 13 displays the candidate character string in the Kanji notation on the liquid crystal display 5 based on the Kanji notation data 26 in S13, and then S2
And wait for the next key input.

When the CPU 13 determines NO in S11, the CPU 13 displays the candidate character string in the Chinese character notation on the liquid crystal display 5 in S13 when the Chinese character notation data 26 exists, and when not in S14, the candidate character string in the Hiragana notation. Is displayed and S2 waits for the next key input. or,
When the CPU 13 determines NO in S12, the input buffer 1 in S14
A candidate character string is displayed on the liquid crystal display 5 in Hiragana notation based on the character code of the undetermined kana character string which is stored in 5a and waits for the next key input in S2. That is, in S14, the undetermined kana character string that was highlighted is normally displayed and is searched as the hiragana candidate character string.

Next, if the candidate notation displayed on the liquid crystal display 5 is not the desired notation as described above, the next candidate key 8 is operated.
Then, the CPU 13 determines YES in S2 and NO in S3 and S6 based on the reconversion command signal input by operating the next candidate key 8, and determines YES in S16. Then, the CPU 13 next displays the candidate character string currently displayed on the liquid crystal display 5 in kana notation.
Whether or not it has both the kanji notations is determined based on the notation information 28 corresponding to the reading.

When the CPU 13 makes a YES determination in S17, the CPU 13 displays the other notations on the liquid crystal display 5 based on the priority information 29 of the candidate character string currently displayed on the liquid crystal display 5 in S18.
Return to S2. If the CPU13 makes a NO determination in S17, the CPU13
Removes the candidate character string currently displayed on the liquid crystal display 5 in S19, moves to S8, searches the learning memory 15b for the next new candidate character string, and if there is no, in the Kanji dictionary memory 19
Search from.

Next, as described above, when the candidate notation displayed on the liquid crystal display 5 is the desired notation, the execute key 10 is operated. Then, the CPU 13 determines YES in S2 and NO in S3, S6, and S16 based on the signal input by operating the execution key 10, and S20
Check YES with. When this YES determination is made, the CPU 13
At 21, the candidate character string currently displayed on the liquid crystal display 5 is displayed as a confirmed character string, and the priority information 29 of the candidate character string is rewritten to information that gives priority to the notation at the time of confirmation, and the reading data 25 , Kanji notation data 26, grammar information 27, notation information 28
And so on, and transfers to learning memory 15b and returns to S2.

Thus, returning to S2, the documents are sequentially created, and the undetermined kana character string displayed on the liquid crystal display 5 is displayed as the confirmed character string. Character string data representing reading corresponding to the fixed character string, Kanji notation data 26 corresponding to the character string data,
Grammar information 27, notation information 28 indicating whether or not both Hiragana and Kanji are written, and if both are written, rewrite the information so that the final kana or kanji notation is written preferentially. The priority information 29 thus obtained is stored, and the word processor 1 will learn.

When this word processor 1 learns, when the same undetermined kana character string as the previously input undetermined kana character string is input and the kanji conversion key 7 is operated to convert the undetermined kana character string into kanji, YES for S2, NO for S3, Y for S6 and S7
Although it becomes ES, since the character string data of the candidate character string corresponding to the reading of the previously input undetermined kana character string is stored in the learning memory 15b, the corresponding candidate character string is searched in S8, and in S9 The determination of the CPU 13 is YES. Then, CPU1
In S11, it is determined in S11 whether or not there are both kana and kanji notations based on the notation information 28 corresponding to the reading, and the process proceeds to either S12 or S13 or S14 based on the determination result.

When any key other than the character key 6, the kanji conversion key 7, the next candidate key 8, and the execute key 10 is operated, the determinations in S3, S6, S16 and S20 are all NO, and the CPU 13 determines in S22 that each of the keys described above corresponds to each key. And then wait for key input in S2.

 Next, a specific example will be described.

When the power is turned on, the initial settings are made, and characters are being input, if an unconfirmed kana character string of “Ainiku” is now input via S2 to S5, “Ainiku” will be displayed on the LCD display 5. Is displayed. When the Kanji conversion key 7 is operated with the cursor positioned at this undetermined kana character string, the CPU 13 determines YES in S6 and S7 based on the Kanji conversion command signal from the Kanji conversion key 7, and in S9. Judge as NO.

Then, the CPU 13 sends the candidate character string to the Kanji dictionary memory 19 in S10.
It is determined from the notation information 28 corresponding to the retrieved candidate character string whether or not there is both notations in S11. Since the notation information 28 corresponding to the reading “Ainiku” is data with both notations, the CPU 13 determines YES in S11, and subsequently, the CPU 13 determines based on the priority information 29 in S12. Since this priority information 29 is the hiragana priority data in the kanji dictionary memory 19, the CPU 13 determines NO, and in S14, the kana notation "Ainiku" is displayed on the liquid crystal display 5 as it is, and S2 is displayed.
And wait for the next key input.

If the displayed notation is not the one desired by the operator, the operator operates the next candidate key 8. Then, the CPU 13 determines YES in S2 based on the reconversion command signal from the next candidate key 8.
NO is determined in S3 and S6, and YES is determined in S16. Then, through S17, the CPU 13 displays another notation of the candidate character string currently displayed on the liquid crystal display 5 at S18, that is, the kanji notation "raw hater" on the liquid crystal display 5, and returns to S2.

Then, when the execute key 10 is operated next, the CPU 13 executes S2 based on the signal input by operating the execute key 10.
YES, S3, S6, S16 makes a NO decision, and S20 makes a YES decision. If this YES determination is made, the CPU 13 displays the candidate character string currently displayed on the liquid crystal display device 5 in S21 as a confirmed character string, and as shown in FIG. It is rewritten into various information and read, and various data corresponding to "Ainiku" are transferred to the learning memory 15b, and the process returns to S2.

In this way, once the kana character string data or the like corresponding to the reading "Ainiku" is stored in the learning memory 15, and then the reading of "Ainiku" is input, the "Ainiku" is read.
When converting Kanji to S8, CPU13 determines YES in S8.
~ Go to S13 to display the kanji notation "raw hate".

It should be noted that the present invention is not limited to the above-mentioned embodiment, and can be arbitrarily modified within a range not departing from the spirit of the present invention.

(Effect of the Invention) As described in detail above, according to the word processor of the present invention, the conversion key is operated when both the kana notation and the kanji notation are generally used in the input character string. When one of the notations is selected preferentially, if the selected notation is not the desired notation, the remaining notations are selected, and the finally selected notation is prioritized at the next conversion. It has an excellent effect that it can be selected to, and the operation of the kanji conversion processing can be easily performed.

[Brief description of drawings]

FIG. 1 is an electric block circuit diagram of an embodiment embodying the present invention, FIG. 2 is a plan view of the Japanese word processor, FIG. 3 is a flow chart, and FIG. 4 is data stored in a kanji dictionary memory. FIG. 5 is an explanatory diagram showing the contents of data when the priority information stored in the learning memory is rewritten. 1 is a word processor, 3 is a keyboard, 4 is a printer, 5 is a liquid crystal display, 6 is a character key, 7 is a kanji conversion key, 8 is a next candidate key, 10 is an execution key, 13 is a CPU, 15 is a working memory, 15a is an input buffer unit, 15b is a learning memory,
19 is a kanji dictionary memory, 26 is kanji notation data, 27 is grammatical information, 28 is notation information, and 29 is priority information.

Continuation of the front page Jury President Judge Akira Matsuda Judge Joji Kasuya Judge Hiroyuki Yoshimura (56) References JP 57-57373 (JP, A) JP 58-172753 (JP, A)

Claims (1)

(57) [Claims] 1. An input means for inputting kana characters, a first storage means for sequentially storing kana characters input by the input means as an undetermined kana character string, and a plurality of candidate character strings. Second storage means for storing, as information, kana character string data representing reading, kanji notation data, and priority information indicating whether to give priority to kana notation or kanji notation, and the first storage means. A candidate character string corresponding to kana character string data that matches the reading of the undetermined kana character string to be converted in the second storage means, and the undetermined kana character string is subjected to the priority information. Conversion control means for converting to a priority candidate character string represented in one notation form, change means for changing the priority candidate character string converted by the conversion control means to the other notation form of the both notations, And a rewriting control unit that rewrites the priority information of the candidate character string corresponding to the fixed character string fixed by the fixing unit according to the notation at the time of fixing. A word processor characterized in that.