JPH03164859A - Kana/kanji converting device - Google Patents

Abstract

PURPOSE:To simplify an operation by partitioning read data according to data showing partition when the read data are composite words are reading KANJI (Chinese character) data corresponding to an independent word at every partition. CONSTITUTION:When a conversion key is inputted from an input means 1, KANA (Japanese syllabary) / KANJI conversion control part 7 determines the partition of the next clause while retrieving a word dictionary 3. For example, at first, the KANA / KANJI conversion control part 7 segments 'joki-kikan- ni' as the clause. Next, since the composite words such as 'joki-kikan-ni' are included, the composite words are divided for the unit of a constituting word and the KANA / KANJI conversion control part 7 retrieves the word dictionary 3. Then, the candidate of a description corresponding to the small clause is stored in an output storage part. Afterwards, a converted result is obtained at a display means 9 by operating a reconversion key. Thus, according to the data showing the partition of the composite word, the dictionary can be retrieved at every partition.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a kana-kanji conversion device that converts a character string input in kana to nine strings including kana and kanji.

2. Description of the Related Art In recent years, kana-kanji conversion devices have been widely used in various Japanese language processing devices, including Japanese word processors, as devices for inputting Japanese characters. The kana-kanji conversion device is used to convert an input kana string into a kana-kanji mixed string. For example, the temperature in the next kana row should be swollen.

If you enter The weather is sunny today.

You can perform the conversion with In addition, some recent kana-kanji conversion devices are capable of increasing conversion efficiency by registering frequently used compound words in an independent word dictionary. For example, suppose we input and perform conversion according to the following kana column format. In the independent word dictionary, the word ``steam engine'' is registered as ``shokikikan'', so with the development of steam engines, it can be converted to .

Problems to be Solved by the Invention However, the conventional kana-kanji conversion device described above treats even a compound word as a single independent word, so it is a step away from the conventional kana-kanji conversion device. In this case, if you enter , the lessee makes an offer to use the steam engine.

This will result in incorrect conversion results. In this way, a series of two words (hereinafter referred to as a collocation) is a compound word.
If the pronunciation is the same as the password (hereinafter referred to as a conflict of pronunciations), the user should first place the cursor on the phrase "steam engine" and use the clause reduction key etc. to change the phrase to "steam", "
``to the engine'', and then reconvert the phrases ``steam'' and ``to the engine'' to get ``to the engine''.
I had to get candidates for ``above'' and ``in the period.''

Another option is to register "the above period" in a dictionary, but the number of combinations of words that may conflict with compound words is enormous, and registering all of them would be difficult due to the increase in the size of the dictionary. This is not practical as it causes a decrease in search speed.

Means for Solving the Problem In order to solve this problem, the present invention consists of reading data of one independent word or a compound word that is a combination of multiple independent words, its Kanji data, and data indicating the division of the compound word. If the kanji data read from the dictionary is a compound word, the read kanji data is divided according to the data indicating the divisions stored in the dictionary, and the data for each division is It consists of means for reading kanji data corresponding to independent words from a dictionary.

When an action compound word is read out as a conversion result, it becomes possible to search the dictionary for each break according to the data stored in the dictionary indicating the breaks of the compound word.

Embodiment A kana-kanji conversion device according to an embodiment of the present invention will be described below.

FIG. 1 is a functional block diagram of the kana-kanji conversion device of this embodiment. Here, 1 is an input means consisting of a keyboard having a kana key for inputting kana data, a key for instructing conversion of the input kana data to kanji data, and a reconversion key. Reference numeral 2 denotes an input kana list boundary section for storing kana data inputted through the input means 1. 3 is a word dictionary that stores word reading data, kanji data, part-of-speech information, and, if the word is a compound word, clause break positions for each of the reading and kanji notation as a set of word data. It is. 7 searches the word dictionary 3 and converts the input kana string stored in the kana list boundary section 2 into 9 strings of kanji and kana, and the conversion result is a compound word containing multiple independent words. for.

This is a kana-kanji conversion control unit that separates compound words into constituent words, converts them into multiple clauses, and outputs all candidate spellings for those clauses. 8 is an output character string storage unit that stores the kanji-kana mixed string output from the kana-kanji conversion control unit 7.

Reference numeral 9 denotes display means for displaying the kanji/kana mixed strings stored in the output character string storage section 8 and the kana text stored in the input kana string entry section 2.

FIG. 2 is a circuit block diagram of the kana-kanji conversion device of this embodiment, in which 1o is a keyboard, 11 is a central processing unit (hereinafter abbreviated as CPU), 12 is a cathode ray tube,
(-hereinafter abbreviated as CRT display), 13 Hard-only memory (hereinafter abbreviated as ROM),
14 is a random access memory (hereinafter abbreviated as RAM).

The input means 1 shown in FIG. 1 is connected to the keyboard 1o, the input kana list boundary section 2, the output character string storage section 8 is connected to the RAM 14, the word dictionary 3 is connected to the ROM 1s, and the kana-kanji conversion control section 7 is controlled by the CPU 11 to the ROM 13 and RAM 14. The display means 9 is realized by a CRT display 12 by executing a program stored in the ROM 13 while transferring data.

The operation of the kana-kanji conversion apparatus of this embodiment configured as described above will be explained below based on the flowchart shown in FIG.

First, in step (a), when a kana string is input from the input means 1, its contents are stored in the input kana string storage section 2. For example, if the following kana reshokikikan nichinshakunin occurs, inputted from the input means 1 is stored in the input kana string storage section 2. Further, when the conversion key is input through the input means 1, the process proceeds to step (kiri), where the kana-kanji conversion control unit 7 searches the word dictionary 3 and determines the next phrase delimiter.

FIG. 4 is a diagram showing the contents of a word dictionary in one embodiment. The number written at the delimiter position indicates from which character, counting from the beginning, the following constituent word begins. However, 0
A word with is written is not a compound word, but indicates that there is no delimiter.

In the case of the example sentence, the kana-kanji conversion control unit 7 first extracts "shokikikanni" as a clause. Next, in step (c), it is checked whether the phrase just determined contains a compound word. In the example above, the compound word ``shoki・kikan'' is included, so proceed to step ).

In step (to), the compound word included in the clause is divided into component words, and the process proceeds to step (to). Hereinafter, normal phrases will be referred to as large phrases, and phrases divided by the compound word separation υ will be referred to as small phrases.

If it is determined in step (c) that there is no compound word, the process proceeds to step (e), and in step (e), the large clause is regarded as a small clause and the process proceeds to step (v).

In step (v), the kana-kanji conversion control unit 7 searches the word dictionary 3 and stores spelling candidates for the small clauses in the output storage unit. In the example above, the large clause ``shokikikanni'' is divided into two small clauses ``shoki'' and ``kikanni'', and the candidates are ``steam'', ``above'', ``joki'', ``regularity'', ``regulations'' and ``institutions'', ``period'', ``
"Basic" and "Feedback" are stored in the output storage section. and,
These are displayed by operating the reconversion key, -. Next, in step (g), it is checked whether the conversion of all input sentences has been completed, and if it has been completed, the process advances to step (b). If it is not finished, perform the operation from step (to). The conversion result is stored in the output character string storage section 8. Next, the process proceeds to step (a), and the conversion result is obtained on the display means 9 as shown in FIG.

Effects of the Invention As described above, the present invention also stores data indicating the division of each independent word constituting a compound word in a dictionary that also stores compound words consisting of a plurality of independent words, and the data read out as a conversion result. If is a compound word, it is divided according to the data that indicates the division, and the kanji data corresponding to the independent word for each division is read out, so I would like to reconvert the independent word that is part of the compound word. In this case, there is no need to perform an instruction operation such as reducing a clause.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram of a kana-kanji conversion device according to an embodiment of the present invention, FIG. 2 is a circuit block diagram of the device, and FIG.
The figure is a flowchart of the process, and FIG. 4 is a diagram showing the contents of the word dictionary.

Claims (1)

[Claims] An input means for inputting kana data, a storage means for storing the kana data input from the input means, reading data of one independent word or a compound word formed by combining a plurality of independent words, and the reading data thereof. A dictionary that stores a plurality of word data consisting of kanji data and data indicating divisions of compound words, and a dictionary that refers to the dictionary and reads out kanji data whose reading is the kana data stored in the storage means. retrieval means; when the kanji data read by the dictionary retrieval means is a compound word, dividing the kana data stored in the storage means according to data indicating delimitation stored in the dictionary in response to an instruction; A kana-kanji conversion device comprising: a control means for reading out kanji data corresponding to an independent word for each segment.