JPH09134350A - Kana/kanji converting method of document processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce a waiting time by dividing a KANA (Japanese syllabary) input into plural phrases, forcibly interrupting scoring processing analysis when a prescribed time elapses at the time of scoring the conversion candidate of the phrase and displaying a KANA/KANJI candidate. SOLUTION: When a KANA character string is inputted from an input part 11 consisting of a keyboard, etc., a control part 14 starts a KANA/KANJI control part 16 in accordance with the input. When a KANA/KANJI converting key is operated, the KANA input is divided into the plural phrases and the conversion candidate with a high point is preferably displayed by scoring the conversion candidates of the divided phrase. Here, when the prescribed time elapses after the operation of a KANJI converting key, etc., at the time of scoring, scoring processing analysis is forcibly interrupted and the KANA/ KANJI candidate is displayed. Thus, user is not made to wait for a long time at the time of converting KANA/KANJI.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion method for a document processing device. In particular, it relates to a kana-kanji conversion method for a Japanese word processor (hereinafter abbreviated as word processor).

[0002]

2. Description of the Related Art In a word processor, a kana key input mode or
Romaji key input mode, keyboard as shown in Figure 1
From (1), when kana characters are entered, they are displayed on the display unit (3). After that, when the "Kanji conversion key" is pressed, it is converted into Kanji (character string mixed with Kanji) as shown in FIG.

Further, when the "Kanji conversion key" is pressed, the next candidate Kanji is displayed as shown in FIG. This display order is
The conversion candidates are displayed in descending order of score. That is,
As a conversion candidate, as shown in Fig. 4, the segment delimiter position (/)
There are various candidate characters. The adjunct word and the inflectional word end are attached to the word. From this combination, choose the one with the highest score.

The general rules for the scoring process are shown below. 1. The score is high because the number of clauses is small (the number of break positions is small). 2. Words that are stored in the Kana-Kanji dictionary in advance and have a high frequency of use have a high score. 3. Learning the kanji actually used, this learned word has a high score. 4. The grammatical connection is judged and the correct score is high.

5. The word stored in the co-occurrence dictionary has a high score. As a result of these scoring, candidates with high scores are preferentially displayed as conversion candidates. By the way, this scoring process is very burdensome. There is no problem if it is used to operate the "Kanji conversion key" after inputting several Kana characters that have been input.

However, if the "Kanji conversion key" is operated after inputting a large number of kana characters that constitute many clauses, the processing analysis time for scoring increases in a geometric progression, It takes a very long time. Therefore, the above rule “1. The number of clauses is small (the number of division positions is small).
Has a high score. ”, The points are scored according to the above-mentioned rules 2 to 5 only for the candidates having a small number of clauses.

In other words, the rule 1 is used to cut off.
A description of such a footpath will be given below. 6. Those with many phrases are not displayed as candidates. 7. Whether or not the grammatical connection is possible is determined, and the non-acceptance is not displayed as a candidate. 8. Those with low scores are not displayed as candidates.

However, in order to improve the performance of Kana-Kanji conversion, if the number of words in the Kana-Kanji dictionary is increased, the number of related words in the co-occurrence dictionary is increased, or the grammar check function is enhanced,
After all, it takes a long time to process and a waiting time occurs when converting Kana to Kanji. It should be noted that such a kanji-kana conversion technique is well known to those skilled in the art, as introduced in Japanese Patent Laid-Open No. 7-98701 (G06F17 / 22).

[0009]

SUMMARY OF THE INVENTION It is an object of the present invention to reduce the waiting time due to the kana-kanji conversion processing.

[0010]

SUMMARY OF THE INVENTION According to the present invention, a kana input is divided into a plurality of clauses, and a conversion candidate having a high score is preferentially displayed by scoring the conversion candidates of the divided clauses. In the kana-kanji conversion method, a time-out treatment is performed for the scoring.

That is, when scoring, the scoring process analysis is forcibly interrupted when a predetermined time has elapsed, and kana / kanji candidates are displayed. That is, at the time of scoring, the scoring process analysis is forcibly interrupted when a predetermined time has elapsed after the operation of the “Kanji conversion key” or the like was performed,
It is characterized by displaying kana and kanji candidates.

[0012]

DESCRIPTION OF THE PREFERRED EMBODIMENTS A first embodiment showing the outline of the present invention will be described with reference to FIG. FIG. 5 shows the conversion operation of this word processor. That is, when the "Kanji conversion key" is operated, the Kanji conversion candidate character string is extracted from the one having a small number of clauses, as in step S1.

Then, one combination is created by the combination of the conversion candidate character strings. Then, in step S3, the score of the combination is obtained. This score is based on the rules described above. When the score of one combination is obtained, it is determined in step S4 whether or not the time is out.

If NO, the following combinations are created in steps S8 and S9. If the time is out in step S4, the combinations scored up to this point are ranked according to the score. And step S
At 6, the combination of high scores is displayed.

A second embodiment of the present invention will be described with reference to FIGS. FIG. 6 is a block diagram of the word processor of this example. (11) is an input unit including a keyboard and a mouse. The input unit (11) is a character key for inputting a kana character string by kana input or romaji input,
It is equipped with various instruction keys such as a kana-kanji conversion key for instructing kana-kanji conversion, a cursor movement key, and a phrase break change key.

(12) is a read-only memory (RO
M). The ROM (12) stores word dictionary data, inflectional / adjunct word data, a connection table, etc., which are necessary when performing kana-kanji conversion. (13) is a readable / writable memory (RAM). RAM
(13) stores a kana input buffer, a candidate table, a bunsetsu candidate table, etc. necessary for kana-kanji conversion.

(14) is a control unit. The kana character string and the instruction input from the input unit (11) are given to the control unit (14). The control unit (14) controls the data exchange of each unit of the device according to the given object, and outputs the input character string to the output unit (15) including an LCD display or the like.

(16) is a kana-kanji control unit that controls kana-kanji conversion. The operation of this word processor will be described. The description will be given using the flowcharts of FIGS. 7 and 8 and the explanatory diagrams of FIGS. 9 to 14. When the kana character string "Shinkansentokai" is sequentially input from the input unit (11), in response to the input,
The control unit (14) activates the Kanakan control unit (16),
Step 100 is executed.

In step 100, the reading code corresponding to the kana character is stored in the kana input buffer as shown in FIG. 9 while incrementing the writing position. If the input is a character in step 110, control is performed by the control unit (14).
Return, and wait for key input. When there is a Kana-Kanji conversion instruction from the Kana-Kanji conversion key of the input unit (1), the control unit (1
4) activates the Kana-han control unit (16), and performs step 1
Execute 00.

At step 100, END is performed as shown in FIG.
Store 0 representing the mark. If the input is not a character in step 110, the following steps 120 to 160
Execute In step 120, the word dictionary data as shown in FIG. 10 is matched with the contents of the kana input buffer to perform a search.

The result of the search is stored in the candidate table as shown in FIG. At this time, using the inflectional / adjunct word dictionary data as shown in FIG. 11, for example, when the candidate part-of-speech read out as a result of the search is sa strange, “sen” follows the independent word part as shown in FIG. Check if there is. If there is, it is stored in the candidate table of FIG.

The candidate table consists of the following data areas. The array element numbers are stored in the candidate unit of the candidate table in order from the beginning, such as 1, 2, and 3. The start point is data representing the head of the stored candidates by the position of the kana input buffer.

The end point represents the position next to the end of the stored candidates by the position of the kana input buffer. The adjunct word length represents the number of characters of the adjunct word from the candidate after the candidate. The independent word part-of-speech is the part-of-speech of the stored independent word part of the candidate. Part-of-speech includes nouns and sahen nouns ([-do]
There are nouns with a) and prefixes.

The adjunct word part-of-speech represents the part-of-speech of the stored adjunct word part of the candidate. There are "toka" and "sen". 0 is stored for the candidate having no attached word part. Frequency is
Indicates the usage frequency score of the stored candidate. The higher the score, the higher the frequency of use. It is composed of The order of candidates to be stored is such that the smaller the starting point, the higher the rank, and the larger the ending point, the higher the rank.

In step 130, the candidate tables of FIG. 12 are combined, the grammatical connection of the combination is checked using the connection table of FIG. 13, and candidates are created,
A phrase candidate table as shown in FIG. 14 is created. (The contents of step 130 are the steps 300 to 4 in FIG.
It will be described later using 30. In step 140, the number of candidates that can be combined as a result of step 130 is checked. If there are no candidates that can be combined, step 160 is executed.

If there are candidates that can be combined, step 150 is executed. In step 160, output candidates are created using the data in the kana input buffer. For example, in this case, it is "Shinkansenkai".
In step 150, the phrase candidate with the highest evaluation is selected from the candidates that can be combined, the Kanji code of the word corresponding to the data of each phrase is converted using the word dictionary data, and each word is attached. A part is added in hiragana to the kanji data of the above word, and these are combined to create a conversion candidate.

When the creation of conversion candidates is completed, the control unit (1
The control is returned to 4), and the result is displayed on the output unit (15). Step 130 will be described using steps 300 to 430 in FIG. In step 300, initialization is performed. 1 is stored in the phrase number N, and 1 is stored in the candidate number M (1) of the first phrase. M (N) represents the candidate number of the Nth clause. Store 0 in the number of candidates KOHO that can be combined.

In step 310, timer initialization,
And start up. 0 is given as the initial value of the timer. After that, the timer stores the time from the activation, separately from the program control. In step 320,
The elapsed time TM stores the time from the start taken out from the timer.

In step 330, the set time TMORG is set.
And the elapsed time TM are compared. As a result of comparison, set time T
When the elapsed time becomes longer than MORG, step 140 and the subsequent steps are executed. Otherwise, step 3
Execute 40. The set time TMORG may be a fixed value or may be variable. If it is variable, for example, if the number of kana characters to be converted is less than 10, 10
If it is 0 ms or more, it is 200 ms.

Step 340 is the Mth (N) th Nth clause.
Check candidates. In this check, if N is larger than 1, the end point of the M (N-1) th candidate of the N-1th clause and the start point of the M (N) th candidate of the Nth clause are not compared, and NG is determined. Then, step 350 is executed.
When N is 1, the start point of the Mth (N) th candidate of the Nth clause is 0.
If not, it is NG and step 350 is executed.

In other cases, the result is OK and step 3
Execute 70. In step 350, the clause number N is 1
If it is larger, step 360 is executed. If the clause number N is 1, step 140 and the following steps are executed. Step 36
At 0, the number obtained by subtracting 1 from the clause number N is stored. In addition, a number obtained by adding 1 to the candidate number M (N) of the Nth clause is stored. Then, step 320 is executed.

In step 370, the candidate number M (N + 1) of the (N + 1) th clause is cleared to 0. In step 380, the Mth (N + 1) th candidate of the (N + 1) th clause is checked. The contents are the same as in step 340. In the case of NG, step 390 is executed. If it is OK, step 400 is executed.

In step 390, the number obtained by adding 1 to the candidate number M (N) of the Nth clause is stored. Then, in step 320
Execute In step 400, the M-th M-th phrase
(N) The part-of-speech connection of the (N) candidate and the M (N + 1) th candidate of the (N + 1) th clause is tested. A connection table as shown in FIG. 13 is used for the verification.

The connection table uses the part-of-speech of the preceding clause in the vertical direction, the part-of-speech of an independent word when an adjunct is attached, and the part-of-speech of an independent word when no adjunct is attached. In the horizontal direction, the part-of-speech of the after clause and the part-of-speech of the independent word are used. Use this table to test the connection strength. If the combination has a connection strength of 0, the result is NG and step 430 is executed. Otherwise, step 4
Execute Step 10.

In step 410, the Mth Mth of the N + 1th clause
It is determined whether the end point of the candidate is the END position of the kana input buffer. If END, step 42
Execute 0. Otherwise, execute step 440. In step 420, the combined candidates are evaluated. The evaluation is as follows: 1: The score is high when the number of clauses is small, 2: The score is high when the usage frequency is high, 3: The grammatical connection is high when the connection data in the connection table in FIG. 13 is high. To do so. For example,
If the number of clauses is 1, 100 points, if it is 2, 50 points, etc., may be held in the table.

The sum of these values becomes the evaluation. Step 4
At 30, the combinable candidates are stored in the phrase candidate table together with the evaluation at step 420. Number of candidates KO
The value obtained by adding 1 to HO is stored. However, the number of combinations that can be stored in the phrase candidate table is limited to eight.

When the number of candidates KOHO is already 8, the set with the lowest evaluation in the candidate table is compared with the evaluation of the candidate to be stored, and only if the set to be stored is higher, that set is selected. Store in the position of a group with a low evaluation. In this case, the number of candidates KOHO remains 8. In the above embodiment, all the points are scored after the kana-kanji conversion key is pressed. However, as is well known, this may be done by simultaneously performing the kana input at the same time. The point is that it takes a long time between the user's instruction of the kana conversion display and the correct answer by the regular scoring, and the user should not be dissatisfied.

[0038]

According to the present invention, it is possible to prevent the user from waiting for a long time at the time of converting kana-kanji characters.

[Brief description of the drawings]

FIG. 1 is a diagram showing a conventional word processor.

FIG. 2 is a diagram for explaining a conventional kana-kanji conversion process of a word processor.

FIG. 3 is a diagram for explaining a conventional kana-kanji conversion process of a word processor.

FIG. 4 is a diagram for explaining segment breaks and conversion candidates.

FIG. 5 is a diagram for explaining an operational flow of the first embodiment of the present invention.

FIG. 6 is a block diagram of a second embodiment of the present invention.

FIG. 7 is a diagram for explaining the flow of the operation of the second embodiment.

FIG. 8 is a diagram for explaining the flow of the operation of the second embodiment.

FIG. 9 is a diagram for explaining the operation of the second embodiment.

FIG. 10 is a diagram for explaining the operation of the second embodiment.

FIG. 11 is a diagram for explaining the operation of the second embodiment.

FIG. 12 is a diagram for explaining the operation of the second embodiment.

FIG. 13 is a diagram for explaining the operation of the second embodiment.

FIG. 14 is a diagram for explaining the operation of the second embodiment.

[Explanation of symbols]

 (1) ・ ・ ・ ・ ・ Input section, (2) ・ ・ ・ ・ ・ Main body (Kana-Kanji conversion section), (3) ・ ・ ・ ・ ・ Display section.

Claims (2)

[Claims] 1. A kana-kanji conversion method for a document processing apparatus, which displays a high-score conversion candidate preferentially by dividing a kana input into a plurality of phrases and scoring the conversion candidates of the separated phrases. A kana-kanji conversion method characterized by forcibly interrupting the scoring process analysis and displaying kana-kanji candidates when a predetermined time has elapsed during the marking. 2. A kana-kanji conversion method for a document processing apparatus, which displays a high-score conversion candidate preferentially by dividing a kana input into a plurality of phrases and scoring the conversion candidates of the separated phrases. A kana-kanji conversion method characterized by forcibly interrupting the scoring process analysis and displaying kana-kanji candidates when a predetermined time has elapsed since the kana-kanji conversion instruction was given.