JP2575650B2 - Kana-Kanji conversion device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion device capable of efficiently converting a compound word into kanji.

(Conventional technology) Conventionally, when converting an input kana character string into a compound word, kana-kanji conversion is performed by referring to part-of-speech information stored in a dictionary memory accompanying each word so that the kana-kanji conversion can be performed. . This part-of-speech information includes information that parts of speech, such as nouns and adjectives, can be connected. Based on this part-of-speech information, it is determined whether words corresponding to the input kana character string can be connected to each other. Is converted into a compound word based on the result of the determination.

(Problems to be Solved by the Invention) However, in the case of conventional part-of-speech information, the range of words that are elements of a compound word is too wide, and the number of conversion candidates for homonymic notation other than the notation desired by the operator increases. Choosing the correct word was rather cumbersome.

(Purpose) The present invention has been made to solve the above problems, and has as its object to reduce the labor of Kana-Kanji conversion work by making it possible to use a compound word with a more accurate connection as a conversion candidate. Another object of the present invention is to provide a kana-kanji conversion device which can perform a conversion and can also simplify a search for conversion.

(Means for Solving the Problems) In order to achieve the above object, in the present invention, the kanji notation of one or a plurality of words for reading is determined whether or not the word by the kanji notation can be an element of a compound word. And the part-of-speech information indicating whether or not the word in kanji notation can be connected to one or more other words, and the compound-word information and part-of-speech information are stored together with the kanji notation. Dictionary storage means, input means for inputting kana character data, search means for retrieving kanji notation for the reading of the kana character data from the dictionary storage means, and dictionary storage means for storing words for the reading searched by the search means. A first discriminating means for discriminating whether or not it can be an element of a compound word in relation to the immediately preceding character based on the compound word propriety information stored in Second determining means for determining whether or not it is possible to connect to the immediately preceding character based on the part of speech information stored in the dictionary storage means in response to the determination result that it cannot be an element of the compound word, Receiving a result of determination that the word can be an element of a compound word by the means, or a result of determination that the word can be connected by the second determination means, and converting the word into a candidate character string; Display means for displaying the candidate character string, and a search target changing means for reducing the number of characters of kana character data to be searched by the search means in response to a result of the determination by the second determination means that connection is impossible.

(Operation) When the kana character data is input by the input means, the search means searches the dictionary storage means for a kanji notation corresponding to the reading of the kana character data.

The first determination means determines whether or not the word corresponding to the reading searched by the search means can be an element of a compound word in relation to the immediately preceding character based on the compound word propriety information stored in the dictionary storage means. As a result of the determination, if it is determined that the word can be an element of a compound word, the conversion unit immediately sets the kanji representation of the word as a candidate character string, and the display unit displays the candidate character string.

On the other hand, if the first determining means determines that the word searched by the searching means cannot be an element of the compound word,
The determination means determines whether or not the word can be connected to the immediately preceding character based on the part of speech information stored in the dictionary storage means. As a result of the determination, if it is determined that the character can be connected to the immediately preceding character, the conversion unit sets the kanji representation of the word as a candidate character string, and the display unit displays the candidate character string.

If the first discriminating means determines that the character cannot be an element of a compound word and the second discriminating means determines that the character cannot be connected to the immediately preceding character, the search target changing means changes the kana character to be searched by the search means. Change the search target by reducing the number of characters in the data.

Here, when it is determined based on the compound word propriety information whether or not it can be a compound word element in relation to the immediately preceding character, the range of the compound word element is narrowed, and Since the conversion candidate of the notation desired by the user is likely to be derived at once, there is an advantage that the desired notation can be obtained immediately, but in the compound word availability information, the range of the words that are the elements of the compound word as described above is limited. There is a drawback that there is a possibility that a desired notation may not be obtained because of being narrowed down considerably. On the other hand, when it is determined whether or not the connection with the immediately preceding character is possible based on only the part of speech information, there is an advantage that a notation that can be connected is obtained reliably, but the target range is too wide. There is a disadvantage that the number of conversion candidates increases and it is cumbersome and time-consuming to select a desired notation. As described above, the present invention firstly
The discriminating means determines whether or not it can be an element of the compound word based on the compound word propriety information, and the second discriminating means determines whether or not the connection based on the part of speech information is possible only when the result of the discrimination indicates that the element cannot be a compound word The use of part-of-speech information is advantageous because the use of compound word propriety information has the advantage of speeding up retrieval and reducing the burden on the operator because it is highly likely that a desired notation can be obtained at one time. In addition to the advantage that the desired notation can be reliably obtained, the disadvantages of both can be compensated, and the kanji conversion can be performed quickly and surely, thereby reducing the labor of the kana-kanji conversion work.

(Embodiment) An embodiment in which the present invention is embodied in a kana-kanji conversion apparatus of a Japanese word processor will be described below with reference to FIGS.

In FIG. 2, the main body case 2 of the word processor 1 is shown.
Is provided with a keyboard 3 as input means on the front side, and a printer 4 on the rear side. The keyboard 3 is provided with a liquid crystal display 5 having a plurality of rows as display means having 40 columns as one row. Various operation keys are arranged on the keyboard 3, and character keys 6, conversion keys 7, execution keys 8, function keys 9, next candidate keys 10, and a liquid crystal display for inputting each character and numeral of the hiragana and the alphabet. Various keys such as a cursor movement key 11 for moving a cursor displayed on the container 5 are provided.

The conversion key 7 is operated when converting kana-kanji characters, and outputs an execution command signal to a CPU 12 described later. The execution key 8 is used to convert a candidate character string selected by kana-kanji conversion into a confirmed character string. The next candidate key 10 is used when a candidate character string is displayed on the liquid crystal display 5 to select and display another candidate character string other than the displayed candidate character string.

Next, an electric configuration of the word processor 1 will be described with reference to an electric block circuit diagram shown in FIG.

Search means, first determining means,
A central processing unit (hereinafter, referred to as CPU) 12 as a second determination unit, a conversion unit, and a search target changing unit 12 has a read-only memory (hereinafter, referred to as a ROM) 13, a dictionary memory 14 as a dictionary storage unit, and reading and rewriting. Possible memory (RAM)
A working memory 15 is connected. The work memory 15 includes an input buffer unit 16 for temporarily storing character code data input by the character keys 6, a candidate character buffer unit 17 for temporarily storing candidate character strings, and the like. CPU1
2 is connected to the keyboard 3 via a keyboard driver 18 and to the liquid crystal display 5 via a display controller 19. Further, the CPU 12 is provided with a print driver 20.
The printer 4 is connected to the printer 4 via a computer, and is connected to various memories such as a code table 21.

The ROM 13 has a character generator in addition to a program memory 23 in which various control programs such as a Japanese word processor control program, a keyboard control program, a printing device control program, and a liquid crystal display control program for operating the word processor 1 are stored.
Has 24. The character generator 24 stores character pattern data such as characters and symbols displayed or printed in a dot matrix for each typeface. The code table 21 stores character codes corresponding to characters and symbols.

The dictionary memory 14 stores a plurality of records R. In one record R, the read information a is stored at the beginning, and after the read information a, the one corresponding to the read is stored.
One or more candidate kanji representations b of the word are stored. In addition, before each kanji notation b, compound word availability information c and part of speech information d corresponding to the kanji notation b are stored. The compound word availability information c is information indicating whether or not a word in the corresponding kanji notation b can be an element of a compound word,
The part-of-speech information d is information to which a grammatical connection characteristic is given and which determines whether or not connection with one or a plurality of other words corresponding to the word in the kanji notation b is possible. The working memory 15 temporarily stores the result of the arithmetic processing by the CPU 12.

Next, the operation of the word processor 1 configured as described above will be described with reference to the flowchart shown in FIG.

When the operator performs an input operation on the character keys 6 on the keyboard 3 in order to input a document, the CPU 12 determines what the operated key is based on the keyboard control program, and outputs an input signal for the operation key to Hiragana or Katakana. And the like, and is sequentially stored in the input buffer section 16 of the working memory 15 after being converted into character data, space data, line feed data, and the like.

At this time, the CPU 12 reads out a plurality of character data which are most recently inputted from among the character data and the like sequentially stored in the working memory 15 based on the liquid crystal display control program and sequentially displays them on the liquid crystal display 5. To go. In addition, the kana character string before the kana-kanji conversion at the time of this display (hereinafter, referred to as an undetermined character string) is highlighted.

To convert the highlighted undetermined character string to Kana-Kanji conversion, the user operates the conversion key 7 with the cursor positioned at the highlighted undetermined character string. Then, the conversion key 7
In response to the execution command signal from the CPU 12, the CPU 12 sets a pointer to the head of the undetermined character string displayed in reverse on the basis of the cursor address (Step 1, hereinafter, the steps are represented by S).

Then, the CPU 12 uses the character code data of a predetermined number N (that is, “reading”) stored in the working memory 15 counted from the pointer as a character string to be converted, and searches for a word corresponding to the character string in the dictionary memory 14. (S2).

Then, in S3, the CPU 12 determines whether or not there is a corresponding word in the dictionary memory 14 based on the reading information a of each record R. If the CPU 12 does not find a word corresponding to the character string to be converted from the dictionary memory 14 in S3, the process proceeds to S4, where the character string is counted from the pointer and reduced by a predetermined number N from the predetermined number N, and the process returns to S2. That is, CPU12
Every time a word having the same reading as that of the conversion target character string having the predetermined number of characters cannot be found from the dictionary memory 14, a search is performed in S4 by sequentially reducing the number of predetermined characters N by one from the predetermined number of characters. Further, when a word corresponding to the character string to be converted is found in S3, the CPU 12 proceeds to S5, and the found word is compared with the word immediately before the word based on the compound word availability information c given to the word. It is determined whether or not it can be a compound word in the relation of.

When the CPU 12 determines that the word can be an element of a compound word, the kanji notation b of the found word is set as a candidate character string and stored in the candidate character buffer unit 17 of the working memory 15. Then, in S6, the CPU 12 displays the candidate character string on the liquid crystal display 5 based on the liquid crystal display control program, and sets a pointer for searching the dictionary memory 14 at the beginning of the character string next to the currently searched reading. It is reset, and it is determined whether or not the kanji notation b searched in S5 is the last in the kana character string. And S7
If the CPU 12 determines that the character is the last character in the kana character string, the kana-kanji conversion process ends. If the CPU 12 determines that the character is not the last character in the kana character string, the process returns to S2.

Also, in S5, the CPU 12 determines that the found word cannot be an element of the compound word, and then in S8, the CPU 12 determines whether or not the found word can be connected to the last found word in the kanji b part of speech. The determination is made based on the information d. If it is determined that the connection is possible, the CPU 12 proceeds to S6. If the CPU 12 determines that the connection is not possible, the CPU 12 proceeds to S4. Note that a word determined to be a “head of a sentence” based on the part-of-speech information d is selected for the leading conversion target character string in the undetermined character strings.

Further, the CPU 12 repeats the processing of S1 to S8 to search for another candidate character string corresponding to the same undetermined character string, and along with the first searched candidate character string, a candidate character buffer in the working memory 15. The information is stored in the unit 17. And the next candidate key 10
Is operated, the CPU 12 reads the next candidate character string from the candidate character buffer unit 17 based on the input signal from the next candidate key 10 and displays it on the liquid crystal display 5 instead of the previous candidate character string. I do.

Then, after the candidate character string is displayed on the liquid crystal display 5 as described above, when the operator operates the execution key 8 in a state where the cursor is positioned at the candidate character string, based on the decision signal of the execution key 8, Then, the CPU 12 determines the candidate character string stored in the candidate character buffer unit 17 of the working memory 15 as a fixed character string. That is, of the undetermined character strings stored in the input buffer unit 16, the kana character string corresponding to the determined character string is rewritten into the determined character string and is excluded from the conversion target.

Note that the present invention is not limited to the above-described embodiment, and can be arbitrarily changed without departing from the spirit of the present invention.

(Effects of the Invention) As described in detail above, in the present invention, compound word availability information and part of speech information are provided for each kanji notation stored in the dictionary storage means, and these are collectively stored. Therefore, the structure is simple, and it is determined whether or not the preceding character can be an element of the compound and the preceding character based on the compound word availability information, and whether or not the preceding character can be connected based on the part of speech information. On the occasion,
It is not necessary to take out information related to one word from a huge amount of information many times, and it is possible to reduce the time for kana-kanji conversion.

If the word for the reading can be an element of a compound word in relation to the immediately preceding character, the word is immediately used as a candidate character string, so that the candidate character string can be quickly selected and the desired notation is obtained. Is likely to be obtained at once. Furthermore, in the case where a compound word cannot be an element, a character that can be connected from the part-of-speech information is used as a candidate character string, so that a character that is not an element of a compound word can be used as a candidate character string. The compound word availability information performs a complementary function when a candidate character string cannot be selected, thereby improving the certainty of kana-kanji conversion. Therefore, a candidate character string is immediately selected prior to the determination regarding the compound word availability information, and the incomplete portion in the determination regarding the compound word availability information is supplemented by the determination regarding the part of speech information performed thereafter. By doing so, the kanji conversion can be performed quickly and reliably, and the labor of the kana-kanji conversion work can be reduced.

[Brief description of the drawings]

FIG. 1 is an electric block circuit diagram of one embodiment of the present invention, FIG. 2 is a plan view of a Japanese word processor, FIG. 3 is an explanatory diagram of records in a dictionary memory, and FIG. 4 is a flowchart. 1 is a word processor as a kana-kanji conversion device, 3 is a keyboard as an input means, 5 is a liquid crystal display as a display means, 12 is a search means, a first determination means, a second determination means, a conversion means, and a search target changing means. CPU 14 is a dictionary memory as dictionary storage means.

 ────────────────────────────────────────────────── ─── Continuation of front page (72) Inventor Yoshihiro Kokubu 15 Shimomiyabi-cho, Shinjuku-ku, Tokyo 827 Iidabashi High-Town 827 Language Engineering Laboratory Co., Ltd. (56) References JP-A-56-38665 (JP, A)

Claims (1)

(57) [Claims] 1. A kanji notation of one or more words for reading, compound word availability information indicating whether or not the word in the kanji notation can be an element of a compound word, and one or more words in the kanji notation. A dictionary storage unit for providing part-of-speech information indicating whether or not it can be connected to a plurality of other words, and storing these compound word availability information and part-of-speech information together with kanji notation; an input unit for inputting kana character data; A retrieval unit for retrieving a kanji notation for the reading of the kana character data from the dictionary storage unit; and a relation between the word for the reading retrieved by the retrieval unit and the immediately preceding character based on the compound word availability information stored in the dictionary storage unit. A first determining means for determining whether or not it can be an element of a compound word; A second step of determining whether or not connection with the immediately preceding character is possible based on the part of speech information stored in the storage means;
A determination unit, and a conversion unit that receives the determination result that the first determination unit determines that the word can be an element of a compound word or the determination result that the second determination unit determines that connection is possible, and sets the word as a candidate character string Display means for displaying a candidate character string selected by the conversion means; and a search for reducing the number of characters of kana character data to be searched by the search means in response to a result of the determination by the second determination means that connection is impossible. A kana-kanji conversion device comprising: target changing means.