JPS60225973A - Kana-to-kanji converting device - Google Patents

Abstract

PURPOSE:To reduce an adjective word developing area and, at the same time, to shorten the time required for examining an adjective word and developing characters for the adjective word, by providing an adjective word examining and converting device. CONSTITUTION:A Kana (Japanese syllabary)-to-Kanji (Chinese character) converting device 8 cuts out an independent word from a Kana character string to be converted sent to a grammar analyzing section 10 from a character string input section 9. The remaining Kana character string after the independent word is cut out is sent to an adjective word examining section 14 where it is examined that whether or not the remaining character string is the arrangement of adjective words. When the remaining Kana character string is judged as the arrangement of adjective words, the character string of adjective words is separately outputted from the independent word stem. Moreover, an independent word developing section 11 confirms whether the independent word exists under the character string by means of a Japanese dictionary index section 12. The grammar analyzing section 10 successively fetches candidates of the independent word from the independent word developing section 11 and examines the connection between the part of speech of the independent word and that of the designated character string of adjective words. when they can be connected with each other, the character string of adjective words are connected and displayed on a candidate display section 16.

Description

DETAILED DESCRIPTION OF THE INVENTION (Technical Field) The present invention relates to a kana-kanji conversion device that converts a Japanese sentence input in kana code into nine sentences including kana-kanji and outputs the converted sentences.

(Conventional □Technology) Conventional kana-kanji conversion devices break down a kana character string into all possible elements, combine them, perform a combination test, and obtain the correct kana-kanji character string, or
While shortening the kana character string from the back, each time the adjuncts were broken down and a combination test was performed.

For this reason, there are disadvantages in that the region in which the adjunct words are expanded becomes large and processing time is required.

(Purpose) In view of these problems, the present invention provides a system for converting kana and kanji into
By providing an adjunct word test conversion device, the object is to reduce the adjunct word development area, reduce the adjunct word test time and the adjunct word character development time, and perform kana-kanji conversion processing more quickly.

(Structure of the Invention) FIG. 1 is a diagram showing a device to which the kana-kanji conversion device of the present invention is applied. Reference numeral 1 in the figure is based on data input from the input unit 2 (keyboard).

This is the central processing unit that controls the entire system.

The character string and control code written by the input section 2 are as follows:
The data is sent to the kana-kanji conversion device 8, where it is converted into kana-kanji, outputted as candidate data to the kana-kanji candidate selection section 5, and displayed on the display section 4. Here, according to the operator's instructions, the function of the Kana-Kanji candidate selection section 3 is utilized to display candidates one after another on the display section 4, select an appropriate one, and output it to the output section 5.'! In addition, the kana-kanji conversion device 8 sends the kana character string to be converted to the grammar analysis unit 10 through the kana character string input unit 9. Based on the assumption that the data sent to the grammar analysis unit 10 (corresponding to a means for assuming that the independent word stem is a certain range of kana character strings) is always in units of clauses, here, the data sent to the grammar analysis unit 10 (corresponding to a means for assuming that the independent word stem is a certain range of kana character strings) is always in units of clauses. Assuming whether it exists or not, specifying the independent word length, and cutting out the independent word 6. What is the remainder after cutting out the independent word?
Since the character string can be assumed to be an adjunct word, it is sent to the adjunct word verification section 14. Here, this adjunct word verification unit 14 has a means for testing all possibilities of the remainder of the kana character string as an enumeration of adjunct words, and a means for testing the remaining character strings as an enumeration of adjunct words. This corresponds to means for outputting the kana adjunct character string separately from the independent word stem.

In addition, the independent word expansion unit 11 uses the Japanese dictionary index unit 12 to
The Japanese language dictionary 13 is indexed to check whether an independent word exists in this character string. At the same time, the adjunct string is tested for all possible combinations.

If both of them match and there is no shortage, the grammar analysis unit 10 fetches independent word candidates one after another from the independent word expansion unit 11, and combines the part of speech with the first adjunct of the specified adjunct character string. The adjunct character strings are combined and displayed on the candidate display section 16 if the combination is possible. The operator uses the kana-kanji candidate selection section 3 to display the previous/next candidates and selects a matching kana-kanji character string.

(Embodiment) FIG. 2 is a schematic block diagram showing the hardware configuration of the present invention. The main 0PU51 performs calculations and operations.

It controls the entire system. Also, May 10
FU51 has two slave CPUs, namely slave 0P
It has U55 and slave 0PU60. and main 0
PU51, slave CPU55, slave opty6o
commands and data are exchanged between them. The slave CPU 55 has an LCD (not shown) for displaying one
It also functions as an LCD controller to control the pROMROM capsule 5 according to instructions from the main 0PU51.
6 is loaded into the RAM 53. -73, slave 0PU
60 controls a keyboard (not shown) and clock functions, as well as power supply. Next, connect the Interconnected Controller 5 (54Fi) and other peripheral devices.
Reference numeral 9 controls interrupts from external sources. Furthermore, it is a 57-line serial controller, and 58 is a timer. %ROM52d, the program for starting the program is stored in the ROM capsule 5.
When the 64CROM is stored, the contents of the stored ROM are transferred to the RAM5M by the startup program of the ROM52.
is loaded and the program starts running. RAM53
is the work area of the basic program stored in the ROM 52,
Or used as a user area.

In addition, the program that realizes the adjunct word test conversion of the present invention is as follows:
It is stored in a ROM stored in a ROM capsule 56.

Next, the operation of the present invention will be explained using a flowchart of the wcs diagram. Now, as an example, let's consider converting the sentence ``Kyo Kara Dake.'' first.

The word ``kiyo'' was determined to be an independent word.

The text is divided as shown in Figure 4(a) (<1>)
.

Next, the attached word is searched from the beginning in the character string "Karadakeda" and the longest matching word is selected (<2>).

In this case, the longest adjunct is "kara", so the string is separated as shown in Figure 4 (υ).
After 2>, the presence or absence of adjunctive words is checked (<5>), and since this is the case, a part-of-speech combination test with the word at the previous level, ``Today'', is performed (<4>, <5>). In this case, since it is possible to combine, we can check whether there are any remaining digits in the string (C<6>). In this case, there is 1 digit left, so the next level adjunct ``da'' is cut out (
<7>), and then the process is repeated in <2> and the above-mentioned process s < 2 > s <3> t <
The process progresses as '>t<s>t<6>, and since there are no remaining digits, the adjunct word verification is OK (<8>) and the process ends.

Further, the process (10) is a process in which when an adjunct word is found but its combination with a word at the previous level is not successful, the digit of the adjunct word is shortened by one and the search for the adjunct word is started again.

Also, if you search for an adjunct and there is no matching result, first test whether the adjunct is at level 1.
) % YES If S, there is an adjunct word verification error.
(<12>) and ends the process. In this case, there is no attached word that connects the cut out independent word and the remaining character string. In addition, in the process <11>, if the level of the attached word is not 1, the attached word of the previous level that has been determined is destroyed, its digit is shortened ((13)), and the search for attached words is started again.

(effect) As explained above, the present invention has the following effects.

The adjunct word development area can be reduced.

The time required for adjunct word verification can be reduced. The time needed to develop adjunct words can be reduced. Therefore, it can be said that the present invention saves storage space and development time for adjunct word processing in kana-kanji conversion.

[Brief explanation of drawings]

FIG. 1 is a functional block diagram schematically showing a kana-kanji conversion device according to the present invention. FIG. 2 is a diagram showing the hardware configuration of the present invention. FIG. 3 is a processing flowchart of the apparatus of the present invention. FIG. 4 is a diagram for explaining the verification of attached words according to the present invention. 1...CPU 8...Kana-Kanji converter 9...Kana character string input section 10...Grammar analysis section 14...For adjunct word processing Applicant Epson Corporation Suwa Seikosha Co., Ltd.

Claims (1)

[Claims] +11 Key In a device that converts Japanese kana sentences entered manually into Kanji kana 1-ji sentences, there is a means to assume that the independent word stem is a certain range of kana character strings, and to convert the remaining words of the kana character string into adjunct words. A means for testing all the possibilities as an enumeration of kana adjunct words, and a means for outputting the kana adjunct character string separately from the independent word stem if the remaining character string is verified to be an adjunct enumeration. A kana-kanji conversion device characterized by: