JP3073226B2 - Document processing device - Google Patents

Description

The present invention relates to a document processing apparatus, and more particularly, to a document processing apparatus for performing kana-kanji conversion by continuous phrase conversion.

(B) Conventional technology Conventionally, a document processing apparatus of this type automatically inserts a segment break into a character string input from a keyboard (performs a segmentation process) and converts the character string into a plurality of phrase units. In addition to converting to Kanji including Dekana, when the cancel key of the keyboard is pressed, the break of the inserted phrase is automatically released, and the conversion is performed again according to the phrase break specified by the operator. Have been. Also, in simple word conversion and phrase conversion, by using a so-called learning function, words that have been converted once can be rearranged as first conversion candidates in the next conversion, thereby increasing the conversion efficiency.

(C) Problems to be Solved by the Invention However, since the learning function described above cannot be used for continuous phrase conversion, words that are incorrectly converted in continuous phrase conversion must be manually corrected by the operator each time. Did not. To explain with an example, for example, if you want to convert the character string "Kensei no Kenken" to "Constructive opinion", even if you press the conversion key after entering the character string, it will be incorrectly converted to "Constructive right" Therefore, the operator must use the cancel key to return the character string before the conversion to the character string before the conversion, and perform a correction operation to convert the character string back into the “non-opinion” again. Further, in such a character string conversion, erroneous conversion is repeated because a segment break is mechanically inserted no matter how many times the character string is converted. Therefore, the operator has to repeat the correction operation each time. This not only significantly reduces the work efficiency in document editing, but also imposes a burden on the operator.

The present invention has been made in view of the above circumstances, and a main object of the present invention is to provide a document processing apparatus configured so as not to repeat erroneous conversion of a word corrected by cancellation in continuous phrase conversion.

(D) Means for Solving the Problems FIG. 1 is a block diagram showing the basic configuration of the present invention. In the figure, the present invention automatically inserts a paragraph break into the reading character string input from the input means 1 and converts it into a word. Each time the cancel key is pressed, the converted word is converted into a phrase break. A cancel instruction storage means for storing a cancel instruction by pressing a cancel key in a document processing apparatus for performing a conversion again according to a segment break specified by an operator after returning a reading character string to a unit, and Judging means for judging whether or not the conversion result is composed of two clauses by counting that re-conversion has been performed twice after the instruction, and reading the converted word judged as two clauses by the judging means. And a word storage means for storing the read-character string from the input means when the read character string corresponds to the two-phrase conversion word read information in the word storage means. A document processing apparatus comprising a conversion means 5 for converting said read viewed string 2 phrase conversion language.

The document processing device according to the present invention includes a Japanese word processor, an office computer having a Japanese editing function, and the like.

(E) Operation According to the present invention, when the cancel key is pressed, the conversion cancellation is stored in the cancellation instruction storage means, and when the conversion is performed again in this state, the conversion result is 2 by the determination means.
It is determined whether the word is composed of phrases. If the converted word is determined to be two phrases, a pair of words is stored in the word storage together with the reading information. Then, the reading character string is input next time, and if the reading character string corresponds to the reading information of the two-segment conversion word in the word storage means, it operates to convert the reading character string into the two-segment conversion word.

(F) Embodiment The present invention will be described in detail below based on an embodiment shown in the drawings.
The present invention is not limited by this.

FIG. 2 is a block diagram showing the configuration of a Japanese word processor according to one embodiment of the present invention. In the figure,
Reference numeral 10 denotes an input device, which is composed of a keyboard and includes a character input key, a conversion key, a cancel key, a cursor movement key, a registration key for performing learning registration, an edit key for performing various edits, and the like. Note that the input device may be constituted by a pointing device, specifically, a mouse, a tablet input device, or the like. Reference numeral 11 denotes a character string control device including a microprocessor, which codes a signal input from the input device 10 and controls a series of processes such as input, display, and storage. In this embodiment, it is determined whether the reconverted word is a pair of words having a connection (hereinafter referred to as a word pair) with respect to the word reconverted after the cancel key is pressed, and the word determined as the pair is read. The information is stored in a storage device described later together with the information, and when a character string is input from the input device 10 next, it is checked whether the character string corresponds to the reading of a pair of words stored in the storage device 13. If so, the character string is converted as a pair of words. Reference numeral 12 denotes a display device, which is configured by a dot matrix type display device such as a CRT or an LCD, and displays processing contents. Reference numeral 13 denotes a storage device which is composed of a RAM, and stores a document buffer 130 for storing edited documents, a work buffer 131 for storing processed data, a learning buffer 132 for storing learning contents, and a conversion cancellation state. A condition flag 133 for storing, a condition satisfaction flag 134 for storing that the condition of the word pair is satisfied, and other flags are provided. The learning content indicates a word pair determined to be converted into a pair as described above, and its reading information. Reference numeral 14 denotes a kana-kanji conversion processing device having a learning function, which has a configuration equivalent to a conventional configuration.

This Japanese word processor has a conventionally known conversion function, that is, automatically inserts a segment break into a character string input from the input device 10, converts the character string into words in units of phrases, and performs a cancel key. When a is pressed, a break function of the inserted phrase is released, and the conversion is performed again according to the phrase break specified by the operator.

Next, the processing flow of this embodiment will be described in detail with reference to FIG. 4 along with specific operation examples and display examples shown in FIG.

Signals input from the input device 10 are sequentially coded and provided to the character string control device 11. The character string control device 11 determines which process the input and transferred code is to be assigned, for example, a character input key, a conversion key, a cancel key, a cursor movement key, a registration key, an edit key, and the like, based on the determination result. Executes the assigned function. If the input code is a character, it is stored in the storage device 13 as a kana-kanji conversion target character string, and all condition flags and the like related to word pair learning are initialized (step 20). If the entered code is a conversion key (Step 2
1) It is determined whether a character string to be converted to Kana-Kanji is stored. If there is a character string to be converted, the Kana-Kanji conversion processor 14 is activated to convert the Kana-character string to a Kanji-Kana mixed character string. In this state, it is determined whether or not the flag 1 is set in the condition flag 133 indicating whether or not the character string to be converted in front of the cursor is once canceled (steps 22 to 23), and is set. In this case, it is determined whether or not the number of phrases in the conversion result is one (step 24). If it is one, the position of the phrase in the storage device 13 is stored (step 25). Increment the counter that counts the number (step 2
6). If the value of the counter is 2, the conversion after the cancellation has been performed twice, and the positional relationship between the two phrases is checked (steps 27 → 28).
If these two phrases are adjacent to each other, the condition is satisfied as a word pair, and the condition satisfaction flag 13
Set 4 (step 29) to set the state ready for learning registration. In the course of this series of processing after the conversion key is depressed, if the condition is not met and word pair learning is already registered, priority conversion is performed and the conversion result is displayed (step 30). ) Return to the state of waiting for the next key input.

If the entered code is a cancel key (Step 3
1), one phrase in front of the cursor is returned to a kana character string as a character string to be converted (step 32), a condition flag 133 indicating that the cancel key is pressed is set to flag 1 (step 33), and displayed. After processing (step 30), the process returns to the state of waiting for a key input.

If the input code is a cursor movement key (step 34), the cursor is moved (step 35) to perform display processing (step 30), and the process returns to a state of waiting for a key input.

If the input code is a key for instructing word pair learning registration / cancellation, for example, if the function key and the space key are pressed at the same time, the process enters the word pair learning registration / cancellation process. First, a condition satisfaction flag 134 indicating whether or not a condition for learning is satisfied is checked (step 37). If the flag is set (step 38), a key of only registration or cancellation of registration is continued. The state is determined (step 39), and the process branches to registration (steps 40 → 41) or registration cancellation processing (steps 40 → 42).

In the case of the registration process, the word pair is stored in the learning buffer 132 in the storage device 13. The stored information is a pair of address numbers assigned to words in a conversion dictionary provided in the kana-kanji conversion processing device 14.

In the case of the canceling process, the corresponding word pair stored in the learning buffer 132 is deleted. In this embodiment, the registration / cancellation of learning is configured to be alternately reversed according to the number of times the same key code is pressed. However, the registration and the cancellation can be respectively assigned to different keys.

If the character string key is pressed in step 36, the character storage flag is reset (step 44), and display is performed (step 30). Keys such as a character string key, a conversion key, a cancel key, a cursor movement key, and an editing process other than the learning registration / cancel key perform the process (step 45) and return to a state of waiting for a key input.

(1) to (6) of FIG. 3 show an operation example and a display example corresponding to the above-described processing. In addition, as shown in (6) of FIG. 3, when learning registration is performed, the learning location is highlighted so that the registration can be recognized. When the learning registration is canceled, the reverse display is returned to the normal display.

(G) Effects of the Invention According to the present invention, when a word composed of two phrases is erroneously converted, the erroneous conversion is repeated in the next conversion by learning the word as a word of two phrases at the time of correction. Since it is configured so as not to be, it is possible to improve the conversion efficiency in the continuous phrase conversion. Further, the operator does not need to repeat the same correction operation many times, and the burden on the operation can be eliminated.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a basic configuration of the present invention, FIG. 2 is a block diagram showing a configuration of one embodiment of the present invention, FIG. 3 is an explanatory diagram showing an operation example and a display example according to one embodiment, 4
FIG. 5 is a flowchart showing the processing contents of one embodiment. 1 ... input means, 2 ... cancellation instruction storage means, 3 ... determination means, 4 ... word storage means, 5 ... conversion means.

Claims (1)

(57) [Claims] 1. A method for automatically inserting a paragraph break into a reading character string input from an input means and converting the word into words, and reading a converted word in units of a phrase break each time the cancel key is pressed. In a document processing apparatus for performing a conversion again according to a phrase break specified by an operator after returning a character string to a phrase break and canceling the phrase break, a cancel instruction storage means for storing a cancel instruction by pressing a cancel key; Judging means for judging whether or not the conversion result is composed of two clauses by counting the fact that the conversion has been performed twice, and the converted word judged to be two clauses by the judging means is stored together with its reading information. Word reading means, and when a reading character string is inputted from the input means, if the reading character string corresponds to reading information of a two-segment conversion word in the word storage means, Document processing apparatus comprising a conversion means for converting the column into two phrase conversion language.