JP3070932B2 - Document processing device - Google Patents

Description

The present invention relates to a document processing apparatus provided with a kana-kanji conversion function.

(B) Conventional technology Reading to convert to Kanji-Kana-mixed sentences is usually input from input means such as a keyboard by directly inputting in Kana characters or by inputting in Roman characters and automatically converting it to Kana. .

Japanese word processor SWP-360 manufactured by Sanyo Electric Co., Ltd.
According to the operation manual of the above, in addition to the input of the reading for converting to the above Kanji kana mixed sentence, in addition to the normal kana input,
Only the kana characters previously input by the input operation can be automatically re-input by calling them by the kana calling operation. In such a call, a kana character string is stored in a buffer in the order of input in terms of clauses or words, and is called in the order of new storage in the buffer. For example, if there is an input that reads "Sanyo launches new product Sunward"
Each time a Kana call instruction is issued, the character string is called as a kana character string to be converted for Kana-Kanji conversion in the order of "Hatsubai", "Sanawa-do", "Shinseihin", and "Sanyoudenki".

(C) Problems to be Solved by the Invention However, in the above-described kana call, although there is no need to re-enter the already-input kana character string, a plurality of kana call keys are used until a desired kana character string is obtained. It must be pressed twice. For example, to add a reading to "Sanyo Denki" in a sentence containing Kanji characters such as "Sanyo launches a new product Sunward", press the kana call key multiple times (‥‥ "Hatsubai""Sanwa- Do, "Shinseihin,""SanyoDenki"), and the desired kana character string "Sanyo Denki" to obtain katakana conversion. Also, in the same document as this Kanji kana-mixed sentence "Sanyo launches new product Sunward", when using the Kanji character string "Sanyo Denki" again, press the Kana Pressing (‥‥ “Hatsubai”, “Sanawa-do”, “Shinseihin”, “Sanyoudenki”) required obtaining the desired kana character string “Sanyoudenki” and performing Kana-Kanji conversion. .

Therefore, when frequently performing the Kana-Kanji conversion or the Katakana conversion using the same Kana character string, it may be easier for the operator to re-enter the already-input Kana character string than to use the Kana call.

The present invention seeks to solve the problem of such a call.

(D) Means for Solving the Problems In order to solve the above problems, the present invention provides an input means for inputting a kana character string, instructing kana-kanji conversion and instructing a kana call, and inputting kana characters or kana characters. An input buffer for holding a sequence, a kana-kanji conversion means for converting a kana character string held in the input buffer into a kanji-kana mixed sentence, and storing the kana character string in kanji-converted and delimited word units. A kana accumulation buffer, and a mode determining means for storing the kana character string stored in the input buffer in a limited kana character string buffer when the instruction of the kana call is the first instruction;
Display means for displaying a kana character string in the input buffer and a kanji kana character string as a conversion result, wherein the kana character string stored in the limited kana character string buffer starts with the kana character string. Kana character strings stored in the storage buffer are sequentially read and searched, and instead of the searched kana character strings, the character strings are re-stored in the input buffer, and the kana-kanji conversion is performed according to an instruction of input means for instructing the kana-kanji conversion. It is characterized by doing.

(E) Function When the kana call is instructed by the kana call instructing means as described above, if the kana character string input from the input means has already been stored in the input buffer, the kana character string is stored in the kana storage buffer. Of the character strings, those that start with the kana character string stored in the input buffer are re-stored in the input buffer instead of the already-input kana character string, so that the same kana character string You can call Kana with good operability without inputting.

(F) Embodiment FIG. 1 is a block diagram showing a configuration of a document processing apparatus according to the present invention. The input unit 1 includes a keyboard provided with various instruction keys such as a character key for inputting a kana character string by kana input or Roman character input, an instruction key for instructing kana-kanji conversion, a cursor movement key, and a kana call key. The kana character string and the instruction input from the input unit 1 are given to the control unit 2. The control unit 2 controls data transmission and reception of each unit of the apparatus according to the given instruction, and displays the input kana character string on a CRT display. Output unit 3 consisting of
Output to

When a given input is a kana character string, the kana-kan control unit 4 stores the kana character string in the input buffer 5. When the kana-kanji conversion character string is determined as a result of the kana-kanji conversion, the input buffer 5 is initialized after each processing of the kana-kanji processing unit 6 and the kana storage registration unit 7 is completed.

The Kana-Kanji processing unit 6 converts the Kana character string in the input buffer 5 into a Kanji-Kana mixed character string when the Kana-Kanji conversion instruction is given, and outputs the character string to the output unit 3.

When the kana-kanji registration unit 7 determines the character string mixed with the kana-kana characters as a result of the kana-kanji conversion, it stores the kana character string used in the kana-kanji processing unit 6 in the kana storage buffer 8 for each word.

When there is a kana call instruction, the mode determination unit 9 determines whether the instruction is the first kana call instruction or a kana call instruction that has been performed continuously for the second time or later. The kana character string stored in the input buffer 5 is stored in the limited kana character string buffer 10.
On the other hand, if they are continuous, that is, after the second time,
Restart the kana call operation.

The kana call control unit 11 activates the kana storage buffer calling unit 12, calls kana character string candidates from the kana storage buffer 8 in units of phrases or words, and starts the kana character string stored in the limited kana character string buffer 10. , The input character string is stored in the input buffer 5. Then, the stored kana character string is subjected to kana-kanji conversion like the kana character string input from the normal input unit 1. If the kana character string stored in the input buffer 5 by the kana call includes the kana character string stored in the limited kana character string buffer 10 from the beginning but is not the desired kana character string, the kana character string is called again. Perform the instruction and restart the call operation. At this time, the input buffer 5 is initialized.

A kana character string candidate is called from the kana storage buffer 8 in units of phrases or words. If the kana character string stored in the limited kana character string buffer 10 is not included from the beginning, the kana storage buffer calling unit 12 is activated again. Read the next kana character string candidate.

A procedure for calling the kana by the document creating apparatus having such a configuration will be described using a specific example with reference to FIG.

It is assumed that the input buffer 5, the kana storage buffer 8, and the limited kana character string buffer 10 have not yet learned anything.

First, when a kana character string is input from the input unit 1 such as "Online is a key word for learning words" and a kana-kanji conversion instruction is given, the kana-kan control unit 4 is activated.
Stores the input kana character string in the input buffer 5 and outputs the kana character processing unit 6 via the mode determination unit 9.
Start The kana-kan processing unit 6 converts the input kana character string into “onsei: ha / words: // dentatsu: to do / kihonki: na / shudan :: (/ indicates a break, Represents a break between an independent word and an adjunct word), and performs Kana-Kanji conversion by dividing the phrase into units of kanji, and obtains a sentence "Sound is a basic means for transmitting words," mixed with Kanji. It should be noted that the internal data of the kana-kan processing unit 6, such as the segmentation of the kana character string, is held until the finalization processing is completed. The control unit 2 displays the result on an output unit 3 such as a CRT. When the operator performs the input of the next kana character “O”, the kana-kan control unit 4 performs the determination processing of the kana-kanji conversion result. That is, the kana storage registration unit 7 receives the “onsei” “words” in which the kana character string delimited by the phrase unit is input.
The data is registered in the kana storage buffer 8 in the order of "Dentatsu", "Kihonki", "Shudan". FIG. 2 is a conceptual diagram illustrating the registration state of such a storage buffer 8,
If the newly registered item is above and does not fit in the buffer, it is discarded from the information below by first-in first-out.

When the determination processing is completed, the kana-kan control unit 4 initializes the input buffer 5 and the kana-kan processing unit 6 and stores a new kana character input “O” in the input buffer 5.

If there is a kana call instruction, the mode discriminating unit 9 stores the content “O” of the input buffer 5 in the limited kana character string buffer 10 because it is the first kana call instruction, and the kana call control unit 11 is activated. . The kana call control unit 11
Using the kana storage buffer calling unit 12, the kana character string in the kana storage buffer 8 is updated in word units from the latest one (“Shudan”, “Kihonki”, “Dentatsu”, “Words”).
Then, it is checked whether the kana character string stored in the limited kana character string buffer 10 is included in the called word unit from the beginning. That is, using the kana character string stored in the limited kana character string buffer 10 as a search word, a search for a forward match is performed for the called word unit.

Specifically, first, the latest character string “Shudan” stored in the kana storage buffer 8 is called, and the kana character string “O” in the limited kana character string buffer 10 is compared for forward matching. In this case, since they do not match, the next data "" is called, and whether or not they match is compared. Such comparison ends when all the kana characters in the kana storage buffer 8 are called.

If there is a match ("Onsei")
The kana call control unit 11 stores the called kana character string in the input buffer 5 and terminates the kana call processing without storing anything in the input buffer 5 when calling all of the kana storage buffer 8 and terminating the processing. I do.

When “Onsei” is stored in the input buffer 5 by the kana calling process, a kanji string “voice” can be obtained by giving a kanji conversion instruction. Therefore, when the kana character string "onsei" is all entered, the number of key inputs is 4
In the above embodiment, the input of the "O" key and the input of the "Kana call" instruction key are halved in comparison with five times or five times of the Roman character input ("onsei").

In the above embodiment, prior to the kana call, the kana character string input from the input unit 1 is one character of “O”. Since it is configured to compare the kana character string in the limited kana character string buffer 10 with the prefix match,
If an undesired kana character is expected to be called, two or more characters may be input.

(G) Advantages of the Invention As is apparent from the above description, the document processing apparatus according to the present invention can reduce the number of kana calling operations, so that an already-input kana character string can be operated without re-inputting the same kana character string. Kana can be called easily. Therefore, it is possible to contribute to a reduction in the number of key input operations particularly when the same kanji string is input a plurality of times, thereby improving operability.

[Brief description of the drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention, and FIG. 2 is a conceptual diagram for explaining a kana accumulation state of a kana accumulation buffer which is a main part of the present invention. 1 ... Input unit, 2 ... Control unit, 3 ... Output unit, 4 ... Kana Kan control unit, 5 ... Input buffer, 6 ... Kana Kan processing unit, 7 ... Kana accumulation registration unit, 8 ... … Kana accumulation buffer,
9: Mode discriminator, 10: Limited kana character string buffer,
11: Kana call control unit, 12: Kana storage buffer call unit.

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Takayuki Kowada 2-18-18 Keihanhondori, Moriguchi-shi, Osaka Sanyo Electric Co., Ltd. (72) Inventor Satoshi Kurokawa 2--18 Keihanhondori, Moriguchi-shi, Osaka (56) References JP-A-57-132272 (JP, A) JP-A-61-77957 (JP, A) JP-A-59-116835 (JP, A) JP-A-62-156763 (JP, A)

Claims (1)

(57) [Claims] An input means (1) for inputting a kana character string, for instructing kana-kanji conversion and for calling a kana character, an input buffer (5) for holding the input kana character or kana character string, and the input A kana-kanji conversion means (6) for converting a kana character string held in a buffer into a kanji-kana mixed sentence, and a kana storage buffer (8) for storing the kana character string in kanji-converted and delimited word units. ) And if the Kana call instruction was the first instruction,
Mode determining means (9) for storing a kana character string stored in the input buffer in a limited kana character string buffer (10); and displaying a kana character string in the input buffer and a kanji kana character string as a conversion result. Display means (3) for searching for a character string starting with a kana character string stored in the limited kana character string buffer by sequentially reading the kana character string stored in the kana storage buffer. A document processing apparatus characterized by re-storing in the input buffer in place of the searched kana character string and performing kana-kanji conversion in accordance with an instruction of an input means for instructing kana-kanji conversion.