JPH05242073A - Retrieval method for kanji by radical - Google Patents

Abstract

PURPOSE:To enable retrieving a desired KANJI (Chinese character) by an alias of its radical even if the radical has multiple names, relating to retrieval of KANJI by its radical in a data processing system into which Japanese is input ted for processing. CONSTITUTION:A dictionary data buffer 53 in which a dictionary data where pronunciation corresponds to its KANJIs is stared and a display buffer 52 are provided to a data processing system into which Japanese is inputted far processing. In this system, a pronunciation conversion table 54 where alias pronunciation of a radical of KANJI ia made to correspond to a correct pronunciation of the radical linked with the pronunciation in the dictionary data buffer 53 is provided. When an alias pronunciation of a radical of the KANJI to be retrieved is inputted, the pronunciation of the radical is retrieved from a pronunciation conversion table 54 and, based upon the pronunciation, the dictionary data buffer 53 is retrieved to obtain the code of a desired KANJI, and then it is set in the display.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for retrieving kanji by radicals in a data processing device for inputting and processing Japanese.

Japanese processing by modern computers, for example,
With the widespread use of document processing devices (word processors), handwritten documents have been written in clear in the fields such as the newspaper industry and the printing industry by the word processor.

In this case, when a handwritten document is input to the word processor, a kanji whose reading is unknown may appear, and it is necessary to effectively search and input the kanji. One method is to use the radical of the kanji as a clue.

[0004]

2. Description of the Related Art FIGS. 2A and 2B are diagrams for explaining a conventional kanji radical search method, in which FIG. 2A shows an example of the configuration of a conventional document processing apparatus, and FIG. 2B shows an example of the structure of a dictionary data buffer. Indicates
(C) shows a concrete example of the contents of the dictionary data, and (D) shows a display example of the message line on the display screen.

A conventional kanji radical search method will be described below with reference to FIGS. 2 (A) to 2 (D). Normally, when the document processing apparatus is powered on, programs, dictionary data, etc. from the dictionary file 4 shown in FIG. 2A are stored in the memory 5 as the program 51, the dictionary data buffer 53, etc. In addition to the above, the display buffer 52 is prepared and a specific menu is displayed on the display 2. The required document processing is performed by interactively repeating the operator's selection of menus and input of characters from the keyboard.

The document to be created and updated is in the display buffer 52, and its contents are displayed on the display 2. The character input from the keyboard 3 is written in the position designated by the cursor in the display buffer 52 and displayed on the display 2.

An area called a message line is prepared as a special area in the display buffer 52, and the display position of this area is fixed at the bottom of the display 2, for example. When the operator wants to input a particular kanji during document processing but does not know how to read the kanji, if the radical name is known, after entering the radical name using the keyboard 3, for example, the same "Radical search" provided on the keyboard 3
Type the key.

As shown in FIG. 2 (B), the dictionary data buffer 53 has a form in which a kanji character corresponding to "Yomi" is listed. The "Yomi" includes the radical "Yomi".

FIG. 2C shows a concrete example of dictionary data.
The characters in [] are kanji or the radical "yomi", followed by the kanji with that yomi. After that, the next "Yomi" and the Yomi's kanji group follow.

When the radical name is entered and the "radical search" key is pressed, the dictionary data buffer 53 is searched for the kanji at the "Yomi" position of the entered radical name, and the document currently being created is searched. While keeping the display of, the message line area of the display buffer 52 displays a kanji code with a specific number of radicals from the beginning of the list corresponding to "Yomi" in the dictionary data buffer 53. set. Therefore, the content is displayed on the message line of the display 2 as shown in FIG. The example in the figure shows the case where "Kihen" is input as the radical name, and the five characters from the beginning of the Kanji group following [Kihen] are displayed.

In the above operation, when the kanji to be called does not exist in the message line, the operator presses the "next page" key, for example. As a result, in the message line area of the display buffer 52, a specific number of the next kanji in the list of kanji belonging to the radical name is set and displayed, and, for example, the display pointer is updated.

Thereafter, the same operation is repeated until the Chinese character desired by the operator is displayed. When the desired Chinese character is found, the operator taps one of the numbers (0 to 5) corresponding to the radical as shown in FIG. 2 (D).
As a result, the specified kanji code is displayed in the buffer.
Since it is set at a predetermined position in the 52 documents, the specified kanji can be displayed in the document.

[0013]

In the above-described conventional kanji radical search method, when there are two or more radical names (for example, "shinnyu" and "shinnyo", "kozato" and "kozatohen". , Etc.), there is a problem that it is not known which radical name should be entered.

It is an object of the present invention to provide a kanji radical search method capable of calling a desired kanji by using a radical alias as a clue even for radicals having a plurality of radical names. It is a thing.

[0015]

FIG. 1 is a diagram for explaining the principle of a kanji radical search method according to the present invention. FIG. 1A shows a configuration example of a document processing apparatus according to the present invention, and FIG. An example of the structure of the dictionary data buffer in which the conversion table and the Yomi conversion table are linked is shown.

The present invention is provided with a dictionary data buffer 53 for storing dictionary data in which a corresponding kanji group is associated with a kanji "yomi" or a kanji radical "yomi", and a display buffer 52. , Japanese input and processing data
In a data processing device, for example, a document processing device, "Yomi by another name" of the radical of the Chinese character and the dictionary data buffer (5
The official "Yomi" of the radical linked to "Yomi" in 3)
A Yomi conversion table (54) that corresponds to and is provided. Search, based on the "Yomi" obtained by the search,
It is characterized in that the dictionary data buffer (53) is searched to obtain a desired kanji code, which is set in the display buffer (52) and displayed.

[0017]

[Function] Kanji radical to be searched "Yomi by another name" 54
When 0 is entered, the official “Yomi” 541 of the radical is searched from the Yomi conversion table 54, the dictionary data buffer 53 is searched based on the official “Yomi”, and the corresponding kanji code is searched. Is obtained and written in the message area of the display buffer 52 to display it.

[0018]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The Yomi conversion table 54 in FIG. 1 is added by the present invention, and the official "Yomi" 541 of each radical shown in the table is a link to "Yomi" in the dictionary data buffer 53. It is a means.

In the present invention, the dictionary file 4 includes
A Yomi conversion table having a configuration different from that of the dictionary data is provided and is initially loaded on the memory 5. The Yomi conversion table 54 lists Yomi by another name of radical and the official Yomi of that radical, that is, so-called "Yomi" used when searching the dictionary data buffer 53.

The procedure of kanji character search by the radical alias of a kanji character will be described below. When there is a request for "radical search" from the operator, the kanji radical search process is started. The kanji radical search process is performed by the processor 1 executing the program 51.

Step 1: When the operator inputs "Yomi", which is another name for the radical of the kanji to be displayed, and then, for example, the "radical search" key is pressed, the kanji radical search process is executed. Be started.

Here, it is assumed that an alias is input. Step 2: The Yomi by the alias in the Yomi 540 by the alias of the radical of the Yomi conversion table 54 on the memory 5 is detected, and the corresponding Yomi in the "Yomi" 541 is extracted.

Step 3: By this "spot",
The dictionary data buffer 53 is searched to find the corresponding "Yomi", the corresponding Kanji code is picked up, set in the message line area of the display buffer 52, and the message on the display 2 is displayed. − Display in line 2.

Step 4: Here, when the operator selects a desired kanji from the kanji list displayed on the message line of the display 2 with the number (0 to 5) keys, the code of that kanji is selected. Is set in the relevant area of the document in the display buffer 52. Now we have the kanji that the operator wants.
If the desired kanji is not displayed in the message line,
The operation such as tapping the "next page" key is the same as the conventional one.

As described above, according to the present invention, the radical Yomi conversion table 54 having a configuration different from that of the dictionary data buffer is provided, and when the radical of Kanji is used as a clue, the official Yomi of the radical is not known. By the Yomi conversion table 54 of the radical, a desired radical is searched by using the Yomi of the radical alias as a clue, and the dictionary data buffer is searched by using the searched "Yomi" as a key, The feature is that the necessary kanji are called and displayed.

[0026]

As described above, in the kanji radical search method of the present invention, the basic dictionary data is one "Yomi".
And the kanji group are made to correspond to each other in a one-to-one correspondence ("Yomi" and one kanji to one to n), and are composed of only the minimum information of the corresponding kanji group and the corresponding kanji group. In addition, the dictionary data buffer can be saved in capacity, and since the information corresponding to the Chinese character group is only one type of headline, the conversion table linked to the reading of the headline can have a small capacity.

Therefore, even in a small document processing apparatus, there is an advantage that only a relatively small table or the like needs to be provided.

[Brief description of drawings]

FIG. 1 is a diagram illustrating the principle of a kanji radical search method according to the present invention.

FIG. 2 is a diagram illustrating a conventional kanji radical search method.

[Explanation of symbols]

 1 processor 2 display 3 keyboard 4 dictionary file 5 memory 51 program 52 display buffer 53 dictionary data buffer 54 Yomi conversion table 540 Yomi by another name of radical 541 (formal dictionary) Yomi

Continued Front Page (72) Inventor Mitsuru Shirakawa 1015 Kamiodanaka, Nakahara-ku, Kawasaki-shi, Kanagawa Fujitsu Limited

Claims (1)

[Claims] 1. A dictionary data buffer storing dictionary data in which a corresponding kanji group is associated with a kanji "yomi" and a corresponding kanji group is associated with a radical "yomi" of a kanji ( 53), and a display buffer (52), and in a data processing device for inputting and processing Japanese, a kanji radical "Yomi by alias" and the above-mentioned dictionary data buffer (53) "Yomi" A Yomi conversion table (54) that corresponds to the official "Yomi" of the radical linked to is provided. When the Yomi by alias of the Kanji radical to be searched is entered, the Yomi conversion table ( 54), search for "Yomi" of the radical, and based on the "Yomi" obtained by the search, search the dictionary data buffer (53) to obtain the desired kanji code, and display the above buffer. Kanji radical search method characterized by being set and displayed in (52) Law.