JP2713942B2 - Kana-Kanji conversion device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a kana-kanji conversion device, and in particular, even if the correspondence between the reading and the notation of a character string once converted into a kanji-kana mixed sentence is destroyed, The present invention relates to a kana-kanji conversion device having means for performing re-conversion.

[Conventional technology]

Conventionally, there have been known several methods of returning the conversion result once obtained to the state before the conversion (reading state) again and re-converting it. One of the methods is disclosed in Japanese Patent Application Laid-Open No. Sho 60-205662, "Kana-Kanji conversion method". There is something written in ". In the method shown here, by moving the cursor or the like to the character string of the conversion result and instructing re-conversion, the character string of the idiom or phrase including the position of the cursor is returned to the reading and the reading is performed. The conversion is performed again with additions or modifications. Such re-conversion is possible because the reading corresponds to the converted character string.

[Problems to be solved by the invention]

In the re-conversion as described above, when the operator performs an operation that destroys the phrase information, for example, an operation that deletes one character of the character string in the phrase, the correspondence between the reading and the notation is lost. As a result, it has become established and cannot be reconverted.

However, from an operator's point of view, a part of the created character string can be re-converted, but a part cannot be re-converted, which is inconvenient.

An object of the present invention is to provide a kana-kanji conversion device having means capable of re-converting even if the correspondence between the reading of a character string in a phrase and the notation is broken once in such a kana-kanji conversion method according to the prior art. Is to do.

[Means for solving the problem]

In order to achieve the above object, as shown in FIG. 1A, kana-kanji conversion means for performing kana-kanji conversion based on input reading, and display means for displaying a conversion result obtained by the kana-kanji conversion means A storage unit that stores the reading and the conversion result in association with each other, and a notation that displays the conversion result by a predetermined input operation no longer matches the reading of the character stored in the storage unit. And reading setting means for setting a reading corresponding to the notation after the predetermined input operation and storing the reading in the storage means in association with the notation after the predetermined input operation, and setting the reading by the reading setting means. The kana-kanji conversion is performed by the kana-kanji conversion means by combining the read and the additionally input yomi.

[Action]

When the input reading is converted and the phrase in which the correspondence relationship with the reading is maintained is canceled by performing an input operation such as deleting a character in the phrase, the reading setting is changed. Since the reading corresponding to the character constituting the phrase is set by the means, the correspondence between the reading and the conversion result is maintained.

The kana-kanji conversion means converts the combined reading with a newly added reading by the operator, and converts the combined reading by using the kana-kanji conversion means. Can be performed.

〔Example〕

 Hereinafter, an embodiment of the present invention will be described.

FIG. 2 is a block diagram showing the configuration of the kana-kanji conversion device of the present invention.

In this figure, the key code memory 207 and the key input device 208 constitute the input means in FIG. 1A, and the kana-kanji conversion device 204 constitutes the kana-kanji conversion means in FIG. 1A.
Also, the pattern generator 209, the display control circuit 210, the display device
The display means 205, the reading buffer 206, and the reading notation correspondence table 214 constitute the storage means shown in FIG. 1A. Further, the independent word dictionary 215 and the morphological dictionary 216 constitute reading setting means in FIG. 1A, and the processing device 201 and the program memory 203 constitute control means in FIG. 1A for controlling all the above means.

In FIG. 2, a processing unit 201 is, for example, a microprocessor, executes a program stored in a program memory 203, and controls each block and transfers data via a bus line 202.

When a character or a key code for instructing control is input from the key input device 208 which is a part of the data input device, the key code is stored in the key code memory 207. If the input code represents a character, the processing device 201 causes the pattern generation device 209 to generate a pattern of the input character, and displays the pattern on the display device 211 through the display control circuit 210. The kana-kanji conversion device performs the kana-kanji conversion on the character string as a reading of the kana-kanji conversion,
The result is stored in the display buffer 205 and displayed on the display device 211 at the same time. At this time, the reading used for performing the kana-kanji conversion is stored in the reading buffer 206, and is stored in a form corresponding to the notation in the notation buffer 205 even after the conversion is completed. This string is called an unestablished string when the notation is stored in a corresponding way). The correspondence between the above readings and notations is in the reading notation correspondence table
Stored in 214.

As described above, even for a character string once converted to Kana-Kanji, the correspondence between the reading and the notation is maintained, so that the character string displayed on the display device 211 pointed by the cursor pointer 213 is re-converted. If an instruction is given, the conversion is performed again based on the read information. However, when the content of the key input from the key input device 208 is such that the relationship between the above reading and the notation is broken, the correspondence stored in the reading notation correspondence table is broken (in this way, the reading and the notation). A string that has been broken in notation is called an established string.)
At this time, the processing device 201 searches the independent word dictionary 215 for a character string constituting the established character string, and decomposes it into a morpheme (a grammatical word in Japanese, which is a part of speech and a synonym). Further, for each morpheme, the morpheme dictionary 216 is searched, the reading of each morpheme is obtained, and registered in the reading notation correspondence table 214. Therefore, the character string converted by the Kana-Kanji conversion device 204 has a reading / notation correspondence table for each unconverted unit such as a phrase, for an unestablished character string.
The correspondence between reading and notation is stored in the reading notation correspondence table 214 for each established morpheme unit.

When a re-conversion instruction is given to the character string indicated by the cursor controlled by the cursor control device 212, the re-conversion is executed for both the unestablished character and the established character based on the correspondence between the reading and the notation. Is done.

FIG. 1B is a flowchart of the processing function of the kana-kanji conversion device, and the processing will be described below with reference to FIG.

When the process is started in FIG. 1B (101), the operator first sets a character connection mode flag (102). The character connection mode flag is used to determine whether the unestablished character area and the established character area are to be connected or separated when reconverting an already created document later. The setting in 102 is the setting of the initial state, and is set to the one to be connected in normal use.

Next, in the key input process (103), the key input device 2
Accept keys sequentially from 08. The processing device 201 determines whether the accepted key is a key for initiating reconversion, or a key that causes phrase destruction, for example, an editing function key such as deletion, insertion, movement, or copying, or , It is determined whether any of the above two types of keys is not (10
4), execute the following processing.

"1" When the key causes phrase destruction.

First, a function that causes phrase destruction is executed (111). For example, if it is a delete key, the character string in the specified range is deleted. Also, some phrase destruction keys, such as the insertion key, do not cause phrase destruction if they are at breaks in the phrase. Therefore, when the above-mentioned key is such a key, the processing device 201 determines whether or not the cursor position at the time of input is at a break of a phrase (112). If the cursor hits a break in the phrase, even if the key that causes the breakage of the phrase is pressed,
Since the correspondence between the notation of the unestablished character string and the reading does not collapse,
The following processing is not required. Therefore, the process proceeds to the next key input process without doing anything (103). If the cursor is not at a break and the key that causes breakage is pressed, or if the delete key is pressed even at the break, the reading and notation are written for each morpheme in the phrase. Is written in the reading notation correspondence table (113). Furthermore, the established character flag is set for each morpheme in the clause (11
4) Make sure that all the notations in the above-mentioned clauses are established characters, and that the readings are given to each morpheme in the reading notation correspondence table 214.

"2" For reconversion key.

The processing device 201 first makes a request for specifying the range of reconversion through the display device 211. The operator specifies the range to be reconverted (105), but the processing device 201 determines whether or not the range to be reconverted includes the established character (106). Divided into

(A) When no established character is included.

In this case, normal reconversion is performed on the specified range (107).

(B) Cases that include established characters.

In this case, it is determined whether the character connection mode is set (108). If the character concatenation mode is set, the reconversion will be included in the specified range,
The re-conversion is performed by linking the unestablished characters (109). That is, for established characters, the reading notation correspondence table 21
4 and for unestablished characters, the readings entered as kana when converted to Kana-Kanji are stored for each phrase or morpheme, so reread them by concatenating them. A conversion is performed. If the character connection mode is not set, the unestablished character and the established character are separately re-converted (110). That is, established characters are converted again by readings taken from the reading notation correspondence table 214, and unestablished characters are converted again by readings input as readings when converted to kana-kanji. is there.

[3] When the key is not a key that causes phrase destruction or a key that prompts re-conversion.

 The function of the key is executed (115).

When the processes of "1", "2", and "3" described above are completed, the process returns to the key input process 103, and the above processes are repeated.

FIG. 3 is an example of the reconversion operation showing the state displayed on the display device 211 in FIG. 2 when the present invention is implemented. In FIG. 3, a text display portion of a display screen 301 includes a conversion character string 302 “Kana-Kanji conversion”.
Is displayed, and the cursor 303 is displayed immediately after the converted character string 302. This state occurs when the conversion key is pressed immediately after reading and inputting "Kanakan Henkan", or
Occurs when the cursor is moved immediately after an unestablished character string such as "To Kana-Kanji conversion". In this state, it is assumed that the operator intends to correct the “word” part of the “kana-kanji conversion” of the conversion character string 302 to “character”. In normal use, return to reading first, correct the "go" part to "ji", and then issue a reconversion command, if there is no established character in the converted character string, the conventional reconversion function But it can be corrected. However, depending on the operator, the cursor may be moved to "word" and the one-letter deletion key may be pressed first.
In such a case, in the conventional Kana-Kanji conversion device, since “Kanji” has become one word, that is, a morpheme, phrase destruction occurs, and as in the character string 305 shown on the display device 304, To correct this, only "kanji", including the reading of "kan", must be entered and converted. In the present embodiment, since the reading “kan” extracted from the reading notation table 214 remains in the “kan” of 304 as a reading, the reading “ji” is inserted after the “kan” of the character string of 305. When a re-conversion instruction is given, as shown in the conversion character string 306 of the display device 305, the reading of "kan", the reading of "ji" input by the operator, and the The unestablished characters are concatenated to obtain the result "to kanji conversion".

FIG. 4 is a reading notation correspondence table 214 in FIG.
FIG. 3 is a diagram illustrating an example of the configuration of FIG. The reading notation correspondence table 214 has a structure as shown in FIG. That is, it is composed of a notation 401, an unestablished / established character string distinction 402, and a reading 403. FIG. 4 shows table information 404 to 409 corresponding to the character strings described in FIG. The information 404 to 406 in FIG. 9A is a state before the phrase is destroyed, and the information 407 to 409 in FIG. 10B are the states when the phrase is destroyed and the operator inputs the reading “ji”. It is. However, since “ji” has not been converted yet, it is not shown in FIG. Of the information in the column 402 for distinguishing between an unestablished and established character string, "un" represents an unestablished character string, and "sure" represents an established character string. An unestablished character string 405 of “Kanji” before the destruction of the phrase becomes an established character string 408 of “Kan” after the destruction of the phrase. Since the input character string “ji” has not been converted yet, it is not shown in FIG. Here, since "kan" also has the reading "kan", it can be converted to "kanji conversion" by re-converting the combination of readings of characters 407 to 409 together with the input characters.

〔The invention's effect〕

As described above, according to the present invention, even if the kana-kanji converted part is destructed by some operation and the character string is changed to the established character, the operator can change to the established character. Re-conversion can be performed without re-inputting part readings. Therefore, the number of re-input characters is reduced, and the efficiency of document creation / editing is improved.

The present invention can effectively use the re-conversion function when the operator mistakenly performs an operation that causes segment breakage.

[Brief description of the drawings]

FIG. 1A is a block diagram showing the configuration of the present invention, and FIG. 1B is a flowchart of the processing function of the kana-kanji conversion device according to the present invention.
FIG. 2 is a block diagram showing the configuration of an embodiment of the present invention.
FIG. 3 is an explanatory diagram showing an example of a display state realized on the display device when the processing according to the present invention is executed. FIG. 4 is a processing table realized in a memory when the present invention is executed. FIG. 4 is an explanatory diagram showing an example of the state of FIG.

 ──────────────────────────────────────────────────続 き Continuing on the front page (72) Inventor Hiroyuki Kumai 292 Yoshida-cho, Totsuka-ku, Yokohama-shi, Kanagawa Prefecture Inside the Microelectronics Equipment Development Laboratory, Hitachi, Ltd. 1-1 1-1, Hitachi, Ltd. Taga Plant Hitachi, Ltd. Shigeki Taniguchi 1-1-1, Higashitaga-cho, Hitachi City, Ibaraki Prefecture Inside Taga Plant, Hitachi, Ltd.

Claims (1)

(57) [Claims] 1. Kana-kanji conversion means for performing kana-kanji conversion based on an input reading, display means for displaying a conversion result obtained by the kana-kanji conversion means, and storing the reading and the conversion result in association with each other. Storage means for performing, when the notation that displayed the conversion result by a predetermined input operation no longer matches the reading of the character stored in the storage means, the notation corresponding to the notation after the predetermined input operation Reading setting means for setting a reading and storing the reading in the storage means in association with the notation after the predetermined input operation; combining the reading set by the reading setting means and the additionally input reading; A kana-kanji conversion device, wherein the kana-kanji conversion means performs kana-kanji conversion on the combined reading.