JPH0319580B2 - - Google Patents

Description

[Detailed Description of the Invention] This invention converts a kana character string input from an input device such as a kana keyboard into a kanji-kana mixed sentence by referring to a kana-kanji dictionary table built into the system and outputs the result. In the kana-kanji conversion processing device, for kana character strings that include a prefix, the operator presses the prefix key in advance, and the prefix table is compared with the beginning of the input character string. The present invention relates to a kana-kanji conversion processing device that detects a prefix part from a character string and performs a search test on the remaining part after removing the prefix part with a kana-kanji dictionary table.

FIG. 1 shows an outline of the processing flow conventionally performed in this type of kana-kanji conversion processing system. In the figure, S1 is a step that uses the entire input string as a keyword, S2 is a step that searches the Kana-Kanji dictionary for the above keyword, S3 is a step that determines whether the above search was successful, and S4 is a step that uses all keywords. Step S5 is a step of determining whether the above search is completed or not, step S5 is a step of deleting the last character from the above keyword as a new keyword, and step S8 is of performing kana-kanji conversion according to steps S2 to S5 above. It consists of
A, c, b, and d are the exits of step S8 when the kana-kanji conversion is successful or unsuccessful, respectively. In addition, S6 is a step to extract a prefix from the above input character string, S7 is a step in which the remaining part from which the above prefix is extracted is used as a new keyword, and S9 is a step in which all prefixes in the prefix table are referred to and processed. Step S10 is a step of determining whether or not the prefix has been performed, and is a step of extracting other prefixes. Note that A is the standby state after kana-kanji conversion, and B is the standby state after the kana-kanji conversion is completed.
is the state reached after kana-kanji conversion fails.

Next, the operation will be explained.

First, in step S1, the entire input kana character string is used as a keyword, and then in step S2
Search the kana-kanji dictionary table in . Then, if it is determined in step S3 that the search is successful, that is, if the kana-kanji conversion is successful, the system exits from exit a and reaches the standby state A after the successful kana-kanji conversion, and inputs the next kana character string. Wait in preparation. Conversely, if the result is failure, proceed to step S4.
Check whether the entire keyword has been searched. If not, in step S5, the last character of the searched keyword is deleted, and the remaining part is used as a new keyword, and the process returns to step S2 to search the kana-kanji dictionary table. Continue searching for keywords and kana-kanji dictionaries in the same way. As a result of such a search, if the keyword matches the contents of the Kana-Kanji dictionary, a kanji-kana mixed sentence consisting of the contents of the Kana-Kanji dictionary at that time and the remaining part after removing the keyword at that time from the input string is generated. is obtained.

By the way, when the input character string contains a prefix such as ``zen'' in the character string ``Zen Baru Kai no'', the above-mentioned kana-kanji dictionary search will fail. This is because kana-kanji dictionaries usually consist of vocabulary excluding prefixes, that is, independent words.
This is because storing all possible combinations of prefixes and independent words in a kana-kanji dictionary would require a huge amount of memory capacity, which would be uneconomical.

Now, as a result of the above processing, if it is determined in step S4 that the entire keyword has been searched, and it is determined that the kana-kanji conversion has failed, the device proceeds to step S6 from exit b.
A prefix is extracted from the input character string to check whether there is a prefix at the beginning of the input character string. Then, in step S7, the remaining portion after the prefix extraction is used as a keyword, and this keyword is again subjected to kana-kanji conversion in step S8. If the conversion is successful here as well, the system exits from exit c and finishes its processing. On the other hand, if the conversion fails, the system checks in step S9 whether another prefix in the prefix table is included in the above keyword, and if not, in step S10, converts another prefix from the above keyword. is extracted, the process returns to step S7, and the same process is repeated. Then, in step S9, when this system fails to match the contents of all prefix tables, it reaches state B.
Outputs that all kana-kanji conversions have failed.

Conventional kana-kanji conversion processing systems perform the above-mentioned processing, so for input character strings that include a prefix, first try converting them to kana-kanji as if they do not include the prefix, and then perform all searches. Since the prefix is extracted from the input character string only after a failure, and the remaining part is converted into kana-kanji, it has the disadvantage that it takes a lot of time to obtain the correct kana-kanji conversion. Furthermore, in order to avoid these drawbacks, storing prefixes and independent words in a kana-kanji dictionary would require a huge amount of memory, which would be uneconomical.

The present invention was made in order to eliminate the drawbacks of the conventional ones as described above, and when converting an input character string containing a prefix into kana-kanji, it is necessary to inform the device in advance that the prefix is included. When the operator presses the suggested prefix key and a trigger to start kana-kanji conversion processing is triggered, the string match detection circuit first uses a prefix table to determine whether or not there is a prefix in the input string. When the prefix is extracted, the remaining part is checked, and when it is not, the entire part is converted to kana-kanji. This reduces the time required for kana-kanji conversion compared to conventional methods. The purpose of the present invention is to provide a kana-kanji conversion processing device that can be shortened and the size of the kana-kanji dictionary can be small.

Hereinafter, one embodiment of the present invention will be described with reference to the drawings.

FIG. 2 shows a kana-kanji conversion processing device according to an embodiment of the present invention. In the figure, 10 is a keyboard as a character string input means, and 11 is a prefix processing priority command key (hereinafter abbreviated as prefix key), which is used by the operator when a prefix is included in the input kana character string. It is something to press. Further, 12 is an input character string buffer, 13 is a prefix extraction circuit, and 14
is the prefix table, 15 is the kana-kanji conversion unit, 16
is a control unit, which controls whether or not the prefix key 11 is pressed and the prefix extraction circuit 1 at the time of pressing the prefix key 11.
The input kana character string is input to the kana-kanji converter 15 either as is or with the prefix removed, depending on whether the prefix is extracted or not.

FIG. 3 is a flowchart showing the processing performed by the apparatus of the above embodiment, and in the figure, the same reference numerals as in FIG. 1 indicate the same parts as in FIG. 1.
S0 is a step for determining whether or not the prefix key 11 has been pressed. The prefix table 14 stores a candidate character group including at least one kana-kanji converted candidate for the pronunciation of one prefix.

Next, the operation will be explained with reference to FIGS. 2 and 3.

First, a kana character string input from the keyboard 10 is stored in the input character string buffer 12. Next, if it is determined in step S0 that the prefix key 11 is not pressed down, the system proceeds to step S0.
In S1, the entire input string is used as a keyword,
In step S8, kana-kanji conversion is immediately started. If the kana-kanji conversion fails, it is assumed that the operator made a mistake, that is, the prefix key 11 was not pressed even though a prefix existed in the input character string, and the system proceeds to steps S6 to S6.
In S10, a prefix is attempted to be extracted, and a kana-kanji conversion is attempted for the remaining part after the extraction.

On the other hand, in step S0 above, prefix key 1
When it is determined that 1 has been pressed, a prefix extraction command is sent from the control unit 16 to the prefix extraction circuit 13. Then, the prefix extraction circuit 13 resets the table address of the prefix table 14 and reads out the first prefix. Next, the prefix extraction circuit 13
is the read prefix and the input character string buffer 12 that became the keyword in step S1.
The first character of both data is compared with the character string , and if the read prefix candidate does not exist in the data in the same buffer, the next prefix is read from the prefix table 14. In this way, the prefix extraction circuit 13 sequentially searches the prefix table 14, and when a prefix is found, the prefix extraction circuit 13 sends the found prefix (character string) and a signal indicating that it has been found to the control unit. Send to 16th. Then, the control unit 16 sends the input character string buffer 12 to the kana-kanji conversion unit 15 to perform kana-kanji conversion on the remaining part after removing the found prefix character string in step S8. Furthermore, in the unlikely event that no prefix is found in the input character string, all the character strings in the input character string buffer 12 are sent to the kana-kanji converter 15.

On the other hand, if a kana-kanji conversion trigger occurs from a kanji conversion key (not shown) without pressing the prefix key 11, in other words, if the operator inputs a prefix even though the input character string contains a prefix. If the key 11 is not pressed, the control section 16 sends the contents of the input character string buffer 12 as is to the kana-kanji conversion section 15, where the kana-kanji conversion is performed on the assumption that no prefix exists. In this case, if the kana-kanji conversion fails, it is easy to have the control unit 16 perform the same process as when the prefix key 11 is pressed.

In this way, in this embodiment, when you want to convert a kana character string that includes a prefix into kana-kanji, simply press the prefix key instead of the kanji conversion key, and the kana-kanji conversion is performed. This has the effect of dramatically improving the conversion speed of kana character strings that include prefixes, without changing the number or increasing the size of the dictionary.

Further, FIG. 4 shows a flow of processing performed by a kana-kanji conversion processing device according to another embodiment of the present invention. In the figure, S11 is a step to output the extracted prefix, and S12 and S13 are steps in which the operator determines whether the extracted prefix is the desired prefix or not, and depending on the result, the prefix confirmation key or the next candidate key is selected. This is a step for confirming the prefix or changing it to another prefix when each is pressed.

In this embodiment, when the prefix next candidate key is pressed, another prefix is extracted in step S10, and when the prefix confirmation key is pressed in step S12, or when all prefix searches fail, Shift to kana-kanji conversion for the remaining part of the input string.

As described above, according to the kana-kanji conversion processing device according to the present invention, in the kana-kanji conversion of an input character string including a prefix, the prefix processing can be performed preferentially by having the operator press the prefix key. This not only speeds up the conversion of input strings containing prefixes into kana-kanji, but also allows words that also include prefixes to be included in the independent word table as a kana-kanji dictionary to speed up the conversion. There is no need for this, and the table size can be small.

[Brief explanation of the drawing]

FIG. 1 is a flowchart showing the processing procedure for kana-kanji conversion performed by a conventional kana-kanji conversion processing device, FIG. 2 is a block diagram showing a kana-kanji conversion processing device according to an embodiment of the present invention, and FIG. Figure 3 is a flowchart showing the processing procedure of the device in Figure 2;
FIG. 4 is a flowchart showing the processing procedure of a kana-kanji conversion processing device according to another embodiment of the present invention. 10...Keyboard (character string input means), 11
...Prefix key, 12...Input string buffer,
13... Prefix extraction circuit, 14... Prefix table, 15... Kana-kanji conversion section, 16... Control section.

Claims (1)

[Scope of Claims] 1. A character string input means for inputting a kana character string, a prefix key for indicating the presence of a prefix in the input kana character string, and the above-mentioned input kana character string. An input character string buffer that stores , a prefix table that stores a candidate character group including at least one kana-kanji converted candidate for one prefix reading, and an input of the prefix key. a prefix extraction circuit that extracts a prefix from the kana character string stored in the input character string buffer by referring to the prefix table; and a kana-kanji converter that performs kana-kanji conversion on the kana character string; If the prefix key is not input, the input kana character string is input as is to the kana-kanji converter, and if the prefix key is input and the prefix is extracted by the prefix extraction circuit, the input kana character string is input as is to the kana-kanji converter. A control unit that removes the prefix from a character string and inputs the input kana character string as it is to the kana-kanji conversion unit when the prefix is not extracted. Processing equipment. 2. The kana-kanji conversion processing device according to claim 1, wherein the prefix extraction circuit is capable of extracting another prefix from the kana character string in response to an external instruction.