JPH03240863A - Kana/kanji converting device - Google Patents

Abstract

PURPOSE:To improve the effect of conversion and efficiency for utilizing a buffer by displaying contents, which are registered to a user dictionary, as a list on a display means, selecting the arbitrary content out of the contents, which are displayed as the list, in the user dictionary according to the display state and deleting the selected content. CONSTITUTION:When a batch word deletion instruction is given from an input part 1, a Chinese character (KANJI) code train and a reading code train stored in a registration buffer 8 are outputted to an output part 3 while being combined and the output part 3 successively displays the applied code trains. The input part 1 extracts the displayed combined code trains as needed while referring them, and sends the combination of the extracted reading codes and KANJI codes to a word deletion part 11. The word deletion part 11 deletes the sent, combined and registered words from the registration buffer 8.

Description

DETAILED DESCRIPTION OF THE INVENTION (a) Field of Industrial Application The present invention relates to a kana-kanji conversion device that converts a sentence consisting of a kana character string into a corresponding kanji to create a sentence containing kanji and kana.

(b) Conventional technology In order to efficiently perform kana-kanji conversion of words (proper nouns, etc.) that cannot be covered by general dictionaries, conventional kana-kanji conversion devices use A user-specific dictionary, that is, a user dictionary, is created by combining kanji codes and reading codes in advance (word processor 5w manufactured by Sanyo Electric Co., Ltd.).
p-7700 operation manual).

By the way, among the words in the user dictionary, incorrectly converted words may be preferentially output during kana-kanji conversion.

For example, if [Kakuchi] is registered in combination with [Kakuchi], when converting [Gakuchi's Tenkyohoko to [Local Weather Forecast], you should first convert it to [Kakuchi's Weather Forecast]. Conversions may be output. In addition, there is a limit to the number of user dictionaries that register combinations of kanji codes and reading codes, and there is also the problem of low buffer efficiency when registering words that are used infrequently. For each combination, it was necessary to input the pronunciation, specify the combination word, and delete it.

(c) Problems to be solved by the invention By the way, words that are registered as combinations cannot normally be listed during document creation, and the words output by Kanji conversion are not output by the user dictionary. However, it is very difficult to distinguish between words output by the original device-specific dictionary.

Also, if you register several types of words with the same reading code (
There are also homonyms), and it takes a lot of effort to specify the pair of words you want to delete.

The present invention has been made to solve such problems, and after registering in the user dictionary, words that are no longer needed are easily deleted from among the currently registered words, thereby improving the conversion effect. It is an object of the present invention to provide a Kana-Kanji conversion device that uses buffers with high efficiency.

(d) Means for Solving the Problems The kana-kanji conversion device of the present invention registers a combination of an input section including character keys and various instruction keys, a display means, words including kanji, and readings of the words. A device-specific kana-kanji conversion dictionary, a user dictionary that can register combinations of words that include kanji that are not included in the kana-kanji conversion dictionary, and the pronunciations of those words, and kanji-kana mixed sentences for the readings. When a conversion is instructed, the dictionary is searched, and when multiple candidates are searched for one reading, a means for outputting them in order of priority, and a means for displaying the contents registered in the user dictionary. The present invention is characterized by comprising means for displaying a list of contents of the user dictionary, and means for selecting arbitrary contents from the displayed state of the displayed user dictionary and instructing deletion thereof.

(E) Function: As described above, the contents registered in the user dictionary are displayed in a list on the display means, and the contents of the displayed user dictionary are selected from the displayed state and an instruction is given to delete them. By doing this, it becomes possible to delete words from the user dictionary along with their reading combinations by a simple operation.

(F) Examples Below: The present invention will be explained based on drawings showing examples thereof.

FIG. 1 is a block diagram showing the configuration of a kana-kanji conversion device according to the present invention. In the figure, 1 is an input unit consisting of a keyboard, etc., through which instructions such as kana character strings, Kana-Kanji conversion, list display, deletion, etc., which will be described later, are input.

The kana character string and instructions input from the input section 1 are sent to the control section 2.
The control section 2 controls the data exchange between each section of the apparatus according to the given instructions, and also outputs the input character string to the output section 3, which is a CRT display or the like.

The conversion candidate creation unit 4 uses a device-specific, i.e., non-rewritable, kana-kanji conversion dictionary 5 that stores words corresponding to kana characters, and divides the input kana character string into clauses and converts them into clauses. Kanji candidates corresponding to the characters are read out and stored in the conversion candidate table 6.

The combination analysis unit 7 refers to the conversion candidate table 6 and analyzes the combination of words in the input sentence.
With reference to the registration buffer 8, it is checked whether or not the words are registered as having a combination relationship, and if so, the priority of conversion to words of that combination is increased.

The conversion candidate selection determining unit 9 combines conversion candidates by referring to the conversion candidate table 6, and outputs the conversion candidates to the output unit 3 in order of priority. The output unit 3 sequentially displays conversion candidates in order of priority according to the kanji conversion instructions given from the input unit 1.

Furthermore, in response to a candidate determination instruction, the conversion candidates are determined, and the process moves on to determining the conversion candidates for the next clause.

As a result of the above, if the word required by the operator does not exist in the conversion candidate table, the word registration unit IO will combine the reading code and kanji code of the required word to form a user-specific dictionary. send.

The word registration unit 10 checks that the sent reading code and kanji code are registerable codes, and also confirms that the combination analysis unit 7 has not already registered them in the registration buffer 8. Register it as a combination word above.

After the above-mentioned operations are repeated, if there is a - bracket word deletion instruction from the input unit 1, the kanji code string and the reading code string stored in the registration buffer 8 are combined and output to the output unit 3. displays the given code string sequentially. The input unit 1 extracts the displayed combination code string as necessary while referring to it, and sends the combination of the extracted reading code and kanji code to the word erasure unit 11.

The word deletion unit 11 deletes the sent combination registered word from the registration buffer 8.

The procedure of kanji conversion by the kana-kanji conversion device configured as above will be explained using a specific example.

It is assumed that the registration buffer 8 has not yet stored anything.

If you try to output "Today's duty is Kanji. Now, I will tell you the weather forecast for each place.", Kanji conversion is forced for each [/] and [/]. The conversion candidate creation unit 4 creates a kana-kanji conversion dictionary 5.
is used to store conversion candidates corresponding to each clause in the conversion candidate table 6.

FIG. 2 is a conceptual diagram of the conversion candidate table 6, in which scores are given as conversion priority information, and a conversion candidate with a high score in each phrase has a high conversion priority.

Next, referring to the registration buffer 8, which is a user-specific dictionary, it is checked whether or not a combination of words is registered. Since the registration buffer 8 has not yet stored anything, the priority of the conversion candidate table 6 does not change.

The conversion candidate selection determining unit 9 refers to the conversion candidate table 6,
The conversion candidates are combined and outputted to the output unit 3 starting from the conversion candidate with the highest priority. The output unit 3 sequentially displays conversion candidates in order of priority in accordance with instructions given from the input unit 1.

As a result, the message ``Today, I am in charge of various areas.'' is displayed, but in reality, the display of ``local areas'' is incorrect and ``Kanejiko is correct.''

In other words, since the reading [kakuchi] for [kinji] is not found in the general dictionary 5, if you want to convert the reading [kakuchi] to [kinji], the period code and single kanji for each kanji are stored in the registration buffer 8. Through the conversion, the kanji conversion of [Kanaji] is obtained, and the kanji code and the reading code of [Kakuchi] are sent to the word registration unit 10.
send to

The word registration section 10 checks whether the kanji code and reading code are registerable codes, sends them to the combination analysis section 7, confirms that they have not already been registered, and stores them in the registration buffer 8. FIG. 3 is a conceptual diagram of the registration buffer 8 after registration, in which registered words [Kanachi] and readings [Gakuchi] are registered in combination.

By this operation, [Today's task is Kakuchi]. ] Even if you enter [Today's person is Kinji]
It can be converted to .

Next, [Then, let's beat the enemy.] Enter ko. The same operation as the previous time is repeated, and candidates are arranged in the conversion candidate table 6 for each clause.

FIG. 4 is a conceptual diagram of the conversion candidate table 6, and as described above, the higher the score in each phrase, the higher the priority.

Here, the previous conversion candidate for [Kakuchi] had the highest priority of [Local areas], but due to the combination registration of [Golden area], the order has changed to [Inland/Local areas/...]. Therefore, the conversion result is [Now, I will tell you the weather forecast for Kanagawa. ] and the incorrect conversion candidate is output as the top priority. In order to avoid such conversion, it is necessary to delete the registered words from the registration buffer 8.

To delete such registered words, the input unit 1 instructs to delete the words all at once, and the word deletion unit 11 sends all the reading codes and kanji codes of the combined words in the registration buffer 8 to the output unit 3.

FIG. 5 shows an example of the display on the output section 3 of the batch word deletion process.

The output unit 3 displays the given code strings in sequence, and the word deletion unit 11 deletes unnecessary items from the list displayed by the operator using the selection key from the input unit 1. The combinations of kanji and their pronunciations are sequentially deleted from the registration buffer 8 forming the user dictionary.

(G) Effects of the Invention The Kana-Kanji conversion device of the present invention displays a list of combinations currently registered in the user dictionary, and selects words that are no longer needed in that state. Since words can be deleted along with their pronunciation combinations, conversion efficiency can be improved, and the registration of useless combinations can be eliminated to increase buffer usage efficiency.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of the kana-kanji conversion device of the present invention, FIGS. 2 and 4 are conceptual diagrams of the conversion candidate table,
FIG. 3 is a conceptual diagram of the registration buffer, and FIG. 5 is a schematic diagram showing an example of a word list screen display. 1... Input section, 2... Control section, 3... Output section, 4
...Conversion candidate creation section, 5...Kana-Kanji conversion dictionary,
6... Conversion candidate table, 7... Combination analysis section, 8... Registration buffer, 9... Conversion candidate selection deciding section, 10... Word registration section, 11... Word deletion section.

Claims (1)

[Claims] (1) An input section including character keys and various instruction keys, a display means, a device-specific kana-kanji conversion dictionary in which combinations of words including kanji and readings of the words are registered, and the kana-kanji conversion dictionary. A user dictionary that allows you to register combinations of words that include kanji that are not recorded and the pronunciation of that word, and when a pronunciation is instructed to be converted to a sentence containing kanji and kana, the dictionary is searched and a single pronunciation is created. When multiple candidates are searched for, there is a means for outputting them in descending order of priority, a means for displaying a list of the contents registered in the user dictionary on a display means, and a means for displaying the contents of the displayed user dictionary in the list. A kana-kanji conversion device comprising: means for selecting and instructing deletion of an arbitrary item from the displayed state;