JPH0612537B2 - Kana-Kanji converter - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a kana-kanji conversion device for converting a Japanese sentence input by kana into a kana-kanji mixed sentence.

2. Description of the Related Art Some Kana-to-Kanji conversion devices of recent years include a process that considers the meaning in addition to the grammar process in order to obtain a higher conversion rate. One of them is a kana-kanji conversion device using inter-word information described below. This is because if multiple candidates are obtained as a result of kana-kanji conversion after grammatical processing, whether or not there is a strong semantic relationship in a sentence between a certain word and a certain word, such as dependency relation and concatenation relation, is memorized. The word-to-word relation information is prepared in advance, and by referring to it, the candidate having the strongest semantic relation between the words in the sentence is prioritized.

For example, if Kana-Kanji conversion is performed within the grammatically possible range for a kana string "Kare ha Iku", and two candidates are obtained, "He goes," and "Go dead leaves." By referring to the inter-word relationship information as shown in FIG. 6, there is a strong semantic relationship between the word “he” and the word “go”, but between the word “dead leaf” and the word “go”. It turns out that there is almost no relationship in terms of meaning, and the candidate "He goes" is given priority and output.

Similarly, for "Kokusai Kaigi," there are candidates such as "International Conference", "Government Debt Conference", "International Skepticism", and so on. Among these, "International Conference" is given priority and output. There are candidates for "You are laughing", such as "You laugh", "Yellow laugh", and so on. Among these, "Kimi laugh" is given priority and output.

As described above, the kana-kanji conversion device using the inter-word relation information has an advantage that a more meaningful conversion result can be obtained semantically.

Problems to be Solved by the Invention However, in the above-described conventional configuration, when the kana-kanji conversion device is used for personal purposes, the fields to be used are different depending on the individual. There is a possibility that a combination of words that have no relation to each other may be used in many cases.In this case, the user has difficulty in obtaining the desired combination of words, it takes time to select candidates, and quick document creation is not possible. Was there.

Means for Solving Problems According to the present invention, an inter-word relationship storage unit that stores data corresponding to the presence / absence of a semantic relationship between at least two words that have mutually different meanings, and one of the candidates is selected by the selection unit. It is provided with an inter-word relation registration unit that updates the contents of the inter-word relation storage unit by regarding that there is a semantic relation between the words included in the candidates selected when selected.

Operation With the above configuration, when a combination of words that is not normally used is selected, it is considered that the combination of words has a semantic relationship, and the combination is output as one candidate from the next conversion.

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

FIG. 1 is a functional block diagram of a word processor using a kana-kanji conversion device according to an embodiment of the present invention. Reference numeral 1 is a column input means 1a for inputting a kana sequence and kana-kanji conversion for the input character string. The input means including the selection means 1b for selecting one of the selected plurality of candidates, 2
An input kana string storage means for storing the kana string input by the kana string input means 1a, 3 is a word storage unit for storing only one word for one word, notation in kanji and part of speech of the word Reference numeral 4 denotes a kana-kanji conversion means for converting the kana sequence stored in the input kana sequence storage means 2 into a grammatically possible kana-kanji mixed sentence with reference to the word storage part 3, and the kana-kanji conversion means 4 is grammatical. Output all possible candidates for. 5 is a character string storage unit that stores the kana-kanji mixed sentence output by the kana-kanji conversion unit 4, 6 is a display unit that displays the Kana-Kanji mixed sentence stored in the output character storage unit 5, and 7 is two words having different meanings An inter-word relationship storage unit that stores whether or not there is a strong semantic relationship between them, and 8 refers to an inter-word relationship storage unit 7 to check all candidate kana-kanji mixed sentences stored in the output character string storage unit 5. Then, the inter-word relationship checking unit 9 prioritizes each candidate, and 9 is one of the candidates stored in the output character array storage unit 5.
When one is selected by the selecting means 1b, it is considered that there is a semantically strong relationship between the plurality of words included in this candidate, and new data is registered in the interword relationship storage unit 7. It is a control means for controlling kana-kanji conversion, display of candidates obtained by kana-kanji conversion, inspection of the semantic relationship between word parts, and registration.

FIG. 2 is an operation block diagram of the word processor of the present embodiment, and 11 is a large number of keys (omitted in the figure).
, A cathode ray tube display (hereinafter abbreviated as CRT display), a central processing unit (hereinafter abbreviated as CPU) 13, and a read-only memory (hereinafter abbreviated as ROM). ) 1
Reference numeral 5 is a random access memory (hereinafter abbreviated as RAM). The input means 1 in FIG. 1 is realized by the keyboard 11, the display means 6 is realized by the CRT display 12, the word storage section ROM 14 is realized, and the input kana string storage means 2 and the interword relation storage section 7 are realized by the RAM 15. There is. Further, the kana-kanji conversion unit 4, the interword relation checking unit 8, the interword relation registration unit 9, and the control unit 10 are realized by the CPU 13 executing a program stored in the ROM 14 while exchanging data with the RAM 15. ing.

The operation of the word processor of the present embodiment configured as described above will be described below.

First, when a kana row is input from the kana row input means 1a, the kana row is stored in the input kana row storage means 2. Further, when a key (not shown in the figure) for executing kana-kanji conversion provided in the input means 1 is operated, the control unit 10 instructs the kana-kanji conversion means 4 to perform kana-kanji conversion, and kana-kanji conversion. The means 4 is the input kana string storage means 2
The input kana string is read, the kanji conversion is performed with reference to the word storage unit 3, and all the grammatically possible candidates are output to the control means 10. The control unit 10 stores these candidates in the output character string storage unit 5, and the inter-word relationship inspection unit 8 refers to the inter-word relationship storage unit 7 to semantically describe the words included in each candidate containing kanji characters. Determine if there is a strong relationship and prioritize each candidate. The contents of the output character string storage unit 5 are displayed in the order of priority, and the user selects a candidate from the displayed candidates by using the selection unit 1b, whereby the notation of the selected candidate is confirmed.

Next, a case in which a plurality of words included in one candidate are considered to have a strong semantic relationship and new data is registered in the inter-word relationship storage unit 7 will be described with reference to the flowchart of FIG.

Now, the kana string "Akigakuru" is entered from the input means 1,
“Autumn is coming”, “I'm getting bored”, and “Vacancy is coming” are displayed on the above-mentioned kana-kanji conversion result display means 6, and in step (A), “I'm getting bored” of the three candidates from the selecting means 1b. When "" is selected, this information is output to the control means 10, and the control means 10 instructs the interword relation registration unit 9 to register the interword relation for the selected candidate "I get bored".

In step (B), the inter-word relationship registration unit 9 extracts the word pair “satiated” and “come” from the candidates “saturation comes”. Here, the word pairs extracted by the inter-word relationship registration unit 9 are independent word pairs such as ones that are in a relationship of being structurally dependent on each other and those that are connected to each other to form a compound word.

Next, in step (C), the inter-word relationship registration unit 9 refers to the inter-word relationship storage unit 7, and as shown in FIG.
It is determined that there is no interword relation between the word and "come".

Next, in step (D), the inter-word relationship registration unit 9 registers data indicating that there is a strong semantic relationship between the word "sick" and the word "come" as shown in FIG.

Next, it is determined whether or not there is a word pair to be registered in addition to the word pair of the word "sick" and the word "come" among the candidates "satiated" selected in step (E). Here, since there is no word pair other than the word pair of the word “being tired” and the word “being” in the candidate “being tired”, the operation is ended.

Here, if step (C) has already been stored in the inter-word relationship storage unit 7 as having a strong semantic relationship between the word pair "sentence" and the word "come", the inter-word relationship registration unit 9 In step (E), it is determined whether or not there is a word pair to be registered in addition to the words "satiated" and "come".

As described above, in the word processor of this embodiment,
Generally, when a user selects a word pair that has no strong semantic relationship, the user newly registers that the selected word pair has a strong semantic relationship. When selecting, the word pair is preferentially output, so that the word pair can be selected quickly and document creation can be performed efficiently.

EFFECTS OF THE INVENTION The present invention is selected when one of the candidates is selected by the selection means and a word relation storage unit that stores data corresponding to the presence or absence of a semantic relation between at least two words having different meanings. It is provided with an inter-word relationship registration unit that updates the contents of the inter-word relationship storage unit that considers that there is a semantic relationship between the words included in the candidate, and when a combination of words that is not normally used is selected, If the user tries to select the same word pair at the next opportunity, that word pair has priority because the combination of words is considered to have a semantic relationship and that combination is output as one candidate rather than the next conversion. Since this is output as a word, the word love can be selected quickly, and the document can be efficiently created.

[Brief description of drawings]

FIG. 1 is a functional block diagram of a word processor used in a kana-kanji conversion device according to an embodiment of the present invention, FIG. 2 is a block diagram of the device, FIG. 3 is a flowchart for registering the relationship between words, FIG. FIG. 5 is a diagram showing a state of the interword relation storage unit, and FIG. 6 is a diagram showing interword relation information stored in a conventional kana-kanji conversion device. 1 ... input means, 1a ... kana string input means, 1b ... selection means, 2 ... input kana string storage means, 3 ... word storage section, 4 ... kana-kanji conversion means, 5 ... output character string storage Part, 6 ... Display means, 7 ... Interword relationship storage section, 8 ... Interword relationship inspection section, 9 ... Interword relationship registration section, 10 ... Control means, 11 ... Keyboard, 12 ... CRT Display, 13 ... CPU, 14 ... ROM, 15 ... RAM.

Claims (1)

[Claims] 1. A kana string inputting means for inputting a kana string and one of a plurality of kana-kanji mixed sentence candidates of the same reading.
At least one input means having a selection means for selecting one candidate, an input kana string storage means for storing a kana string input from the input means, and at least one kana character string stored in the input kana string storage means. A kana-kanji conversion control unit for converting kana-kanji into a kana-kanji mixed sentence, an output character string storage part for storing all candidates output from the kana-kanji conversion control part, and a semantic relationship between at least two words having mutually different meanings. An inter-word relationship storage unit that stores data corresponding to presence / absence, and an inter-word relationship inspection unit that inspects each candidate and prioritizes the candidates by referring to the data stored in the inter-word relationship storage unit And when one of the candidates is selected by the selecting means, it is considered that there is a semantic relationship between the words included in the selected candidate, and the contents of the inter-word relationship storage unit are updated. Kana-kanji conversion apparatus, comprising the inter-word relationship registration unit that.