JPH0630107B2 - Document processor - Google Patents

Description

TECHNICAL FIELD OF THE INVENTION The present invention relates to an improvement of a document processing device such as a kana-kanji conversion device.

<Technical background of the invention and its problems> Generally, in a kana-kanji conversion device, for example, when it is necessary to input kana of a person's name, change “hama” to “hama” and “sawa” to “sawa” after kanji conversion. There is. Among the words in general sentences, "light" and "light", "art" and "gei", "hook"
There is a case where it is desired to change according to the user's preference such as "hook".

However, registering a word containing Kanji with different fonts as one word for each font requires an enormous memory capacity for storing the dictionary and lowers the correct answer rate for selecting homophones. This is not practical.

Therefore, conventionally, in order to use different fonts, it is often necessary to use code input (JIS code input) or the like, and there is a problem in that operability is poor.

It is also possible to identify and input different fonts as described above by handwritten Chinese character recognition, but such a method increases the number of dictionaries used for recognition processing, and
There is a problem in that the operator has to write a complicated font accurately.

<Objects of the Invention> The present invention has been made for the purpose of providing a novel document processing device that eliminates the above-mentioned conventional problems. To achieve this object, the document processing device of the present invention is an input device. Storing means for storing kana-kanji mixed sentences obtained by converting kana-character strings input by the means, kana-kanji characters, table means for storing characters having different notation relations in the same meaning in association with each other, and storing in the storage means Display means for displaying a mixed kana-kanji mixed sentence, and replacement instruction means for instructing replacement of a desired character designated by the cursor among the characters in the kana-kanji mixed sentence displayed on the display means,
Searching means for searching the table means for a character having a different notation relationship in the same meaning as the character designated by the cursor on the basis of the operation of the replacement instructing means, and outputting it to the display means; And a replacing means for replacing the designated character with the character designated by the cursor and storing it in the storage means.

<Examples of the Invention> Hereinafter, the present invention will be described in detail with reference to the drawings.

FIG. 1 is an overall block diagram of an embodiment in which the present invention is applied to a kana-kanji conversion device.

In FIG. 1, reference numeral 1 is a processing device for controlling the entire processing, and in the case of a kana-kanji conversion device, it includes a kana-kanji conversion part, a word dictionary storage part and the like. Reference numeral 2 denotes a storage means for storing a replacement table provided for carrying out the present invention, and the storage means 2 stores kanji characters that are replaced as shown in FIG. For example, “Sawa” is stored as a pair of a corresponding kanji code 21 and a substitute kanji code 22. Reference numeral 3 is a text buffer, 4 is a character pattern storage device, and 5 is a display device. The character string code stored in the text buffer 3 is converted into a display pattern based on the stored contents of the character pattern storage device 4 and displayed. It is configured to be displayed on the device 5.

Reference numeral 6 denotes an input device including a keyboard and the like, which includes an instruction means 61 for moving a cursor on the screen of the display device 5 and a character replacement instruction means 62 as described later.

In the above configuration, the character string to be converted into Kana-Kanji is input to the control device 1 from the input device 6, and the control device 1
The kana character string input to is supplied to the kana-kanji conversion unit in the control device 1, and if the contents stored in the word dictionary storage unit are searched and there is a match, the kana portion is stored in the word dictionary storage unit. Converted to content (Kanji). The Chinese character mixed sentence (code string) thus obtained is stored in the sentence buffer 3.

Now, assuming that a kanji mixed sentence as shown in FIG. 3 (a) is stored in the sentence buffer 3, the operation of replacing a specific character with a character of a different font according to the present invention will be described. .

FIG. 4 is a flow chart showing the operation of character replacement according to the present invention.

The contents of the text buffer 3 are displayed on the display device 5, and the operator looks at this display screen to determine the character to be replaced. First, the instruction means 61 of the input device 6 is operated to move the cursor on the screen of the display device 5 to select a desired character (for example, "Sawa") in the character string in the sentence buffer 3 (step n1). ). Next, when the operator operates the character replacement instructing means 62 of the input device 6 to instruct replacement of characters (step n2), the following processing is performed under the control of the control device 1.

First, the character code for the character selected by the operation of step n1 is searched from the replaced kanji code 21 stored in the storage means 2 (step n3), and when there is a matching kanji code 21 in this search. Is the character of the replacement character code 22 stored in correspondence with the retrieved character code 21 (for example, the kanji code 21 of FIG. 2).
For "Sawa", the Kanji code 22 "Sawa") is read and the character selected by the operation of step n1 is replaced with the character read from the area 22 of the storage means 2 (step n4). Further, the replacement result in step n4 is displayed on the display device 5 (step n5), and the replacement operation for one character is completed.

Further, in the process of step n3, if the search operations do not match, the process proceeds to step n6, and a message indicating that the character to be replaced with the character selected by the operation of step n1 is not stored in the storage means 2 is replaced. The processing will end.

By performing the above replacement process for each character to be replaced, the contents of the character buffer 3 are corrected from the state of FIG. 3 (a) to the state of FIG. 3 (b), and the atypical characters can be easily operated. Can be used.

Second as a table for character conversion stored in the storage means 2
As shown in the figure, in addition to the "hama" → "hama" pair, "hama" →
If you also store a pair of "Hama", you can easily return to the original font by the same operation. There are 3 different fonts
Even if there are more than one, for example, "saki" → "saki", "saki" →
By storing a pair of characters such as "碕" and "碕" → "saki" as a table, the fonts can be sequentially replaced.

In addition, when adding a font registered by the user, This can be easily dealt with by adding or modifying a table stored in the storage means 2 such as "Hama" → "Hama".

It should be noted that, although the substitution of heterographs has been described in the above embodiment, the present invention is not limited to this, and for example, “)” → “}”, “}” → “]”, “]” → “> ],
The correspondence of symbols such as ">" → "]" and "]" → ")" may be stored as a table, and it is more effective if these can be arbitrarily registered by the user. It will be

Also, in order to replace Chinese characters according to user preferences, "red",
"Red", "Zhu", "Tan" or "Fast", "Ship",
Correspondence between characters having the same kind of meaning such as "ji" and "jin" may be stored as a table.

By arranging the codes to be stored in the area 21 of the storage means 2 shown in FIG. 2 or 4 in the order of the codes, the search can be performed considerably fast even if the storage capacity of the storage means 2 becomes large.

Further, a character to be replaced may be designated so that all the characters in a predetermined character string can be replaced.

As described above, different fonts can be easily used for accurate notation of person's name and rich expression of sentences, and symbols such as parentheses can be easily used according to the user's intention. .

In the above embodiment, the case where the present invention is used in the kana-kanji conversion device has been described as an example, but the present invention is not limited to this, and for example, as a text editing function of a Japanese word processor or in the character style in kanji recognition. It is suitable to be used as a correction function and also as a replacement function with a simplified font in Chinese or the like.

<Effects of the Invention> As described above, according to the document processing apparatus of the present invention, in the same meaning as the storage means for storing the kana-kanji mixed sentence obtained by converting the kana-character string input by the input means into kana-kanji. Table means for storing characters having different notation relations correspondingly, display means for displaying a kana-kanji mixed sentence stored in the storage means, and characters in the kana-kanji mixed sentence displayed on the display means, Replacement instruction means for instructing replacement of a desired character designated by the cursor,
Search means for searching the table means and outputting to the display means a character having a different notation relationship in the same meaning as the character designated by the cursor based on the operation of the replacement instruction means, and output by the search means. A character designated by a cursor and stored in the storage means, and a character in a kana-kanji mixed sentence having a different notation relation in the same meaning by a cursor replacement instruction. Can be replaced and updated and stored, the operability can be remarkably improved when replacing a character after the document is created, and the conventional problem that the memory capacity of the word dictionary becomes huge can be solved. ,
It is an excellent invention in practice.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an embodiment of the present invention, FIG. 2 is a diagram showing an example of a character replacement table, FIG. 3 is a diagram showing an example of contents stored in a text buffer, and FIG. 4 is a book. FIG. 5 is a process flow chart for explaining the operation of the invention, and FIG. 5 is a diagram showing another example of the character replacement table. 1 ... Processor, 2 ... Character replacement table storage means, 3
…… Sentence buffer, 4 …… Character pattern storage device, 5…
... display device, 6 input device, 61 cursor movement instruction means, 62 character replacement instruction means.

(72) Inventor Shinobu Shiotani 22-22 Nagaikecho, Abeno-ku, Osaka, Osaka Prefecture (56) References JP-A-58-182741 (JP, A) JP-A-56-92676 (JP, A) JP-A-58-123124 (JP, A)

Claims (2)

[Claims] 1. A storage means for storing a kana-kanji mixed sentence obtained by kana-kanji conversion of a kana character string input by the input means, and a table means for storing characters having different notation relations in the same meaning in association with each other. A display unit for displaying a kana-kanji mixed sentence stored in the storage means; Means, a searching means for searching the table means for a character having a different notational relationship in the same kind of meaning as the character designated by the cursor based on the operation of the replacement instructing means, and the searching means; And a replacement unit that replaces the character output by the character with the character designated by the cursor and stores the character in the storage unit. . 2. The document processing apparatus according to claim 1, wherein the characters stored in the table means can be arbitrarily set.