JPS5884363A - Kana (japanese syllabary)-chinese character converter - Google Patents

Abstract

PURPOSE:To decrease the time during which a Chinese character word is retrieved and delivered, and to reduce the load of an operator, by retrieving the corresponding Chinese character word by only inputting a part of the reading KANA of the Chinese character by the operator. CONSTITUTION:The corresponding Chinese character word can be retrieved when an operator feeds a part of the head part of the reading KANA of the Chinese character. For instance, a word retrieving code key 7 is pushed to start a control part 8, and the input KANA is fed through a KANA input device 1 and stored in an input KANA train temporary storing part 2. Then the input KANA train is compared with the word KANA train of a word storing part 3 through a word retrieving part 4. Thus the only similar word is decided and informed to a word checking part 5. The part 5 checks whether the word obtained on the basis of the input give from the part 4 is the only coincident word within the part 3. The result of this checking is informed to the part 8. The part 8 controls an output display of an output display part 6.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a kana-kanji conversion device that converts a one-syrup expression input in kana into a sentence containing kana and kanji, and aims to reduce the burden on the operator.

In recent years, the development of kana-kanji conversion devices has become active, and for example, when the word to be converted to kana-kanji is long, such as a place name or company name, or in other words, when the word can be sufficiently estimated by half-way pressed kana, A kana-kanji conversion device has been devised that searches a word dictionary in the device for a kana that has been partially pressed and outputs the corresponding kanji word.

For example, to output ``Senritsuka-cho, Chiyoda-ku, Tokyo'', you only need to press Kanakii 10 times, such as ■Touki/Choda/Senrich■. However, in conjunction with pressing the Kanaki key, the start, break, and end code keys must be pressed four times. To increase. In addition, when the operator searches for a corresponding Kanji word with the Kana-Kanji converter, the operator does not know how many keys should be pressed to begin with the reading of the corresponding Kanji word. Since the search is performed for the first time, it takes time to search and output the corresponding Kanji word.

In view of the above-mentioned drawbacks, the present invention allows the operator to search for the corresponding kanji word by simply inputting the reading kana of the kanji word starting from the beginning when the operator inputs the kanji word in kana.
Furthermore, the present invention provides a kana-kanji conversion device that can continuously search for the next kanji word without pressing a delimiter code key.

An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a pronk diagram of a kana-kanji conversion device according to an embodiment of the present invention. In the figure, reference numeral 1 denotes a kana input device, which is, for example, a kana keyboard as defined in Japanese Industrial Standard C-6233. Reference numeral 2 denotes an input kana string temporary storage section, which temporarily stores input kana J sequentially inputted from the kana input device 1 as an input kana string JL. Reference numeral 3 denotes a word storage unit which provides addresses for words M, arranges them in alphabetical order, and also stores the word kana sequence ML, part of speech, etc. of the word M at the same time. 4 is a word search unit that sequentially compares the kana in the input kana string JL and the word kana string ML from the beginning and searches for the word kana string M1L that matches the input kana string JL the longest from the beginning;
As will be described later, the number JLN of input kana strings JL compared at the search stage, the number of matching kana strings M and LN of the word kana strings M and L that are considered to be the matching word y, and the number of matching kana strings M and LN that are next to the word kana string MIL in the word storage unit 3. The word kana string M stored at the address of
The number M2LN of 2L is output. Reference numeral 5 denotes a word checking unit, which checks whether the corresponding word M1 is the only matching word MO in the word storage unit 3 based on the output of the word search unit 4, and outputs the test result to a control unit to be described later. At the same time, the matching word cho is sent to an output display section to be described later. Reference numeral 6 denotes an output display section which outputs and displays the kanji notation of the word designated by the word checking section 6. 7 is a word search code key, which includes a word search start code key ■ which outputs a signal to start kana-kanji conversion in units of words, and a word search end code key [Yes] which declares the end of a word search. Reference numeral 8 denotes a control unit, which controls the keystrokes of the kana input device 10, controls the memory update of the input kana string temporary storage unit, and controls the output display of the output display unit 6, based on information from the word check unit 6 and word search code key 7, respectively. and

In the apparatus configured as described above, the operation when performing kana-kanji conversion will be described below with reference to the flowchart shown in FIG.

(A) By pressing the word search start key ■ of the word search code key 7, the start of a word search is declared to the control section 8, and the control of the control section 8 is started.

(b) While the input kana string temporary storage unit 2 sequentially stores the input kana J input from the kana input device 1,
The word search section 4 compares the input kana string JL with the word kana string ML in the word storage section 3 kana by kana each time the input kana string JL increases by one character, and then uses a known sequential search method, binary search method, etc. The only similar word M1 existing in the word storage device 3 is determined.

When the only similar word cho is determined, &JLN of the input kana string JL at that point.

The input kana string JL is compared with the input kana string JL one by one, and the word inspection unit 6 is notified of the number of matching kana characters MILN of the word kana string MIL in the word M1.

(c)...The word inspection unit 6 compares the number JLN of input kana strings JL with the number MILN of word kana strings MIL. In other words, if the number of input kana strings JLO JLN is j and the number of word kana strings MILO MILN is m, then j)
Make a judgment that m or j=m.

)...If the word checking unit 5 determines that j=m, the word searching unit 4 stores the word kana string MI in the storage unit 3.
Input the word M2 word kana string 'M2L stored at the next address of L, and convert the input kana string JL to the word kana string M2L.
Compare with. And input kana string JL from the beginning to the number of kana.
The matching value k, which is the number of matches, is checked to see if and the word kana string M2L match.

(e)...The word checking section 6 inputs the k found by the word searching section 4, and determines whether ko〉k''! or j=.

(f)...If the judgment of the word checking section 5 is j>k, the word M1 searched by the word searching section 4 is regarded as the only matching word Mo, and the word checking section 6 stores it in the word storage section. 3, input the matching word town, and display the matching word M on the output display section 6. Output. In addition, the word checking section 6 tells the control section 8,
Instructs to control the output display section 6.

(g)...On the other hand, the word checking unit 6 determines that k =
j, the word kana string MAL and the word kana string M2L
Since is equal to the input kana sequence JL, it sends a signal to the control unit 8 to the effect that the matching word MO cannot be uniquely determined, and waits for the next input J to the kana input device 1.

(Example...On the other hand, in (c), the word checking unit 5 makes a judgment of j
> m, it means that the input kana string JL does not exist in the word kana string ML in the word storage section 3, and the word checking section 6 displays the input kana string JL in hiragana on the output display section 6. A signal indicating output display is sent to the control unit 8.

The operation has been explained above using the flowchart of FIG. 2, but in order to make the operation more specific, an example of the operation will be explained with reference to FIG. 3.

FIG. 3 is a diagram showing the storage state of the word storage unit 3, and shows an address, a word kana sequence ML, a word proof, and part of the part of speech.

Now, we will set up a case where the operator converts the word ``Senri Higashimachi Post Office'' into kanji. As a condition, “
It is assumed that "Senri Higashimachi" and "Post Office" are stored separately in the word storage unit 3.

(a) First, the operator presses the word search start key ■ of the word search code key 7. (Figure 2 C)) (b
) Next, the operator inputs "se" of "Senritsuka-cho" into the kana input device 1. “Se” is input kana string temporary storage part 2
On the other hand, the word search section 4 sets "se" (sudden) at the address 100o in the word storage section 3 as the word M1, and inputs the input kana string J&.

The word checking unit 6 is notified of "'1" of the number JLN and "1" of the number MILN of matching kana in the word kana string MIL.
(FIG. 2(b)) (c) The word checking unit 6 determines that JLN=MILN.

(Fig. 2 ()→) (d) The word search section 4 searches for "Sei" (
Enter ``Sei'' and compare it with the input kana string ``SE''. Then, check that at least the first kana matches, and k
=1. (See Figure 2) (6) The word checking unit 6 determines that JLN=i(.
Figure 2 (e)) (f) The input kana string "se" cannot be distinguished between "se" (sudden) at address 1ooO and "sei" (back) at address 1001, so the operator's next input is wait. .

(g) The operator inputs "n" of "Senri Higashimachi" into the kana input device 1. "N" is input kana string temporary storage part 2
The input kana string JL becomes "sen". On the other hand, the word search section 4 uses "sen" (line) at the address 1050 in the word storage section 3 as a word diagram, and calculates "2" of the number JLN of the input kana string JL and the number MILN of matching kana of the word kana string MIL. "2" is notified to the word checking unit 6. (Second
(Figure (b)) (It+ The word checking unit 6 determines that JL1f=M1LN.

(Fig. 2 (c)) (1) The word search section 4 is the "sen" (line) in the word storage section 3.
"Sen'i" stored at the next address 1o61 (
Textile) is input and compared with the input kana string ``sen''. Then, it is checked that at least two kana characters match, and k=2. (See Figure 2) (j) The word checking section 6 determines that it is JLN4. (Second
(Fig. (e)) (k) Since it is not possible to determine whether the input kana string "sei" is "sei" (back) at address 106o or "seni" (textile) at address 1o61, the operator waits for the next input.

(1) The operator inputs "su" of "Senri Higashi-cho" into the kana input device 1. "Su" is input kana string temporary storage part 2
The input kana string JL is "Sen January". On the other hand, the word search unit 4 stores "Senri" in "Senrigan" (1000~He-N-1 to Rigan) at the address 1060 in the word storage unit 3. Take only the part of
N^I\Rigan' is the word M1, and the number JL of input kana strings JL is
Number of matching kana MIL between "3" of N and word kana string MIL
The word checking section 5 is notified of "3" of N. (Figure 2 (b)) (+1) The word checking section 5 determines that JLN=MILN.

(Fig. 2 ()→) (n) The word search section 4 is a "senrigan" in the word storage section 3.
(Clairvoyance) is stored in the next address 1061.
Enter "Senri Nishimachi" (Senri Nishimachi) and enter the input kana string "
Compare with "Senri". Then, it is checked that at least the third kana matches, and it is set as k-3. (See FIG. 2) (O) The word checking section 6 judges that J'LN-. (
Figure 2 (e)) (p) The input kana string ``Senri'' cannot be determined between address 1060 1 senrigan'' (clairvoyance) and address 1061 ``senri nishimachi'' (senri nishimachi), so the operator's next input is wait.

(q) The operator inputs "hi" of "Senri Higashimachi" into the kana input device 1. "Hi" is input kana string temporary storage part 2
The input kana string JL becomes "Senrich". On the other hand, the word search section 4 removes "Senrihiga e11-he^-V" at the address 1o62 in the word storage section 3, inserts the word "Senrihigashimachi" into the word Ml, and calculates the number of input kana strings JL, JLNr4J, and the word The word checking unit 6 is notified of the number MILN of matching kana in the kana string MIL, which is "4". (Figure 2 (b)) <r> The word checking section 5 is JL
It is judged as N-MILN.

(Fig. 2 ()→) (S) The word checking unit 4 inputs “Senriminamimachi” (Senriminamimachi) stored in the address 1o63 next to “Senrihigashimachi” (Senrihigashimachi) in the word storage unit 3. Then, it is compared with the input kana string "Senrich". Then, it is checked that there is a match up to the third kana, and k = 3. (See Figure 2) (1) The word checking unit 5 determines that JLN)k. do. (Figure 2 (e)) (u) The word checking section 5 regards "Senrihigashimachi" (Senrihigashimachi) searched by the word search section 4 as the only matching word town, and selects "Senrihigashimachi" from the word storage section 3. The information is input and output directly to the output display section 6.

The word checking section 5 also instructs the control section 8 to control the output display section 6 . (Figure 2 (Go)) (V) The operator confirms that the desired "Senri Higashi-machi" is displayed on the output display section 6, and then sequentially writes a certain number of kana characters starting with "U" of the next 1 post office. are input into the kana input device 1, and "post office" is outputted according to the flowchart shown in FIG.

Note that, for example, when it is desired to output only "Se" (sudden), the output can be obtained as in the conventional example by using a delimiter code (not shown in FIG. 1).

As described above, the word search unit 4 calculates the number JLN of input kana strings JL.
, the word kana string M that seems to be the matching word MQ, and the number of L matching kana strings MILM are notified to the word checking unit 6, and also stored in the next address of the input kana string JL and the word kana string MIL at the request of the word checking unit 5. The operator calculates the matching value k with the word kana string town in the word storage unit 3 and notifies the word checking unit 6, and the word checking unit 6 compares the values of JLN, MILN, and k with each other. The desired Kanji word can be obtained by pressing a key halfway, and the next Kanji word can be input continuously without having to press a delimiter code key.

Note that in this embodiment, the words in the word storage unit 3 are arranged in alphabetical order and an address is provided for each, but in reality they are arranged in descending order according to the number of binary codes, so they are arranged in alphabetical order and each address is assigned an address. An address may also be provided. Further, by providing a word storage section similar to the word storage section 3 in the control section 8, the word storage section 3. Word search section 4. Signals may be exchanged between the word checking unit 5 and the control unit 8 based only on the number of codes.

As described above, when the input kana are being input sequentially, the word search unit searches the word storage unit for a word that is considered to be a matching word from the input kana, and the word storage The matching kana value between the input kana string and the word stored at the next address of the longest matching word that is considered to be the above matching word, the number of the input kana strings, and the ratio between the input kana string and the longest matching word. By providing a word check section that outputs the kanji notation of the only two words mentioned above only when the only word is determined from the number of words, all you have to do is input the kana that is part of the reading of the word from the beginning. , you can search for the corresponding kanji word, and you can also continue searching for the next kanji word without having to press the delimiter code key, which has an incredible practical effect.゛

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a kana-kanji conversion device according to an embodiment of the present invention, FIG. 2 is a flowchart showing the operation of the kana-kanji conversion device according to an embodiment of the present invention, and FIG. 3 is a storage state of the word storage section. FIG. 2... Input kana string temporary storage section, 3...
Word storage section, 4... Word search section, 5...
・Word test department.

Claims (1)

[Claims] A temporary memory unit that temporarily stores the input kana string; and a word memory that stores the words sequentially in alphabetical order or the like by associating at least the Japanese word pronunciation with the kanji representation of the word. a word search section that searches the words in the word storage section for the longest matching word that is the most frequently matched kana string from the beginning of the input kana string; and a word checking unit that determines whether or not the word is a word, and while the input kana are being sequentially input, the word search unit stores the word in the word storage unit at the next address of the longest matching word found by the word search unit. The word checking section inputs the matching kana value of the word and the above input kana string ′, the number of the above input kana strings, and the number of matching kana between the longest matching word and the above input kana string. A kana-kanji conversion device characterized in that the kanji notation of the only word is outputted only when the word is determined.