JPH1074194A - Japanese syllabary/chinese character converting device and method therefor and storage medium for storing program for japanese syllabary/chinese character conversion - Google Patents

Abstract

PROBLEM TO BE SOLVED: To display the candidate of Japanese syllabary/Chinese character conversion in a sequence further dose to a display sequence desired by an operator. SOLUTION: This device is provided with a latest word code storing part 13 which stores the most lately established conversion candidate among the plural conversion candidates of each Japanese syllabary character string, and a priority table storing part 14 which stores the priority of the plural conversion candidates of each Japanese syllabary character string. In this case, the most lately established conversion candidate is obtained from the latest word code storing part 13 among the plural conversion candidates of the inputted Japanese syllabary character string, and outputted at the head, and the other conversion candidates are outputted while lined up in the sequence of the priority stored in the priority table storing part 14. On the other hand, when the conversion of the specific conversion candidate is established from among the plural conversion candidates, the conversion candidate whose conversion is previously established stored in the latest word code storing part 13 is replaced with the conversion candidate whose conversion is established this time, and the exchange of this replaced conversion candidate with the conversion candidate in priory higher by one rank is operated in the priority table storing part 14.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a kana-kanji conversion apparatus for displaying a plurality of kana-kanji conversion candidates for input kana in a predetermined display order in a document processing apparatus such as a Japanese word processor or an electronic notepad. The present invention relates to a kanji conversion method and a storage medium storing a kana-kanji conversion program.

[0002]

2. Description of the Related Art As a conventional kana-kanji conversion method, for example, there is a method used in a document processing apparatus described in Japanese Patent Application Laid-Open No. 7-271784.

In this method, when displaying a plurality of kana-kanji conversion candidates for an input kana, the display order is determined by the latest use priority learning in which the most recently displayed kanji whose kana-kanji conversion is determined is given the highest priority, and The determination was made based on frequency learning, which preferentially displays kanji whose kana-kanji conversion has been confirmed a large number of times during the period.

[0004]

However, in general kana-kanji conversion, even if there are several kana-kanji conversion candidates for a certain kana, it is actually determined to convert to only a part of the conversion candidates. Often repeated. For example, according to the above-described conventional technique, there are ten conversion candidates such as “composition” and “welfare” for “kosei”,
In practice, it is considered that the determination of the kana-kanji conversion is concentrated on some of these conversion candidates.

In view of such generally considered circumstances of kana-kanji conversion, even if the number of confirmed kana-kanji conversions is counted by frequency learning in the above-described conventional technique, it is often used such as "composition" and "welfare". Only the kanji characters are counted, and the number of other rarely used kanji conversion determinations may remain forever. In such a case, the input "Kousei"
If, on the other hand, the conversion to “posterity”, which is rarely used in general, is erroneously determined, the number of conversion confirmations of “posterity” is 1, and the commonly used kanji characters such as the above “composition” and “welfare” are used. Will be displayed as a conversion candidate at the position next to. Moreover, the display position is not easily changed. That is, in the above-described related art, there is a problem that the kana-kanji conversion candidates cannot be displayed in the display order that the operator truly desires.

An object of the present invention is to provide a kana-kanji conversion apparatus, a kana-kanji conversion method, and a storage medium storing a kana-kanji conversion program capable of displaying kana-kanji conversion candidates in an order closer to the display order desired by the operator. To provide.

[0007]

A first kana-kanji conversion apparatus of the present invention comprises: a latest candidate storage means for storing a conversion candidate most recently determined among a plurality of conversion candidates for each kana character string; Priority table storage means for storing priority information of a plurality of conversion candidates for kana character strings; input means for inputting kana character strings; and when the kana character string is input by the input means, the kana character string Search means for obtaining the most recently determined conversion candidate from among the plurality of conversion candidates from the latest candidate storage means and obtaining priority information of the plurality of conversion candidates for the kana character string from the priority table storage means Output means for outputting, starting from the most recently determined conversion candidate obtained by the search means, other conversion candidates in descending order of priority in accordance with the priority information obtained by the search means. There.

A second kana-kanji conversion device according to the present invention, in the first kana-kanji conversion device, further comprises a first conversion candidate whose conversion is determined among a plurality of conversion candidates output by the output means. When a first conversion candidate is input by the second input means,
At least when the first conversion candidate is not the same as the second conversion candidate for which the last conversion has been determined and stored in the latest candidate storage means, the second conversion candidate is converted to the first conversion candidate. The latest word learning means overwritten by
Referring to the priority table storage means, the second conversion candidate overwritten by the word learning means is not the highest priority, and the third conversion candidate having the third priority higher than the priority A priority learning unit that exchanges the priority of the second conversion candidate and the priority of the third conversion candidate only when the conversion candidate is not the conversion candidate stored in the latest candidate storage unit. ing.

In the first kana-kanji conversion method of the present invention, an input step of inputting a kana character string, and when a kana character string is input in the input step, the kana character string has the most The most recently determined conversion candidate is obtained from the latest candidate storage unit storing the most recently determined conversion candidate among the plurality of conversion candidates of each kana character string, and the plurality of conversion candidates of the kana character string are obtained. A search step of obtaining priority information from a priority table storage unit storing priority information of a plurality of conversion candidates of each kana character string; and And outputting other conversion candidates in descending order of priority in accordance with the priority information obtained in the search step.

The second kana-kanji conversion method of the present invention is the first kana-kanji conversion method according to the first kana-kanji conversion method, further comprising the first conversion candidate whose conversion is determined among the plurality of conversion candidates output in the output step. A second input step of inputting
When the first conversion candidate is input in the second input step, at least the first conversion candidate and the second conversion candidate for which the last conversion has been determined and stored in the latest candidate storage unit are determined. If they are not the same, the latest word learning step of overwriting the second conversion candidate with the first conversion candidate, and the second conversion overwritten by the word learning step with reference to the priority table storage means. Only when the priority of the candidate is not the highest priority and the third conversion candidate having the priority one higher than the priority is not the conversion candidate stored in the latest candidate storage means, the second And a priority learning step of replacing the priority of the third conversion candidate with the priority of the third conversion candidate.

According to the first storage medium of the present invention, an input step of inputting a kana character string and, when a kana character string is input in the input step, the most recently converted kana character string among a plurality of conversion candidates of the kana character string The determined conversion candidate is obtained from the latest candidate storage unit storing the most recently determined conversion candidate among the plurality of conversion candidates of each kana character string, and the priority of the plurality of conversion candidates of the kana character string is determined. A search step of obtaining information from priority table storage means storing priority information of a plurality of conversion candidates of each kana character string; and the most recently determined conversion candidates obtained in the search step, And outputting the conversion candidate from the highest priority according to the priority information obtained in the search step. That.

[0012] The second storage medium of the present invention is the first storage medium, further comprising: inputting a first conversion candidate whose conversion has been determined among a plurality of conversion candidates output in the output step. When the first conversion candidate is input in the input step 2 and the second input step, at least
When the first conversion candidate is not the same as the second conversion candidate for which the last conversion stored in the latest candidate storage means is the same, the second conversion candidate is overwritten by the first conversion candidate. The priority of the second conversion candidate overwritten by the word learning step is not the highest priority, and the latest word learning step and the priority table storage means are referred to. Only when the third conversion candidate having the higher priority is not the conversion candidate stored in the latest candidate storage means, the priority of the second conversion candidate and the priority of the third conversion candidate are exchanged. A computer program for causing the data processing device to execute the priority learning step is stored.

[0013]

Next, embodiments of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 1, an embodiment of a kana-kanji conversion apparatus according to the present invention includes a dictionary 1 storing words, an input device 2 such as a keyboard, a data processing device 3 operated under program control. Storage device 12 for storing information
And an output device 11 such as a display device.

As shown in FIG. 2, the dictionary 1 stores a plurality of conversion candidate words for each kana together with a word code for uniquely identifying these words.

The storage unit 12 stores the latest word code storage unit 1
3, a priority table storage unit 14, and a candidate display table storage unit 15.

As shown in FIG. 3, the latest word code storage unit 13 stores the word code of the most recently determined word among a plurality of conversion candidate words for each kana.

As shown in FIG. 4, the priority table storage unit 14 stores word codes of a plurality of conversion candidate words for each kana together with their priorities. Here, continuous numbers are selected from the integers from 0 to 9 by the number of conversion candidates, and this number is assigned to each of the plurality of conversion candidates as a priority. At this time, an initial setting is made such that a higher conversion frequency is assigned to a higher priority among a plurality of conversion candidates.

As shown in FIG. 5, the candidate display table storage unit 15 stores the conversion candidates in the order rearranged by the sorting means 6 immediately before displaying on the output device 11 such as a display. After the display is performed and the conversion is determined, the information stored in the candidate display table storage unit 15 is deleted.

The data processing device 3 includes a first input unit 4, a search unit 5, a sort unit 6, and an output unit 7.
, A second input unit 8, a latest learning unit 9, and a priority learning unit 10.

The first input means 4 acquires a Kana character string input from the input device 2 such as a keyboard.

The search means 5 searches for the latest word code stored in the latest word code storage unit 13 using the kana character string obtained by the first input means 4 as a key, and obtains the latest word code. Further, the priority information of the conversion candidates stored in the priority table storage unit 14 is searched and acquired using the kana character string as a key.

The sorting means 6 rearranges the display order of the conversion candidates based on the obtained latest word code and the priority information, and stores them in the candidate display table storage unit 15.

The output unit 7 replaces the word codes of the conversion candidates stored in the candidate display table storage unit 15 by the sorting unit 6 with kanji characters by the dictionary 1 and outputs them to the output device 11 such as a display.

The second input means 8 acquires the conversion confirmation information input from the input device 2 such as a keyboard.

The latest word learning means 9 includes a second input means 8
The word code is acquired from the conversion confirmation information acquired by the above, and the latest word code in the latest word code storage unit 13 is overwritten.

The priority learning unit 10 replaces the overwritten word with a word one priority higher than the overwritten word in the priority table storage unit 14.

Next, the operation of the embodiment of the present invention will be described with reference to FIGS.

The operation is roughly divided into two. One is a process of displaying conversion candidates from the kana input from the input device 2 such as a keyboard on the output device 11 such as a display, and the other is a process after a word is determined from the displayed conversion candidates. This is the learning process.

With reference to FIG. 6, a description will be given of a process from inputting kana from the input device 2 such as a keyboard to displaying conversion candidates on the output device 11 such as a display.

The first input means 4 acquires the kana character string given from the input device 2 such as a keyboard, and transfers it to the search means 5.

The search means 5 searches the latest word code storage unit 13 using the obtained kana character string as a key, and obtains the latest word code (step S11). Subsequently, the priority table storage unit 14 is searched using the kana character string as a key, the priority and the word code corresponding to the kana character string are obtained, and these information are transferred to the sorting unit 6 (step S12). .

Next, the sorting means 6 sorts the conversion candidates according to the obtained information. Specifically, first, the latest word code acquired from the latest word code storage unit 13 is stored in the candidate display table storage unit 15 at the position with the highest priority (step S13). Other words are stored in the candidate display table storage unit 15 in order from the word having the highest priority following the latest word code (step S1).
4).

Finally, the output means 7 searches the dictionary 1 using the kana character string as a key, and obtains the kanji corresponding to each word code (step S15). Then, the conversion candidates kanji stored in the candidate display table storage unit 15 are displayed on the output device 11 such as a display in the order in which they were stored (step S16).

This operation will be specifically described with reference to FIG.

When, for example, a kana “Tanaka” is input from the input device 2 such as a keyboard, the search means 5 first reads the latest word code “0” from the latest word table storage unit 12.
003 (many medium) "and the priority information of" Tanaka "from the priority table storage unit 14.

The sorting means 6 includes, among the acquired information,
First, the latest word “0003 (many middle)” is stored at the top of the candidate display table storage unit 15 as the highest priority conversion candidate. Subsequently, of the information obtained from the priority table storage unit 14, the remaining words excluding “Tanaka” are “0001 (Tanaka)”, “0002 (Tanaka)”, “0004 (Tanashita)”, and “0005 (Tahan)”. ”In the candidate display table storage unit 15 in this order.

Finally, the output means 7 refers to the dictionary 1 and
The Chinese characters "Tanaka", "Tanaka", "Tanaka", "Tanashita", and "Tahan" are displayed in this order.

Next, with reference to FIG. 8, a description will be given of a learning process after a word is determined from the displayed conversion candidates.

The second input means 8 obtains the kana character string and the word code of the determined word when a certain conversion candidate is selected from a plurality of conversion candidates displayed on a display or the like and the conversion is determined. Then, these are transferred to the latest word learning means 9 and the priority learning means 10. The output device 11 such as a display displays only the conversion candidate kanji, but the word code corresponding to each displayed kanji is stored in an internal memory or the like.

The latest word learning means 9 searches the latest word code storage unit 13 using the kana character string as a key and overwrites the latest word code in the corresponding latest word code storage unit 13 (step S21). Alternatively, when the word code of the word for which the conversion has been determined is already stored in the latest word code storage unit 13, the word code may be left as it is without overwriting.

The priority learning means 10 searches the priority table storage unit 14 using the kana character string as a key, obtains information on the priorities of a plurality of conversion candidates for this kana character string, and is overwritten in step S21. The information of this priority is further searched by the word code of the latest word, and it is determined whether or not the priority of the overwritten latest word is the highest priority (step S22). If the priority of this word is the highest, the priority cannot be raised any more, so nothing is done. If the priority of the word is not the highest, then the next higher It is determined whether the priority word is the latest word stored in the latest word code storage unit 13 (step S23). Here, if the word with the next higher priority is the latest word, the replacement is not performed, but if not, the priority table storage unit 1
In step 4, this word is replaced with the word of the next higher priority (step S7).

This operation will be specifically described with reference to FIG.

Referring to FIG. 9, for example, when the conversion of “Tanaka” to Kana-Kanji is determined as “Tanaka”, the latest word learning means 9 stores “000”
3 (Tanaka) "as the latest word. At this time, the latest word code storage unit 13 stores “0005 (Tahan)”, which was the latest word at that time, and if this was overwritten, the priority learning unit 10 first sets “Tahan”. After confirming that the priority of “5” is not the highest priority, and that the word “shelf under” of priority “6”, which is one level higher than priority “5”, is not the latest word. , “Tahan” has a priority of “6”, and “lower shelf” has a priority of “5”
The priority is replaced.

With the above, the operation of the embodiment of the present invention is completed.

In this embodiment, the most recently determined word is displayed with the highest priority, and the display order of the other words is determined based on the priority. Has the effect that kana-kanji conversion candidates can be displayed in a closer order.

[0047]

As described above, the present invention has an effect that kana-kanji conversion candidates can be displayed in an order closer to the display order desired by the operator.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of an embodiment of the present invention.

FIG. 2 is a diagram showing contents of a dictionary 1 according to the embodiment of the present invention.

FIG. 3 is a diagram showing contents of a latest word code storage unit 13 according to the embodiment of the present invention.

FIG. 4 is a diagram showing contents of a priority table storage unit 14 according to the embodiment of the present invention.

FIG. 5 is a diagram showing contents of a candidate display table storage unit 15 according to the embodiment of the present invention.

FIG. 6 is a flowchart showing an operation of a conversion candidate display process according to the embodiment of the present invention.

FIG. 7 is a diagram for explaining an operation of a conversion candidate display process according to the embodiment of the present invention.

FIG. 8 is a flowchart showing an operation of a learning process after the conversion is determined according to the embodiment of the present invention.

FIG. 9 is a diagram for explaining an operation of a learning process after the conversion is determined according to the embodiment of the present invention.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 dictionary 2 input device 3 data processing device 4 first input means 5 search means 6 sorting means 7 output means 8 second input means 9 latest word learning means 10 priority learning means 11 output device 12 storage device 13 latest word code Storage unit 14 Priority table storage unit 15 Candidate display table storage unit

Claims (6)

[Claims] 1. A latest candidate storage means for storing a conversion candidate most recently determined among a plurality of conversion candidates of each kana character string, and a priority storing priority information of a plurality of conversion candidates of each kana character string Degree table storage means, input means for inputting a kana character string, and when a kana character string is input by the input means, the conversion candidate most recently determined among a plurality of conversion candidates for the kana character string is Acquired from the latest candidate storage means,
A search unit that obtains the priority information of the plurality of conversion candidates of the kana character string from the priority table storage unit; and, starting with the most recently determined conversion candidate obtained by the search unit, other conversion candidates Output means for outputting the highest priority according to the priority information obtained by the search means. 2. A second input unit for inputting a first conversion candidate whose conversion has been determined among a plurality of conversion candidates output by the output unit, and a first input unit configured to input a first conversion candidate by the second input unit. When a conversion candidate is input, at least if the first conversion candidate is not the same as the second conversion candidate stored in the latest candidate storage means and the last conversion of which is determined, the second conversion candidate The latest word learning means for overwriting the candidate with the first conversion candidate; and the priority of the second conversion candidate overwritten by the word learning means with the highest priority with reference to the priority table storage means. And only when the third conversion candidate having the priority one higher than the priority is not the conversion candidate stored in the latest candidate storage means, the priority of the second conversion candidate and the third Enter the priority of conversion candidates Kana-Kanji conversion device according to claim 1, characterized in that a priority learning means for performing instead. 3. An input step of inputting a kana character string, and when a kana character string is input in the input step, the most recently determined conversion candidate among a plurality of conversion candidates of the kana character string is The kana character string is obtained from the latest candidate storage unit storing the most recently determined conversion candidate among the plurality of kana character string conversion candidates, and the priority information of the plurality of kana character string conversion candidates is stored in each kana character string. A search step of obtaining from the priority table storage means storing priority information of a plurality of conversion candidates; and, starting with the most recently determined conversion candidate obtained in the search step, other conversion candidates are searched in the search step. Outputting a kana-kanji character in accordance with the acquired priority information. 4. A second input step of inputting a first conversion candidate for which conversion has been decided among a plurality of conversion candidates output in the output step, and a first input step in the second input step. When a conversion candidate is input, at least if the first conversion candidate is not the same as the second conversion candidate stored in the latest candidate storage means and the last conversion of which is determined, the second conversion candidate A latest word learning step of overwriting the candidate with the first conversion candidate; and a priority of the second conversion candidate overwritten by the word learning step is the highest priority with reference to the priority table storage means. And only when the third conversion candidate having a priority one level higher than the priority is not the conversion candidate stored in the latest candidate storage means, the priority of the second conversion candidate and the third conversion candidate Conversion candidates Claim 3, characterized in that it comprises a priority learning step of performing replacement priority
Kana-kanji conversion method described in. 5. An input step of inputting a kana character string, and when a kana character string is input in the input step, a conversion candidate determined most recently among a plurality of conversion candidates of the kana character string is identified by The kana character string is obtained from the latest candidate storage unit storing the most recently determined conversion candidate among the plurality of kana character string conversion candidates, and the priority information of the plurality of kana character string conversion candidates is stored in each kana character string. A search step of obtaining from the priority table storage means storing priority information of a plurality of conversion candidates; and, starting with the most recently determined conversion candidate obtained in the search step, other conversion candidates are searched in the search step. A storage medium storing a computer program for causing a data processing apparatus to execute an output step of outputting data from a higher priority according to the obtained priority information. 6. A second input step of inputting a first conversion candidate for which conversion has been determined among a plurality of conversion candidates output in the output step, and a first input step in the second input step. When a conversion candidate is input, at least if the first conversion candidate is not the same as the second conversion candidate stored in the latest candidate storage means and the last conversion of which is determined, the second conversion candidate A latest word learning step of overwriting the candidate with the first conversion candidate; and a priority of the second conversion candidate overwritten by the word learning step is the highest priority with reference to the priority table storage means. And only when the third conversion candidate having a priority one level higher than the priority is not the conversion candidate stored in the latest candidate storage means, the priority of the second conversion candidate and the third conversion candidate Conversion candidates Storage medium according to claim 5, characterized by storing a computer program for executing the priority learning step of performing replacement of priority to the data processing device.