JP2596880B2 - How to search for Kanji - Google Patents

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 in a Japanese word processor or the like and a storage device for retrieving kanji.

[0002]

2. Description of the Related Art In a method of searching for kanji in a Japanese word processor or the like, onnomi input is common, and when a kanji cannot be read, a total number of strokes is input as in the case of using a Kanji dictionary. All relevant kanji were read out on the display screen and the reading method was checked. Alternatively, the user has focused on the radicals constituting the kanji, and sequentially reads out all the kanjis including the radicals on the display screen to check how to read them. In the former two, there are thousands of kanji characters in the same reading and thousands of kanji in one to thirty strokes. Was not easily found. In the latter case, kanji is displayed as a candidate for each radical, so the number of kanji increases, and in many cases the desired kanji cannot be easily found unless you are familiar with the radicals that the kanji contains. . Further, in another method of searching for kanji in a Japanese word processor or the like, when a kanji can be read but a kanji cannot be written and searched, a code table is carefully visually examined to find a target kanji. When doctors and lawyers request special kanji, they look into the code table, but searching for the code table was hard work for people with presbyopia because of the fine characters. In the JIS second level kanji input, the number of kanji with the same reading is nearly 300 in many cases. To find the target kanji from among them, press the conversion key many times while looking at the kanji candidate. The pressing was complicated. Alternatively, there is a method of calling a idiom using the target kanji, leaving the target kanji, and deleting unnecessary kanji, but there is an inconvenience that not all kanji can be used. Also, do you know exactly what you read,
In some cases, kanji could not be discovered unless you knew something like "bias". In addition, although the desired kanji could be obtained, the reading kana could not be obtained.

[0003]

As described above, in the conventional kanji search method, the number of candidate kanji is large, and it is a great labor to check each kanji at a glance. If the target kanji cannot be found with a rarely used place name or person name, refer to the JIS kanji code table.
Retrieving a target kanji code using the S kanji code table has the disadvantage that it is hard work and takes time and effort. In addition, when the reading kana is not correctly stored, there is a possibility that a typo may be selected.

[0004]

According to the present invention, a set of various kanji, their kana, their various codes, and a page belonging to a printed material dictionary is registered in advance, and basic elements such as radicals constituting these kanji are arranged. A categorized list is created, the list is displayed on a CRT as a heading, a basic element is designated from the list by operating a mouse or the like, a kanji group having the element is designated, and from among the kanji group, A plurality of candidate kanjis are displayed on a CRT, with the kanji previously selected as a head,
A desired kanji is selected from among them.

[0005]

The basic element data list is displayed on a CRT, and when a basic element constituting a part of a target kanji is designated, candidate kanji having the element is displayed on the CRT. At this time, the previously selected kanji is displayed at the top, and when the target kanji is selected, the target kanji, its reading kana, its various codes, and its affiliation page on the print dictionary are displayed. The selected kanji is stored in a predetermined memory with its display priority increased.

[0006]

BRIEF DESCRIPTION OF THE DRAWINGS FIG. First, the hardware in which the present invention is implemented is a general-purpose desktop computer or an information device of a word processor.
In FIG. 7, in the desk-top computer, the CPU 17 of the central processing unit extracts information from the magnetic recording device 15 such as a disk, and processes the information using the RAM 16 of the memory. The processing result is displayed on the CRT 18 of the display device in accordance with an instruction from the keyboard 21. A memory register 23 is connected to the CPU 17, and the memory register 23 includes a register 24 and a counter 25. The register 24 and the counter 25 has a plurality provided a respective storage areas set, since the memory registers 23 are small memory, faster than the RAM16 of the main memory, CPU 1
7 is accessed. The content of the counter 25 is the CPU 1
7, the value is incremented so as to be resettable. CP
U17 is an integrated circuit ICROM 26 and magnetic recording device 15
And read only from the ICROM 26,
Reading and additional writing are also performed on the magnetic recording device 15.

A method for implementing the present invention on such a desk-top computer will be described in order. By the way, each of the currently used educational kanji, common kanji, and personal name kanji is often composed of two or more basic elements due to its structural structure. These basic elements include the radicals of the radicals used traditionally in the Kanji script, the side, the crown, the legs, the hanging, the syllabary, and the structure, as shown in FIG. One example is "mountain", "word", "large", "kei"
And the like.

Now, a plurality of basic elements are combined to form one kanji. According to the position of each kanji, the kanji is divided into two right and left parts, and the left part is biased.
The right part is called labor, the upper part is divided into upper and lower parts, and the lower part is called the leg. In addition to these four parts, the part that hangs down from the top is suspended, the part that goes around the lower part is covered, and the part that wraps the whole is called the frame. A common radical is one obtained by extracting a basic element having a common form from the above seven elements. Further, in addition to these seven classifications, it is also known that the same shape as one of the radicals, such as “uneven” or “near”, is located in the middle of the stroke in the stroke order.

In this embodiment, as shown in FIG. 2, the basic elements such as the radicals are approximately 20 A to T in length, approximately 30 in width, and 2
0 × 30 = 600 are selected to make a list of headings. Here, it is possible to reduce the absolute number of elements by treating similar basic elements as the same element, for example, “shin” and “of course”, and “yen” and “dan” in G rows and 10 columns. it can. In addition, a list of basic elements is created by displaying the elements side by side so that the elements can be easily found. Also, in FIG. 2, similar radicals and the like are gathered in the horizontal direction and assigned the same call number for convenience in use. For these selected basic elements, those with a relatively large number of strokes may be further decomposed into those with a small number of strokes, and the number may be increased,
Conversely, two or more strokes with a small number of strokes may be combined to reduce the number.

FIG. 2 is created based on the structural characteristics of the kanji, and the present invention will be described below with reference to a flowchart and FIG. First, in step S1 of FIG. 3, educational kanji, common kanji, and personal name kanji that are currently used are listed as much as possible, and, for example, a large kanji group K of the largest group up to JIS second level is created. Next, in step S2, for the collected large kanji group K, for each basic element in the list of FIG. Create In step S3, the kanji is added to the kanji as a set of the sound / Kunyomi, numbers such as JIS code, punctuation code, shift JIS code, etc., and the affiliation page in the dictionary of Iwanami Publishing .

In step S4, each kanji of the Chinese kanji group 1 is read as a kana, a JIS code, a period code and a shift JI.
It is registered in a predetermined magnetic storage device or the like as a set of an S code and a page to which the dictionary belongs. To explain the example of FIG.
"Shin" is "Shin" for Onyomi, "Makoto" for Kunomi, and J
The IS code number is “3F2E” and the period code number is “31”
14 "Shift JIS code number is" 904D ", for example, the page belonging to the dictionary of Iwanami Shuppan is" aaa. "The same thing is recorded for all other kanji based on a survey of the Kanji dictionary of the actual printed matter and the JIS table. At step S5, it is checked whether or not the Chinese kanji group of the magnetic kanji dictionary has been created for all of the 600 basic elements in FIG. By repeating step S5, the radical "mountain" and "large"
For all other basic elements, such as Chinese kanji group 1 in FIG.
n to i to 600 are created. Therefore, the Chinese kanji groups 1 to i to 1 of a magnetic Chinese-Japanese dictionary composed of approximately 600 sets as shown in FIG.
600 are created.

Next, in step S6, the kanji whose radical "word" is the first in the stroke order is extracted from the Chinese kanji group 1 to obtain a small kanji group 1-1, and in step S7, the "kanji" is extracted from the Chinese kanji group 1. The middle kanji in the stroke order is extracted to create a small kanji group 1-2, and in step S8, the last kanji in the stroke order is extracted from the middle kanji group 1 to create a small kanji group 1-3. Step S
In step 9, these small Chinese character groups 1-1 to 1-3 are registered in a predetermined magnetic storage device or the like. In step S10, the small Chinese character groups 1-1 to p-3 for all the Chinese character groups 1 to i to 600 in FIG.
Is checked, and steps S6 to S10 are repeated to create small kanji groups 1-1 to i-3 to p to 1800 for all other basic elements such as "yama" and "large". Therefore, approximately 600 × 3 = 180 as shown in FIG.
Zero small kanji groups are created. Small Kanji group 1-1 to i-3
Each kanji in ~ p ~ 1800 is also a set of the reading kana, the JIS code, the period code, the shift JIS code, and the belonging page in the dictionary.
3 to 1800 are recorded on a magnetic disk or an integrated circuit. The magnetic disk becomes a dictionary floppy, and the integrated circuit of the ROM becomes an IC card dictionary, which can be freely incorporated in the information processing apparatus for document processing shown in FIG.

Now, the small kanji group 1-1 to p-3 to 1800
Each of the kanjis, for example, "take" is stored with various attributes in the magnetic storage device as shown in FIG. FIG.
In the data packet 9 of the kanji “take”, the page column 6
, Reading column 7, code column 8, first attribute 11, second attribute 1
2 and a third attribute 13. The page column 6 contains the affiliation page "hhh" in the dictionary, the reading column 7 contains the reading kana "gag" and "only", and the code column 8 contains the K code centered on the JIS code number 5656 in hexadecimal. 545
4 and the S code 9BD4, the first attribute 11 is “word 2”,
“Mountain 1” for the second attribute 12 and “Large 3” for the third attribute 13
Are recorded respectively. The belonging page “hhh” indicates in which page of the dictionary of Iwanami Shuppan the kanji “take” is stored, for example. The numbers 1, 2, and 3 following the basic element "word" of the radical, for example, in "word 2", the word bias is "take"
The stroke order in the middle indicates that the stroke is intermediate. Hereinafter, “mountain 1” indicates that the mountain is the first in the stroke order, and “large 3” indicates that the large is the last in the stroke order. Here, the numbers 1, 2, and 3 are added following the basic elements of the radical, but the basic elements of the radical are added after the numbers 1, 2, and 3, "two words", "one mountain", and "three large". It is good. Furthermore, if the magnetic disk is a dictionary floppy,
A learning storage area 10 that can be updated for each kanji is provided. The learning storage area 10 stores the total number of selections of each kanji, and stores the small kanji groups 1-1 to i-3 to p to 1800.
Is added to each kanji when it is recorded. ROM I
In the case of the C card dictionary, the counter 25 of the memory register 23 in FIG. 7 is designated and used for each selected kanji.

The "word 2" of the first attribute 11 and the "word 2" of the second attribute 12
There are a plurality of different kanji (code numbers XXXX) having the same attribute of “Yama 1” of the third attribute 13 and “Large 3” of the third attribute 13 (XXXX is an arbitrary number from 1 to 9). Matches that there are multiple candidate kanji. Although the first attribute “word 2”, the second attribute “mountain 1”, and the third attribute “large 3” are represented by ordinary characters for convenience of explanation, they are binary characters in a magnetic storage device or an information processing device. Or it is recorded in hexadecimal.

In the character search method of the present invention, the Chinese character group 1
There are two modes, a “schematic” search for i to 600 as a search target and a “detail” search for a small kanji group 1-1 to p-3 to 1800 as a search target. In the case of the “abbreviated” mode search, the target character is surely included, but the number of candidate characters increases, and character determination is delayed. In the "Details" mode, if the candidate group contains the target character, the character is determined more quickly. Conversely, if the candidate group does not contain the target character, another candidate group must be specified. In addition, character determination is delayed. However, when the number of candidate characters is large, a plurality of basic elements are designated from the list, and among the candidate kanji having each of these basic elements, the common kanji group and the plurality of small kanji groups are common. By selecting candidate kanji that exists, the number of candidate kanji can be significantly reduced. Next, the operation in a case where the kanji "take" is actually searched using the IC card dictionary in the ROM will be described with reference to the flowcharts of FIGS. At the time of startup, the contents of the memory register 23 are cleared , and the registered kanji does not yet exist.

First, the search program of the present invention is loaded into the CPU 1
7 reads out the data from the disk 15 onto the RAM 16, and in step S11, finds the desired kanji character "take"
6 is accessed to display the index list of FIG. 2 on the screen of the CRT 18. In step S12, if the instruction from the keyboard is a “schematic” search, the Chinese character group 1 to ni
2 to 600 are searched, and the process proceeds to step S13. In order to find “dake” from the list of FIG.
U18 searches the memory register 23 in step S14 to check whether a kanji having "word" as a basic element is registered. If there is a registration in step S15, the process proceeds to step S16, in which a candidate kanji having the word "" as a basic element is selected from the Chinese kanji group 1 by accessing the ICROM 26, and the candidate kanji having the largest content of the counter 25 is selected. , And all candidate kanji with the word ""
Display on RT18. If there is no registration in step S15, the process proceeds to step S17, where the Chinese character group 1
All candidate kanjis having "word" at the radical are displayed on the CRT 18 together with a heading list in the order of storage.

In step S18, when the target "take" is found in the list of candidate Chinese characters of the Chinese character group 1, the character is determined by designating it with a cursor or the like. Here, if there is a character search before and there is a record of selecting "Dake", "Dake" is registered in the register 24 and "1" is registered in the corresponding counter 25, respectively. The CPU 17 recognizes this “take” in the candidate kanji, and the selection frequency registration indicating the number of determinations is “1”.
Is displayed before other candidate characters. Therefore,
The operator can easily find “Dake” from a plurality of candidate characters, and the character selection can be performed quickly. For example, if the contents of the memory register 23 are “Shin” “3” and “Dake” “2”,
"Shin" is displayed first, "Take" is displayed next, and other candidate kanji characters are displayed in that order. It should be noted that a candidate character having a high selection frequency registration may be marked with an underline or the like to make it easier to see. Step S
When the character is determined in step 18, the process proceeds to step S19, in which the determined pseudonyms of "take""gaku","only" and J
IS code "5656", K (5454), S (9BD
4) and, for example, the belonging page “hhh” in the Iwanami dictionary is C
Displayed on RT18. In step S20, the CPU
17 registers the determined “take” in the register 24 of the memory register 23, and stores the determined count “1” in the counter 25 of the set.
Is set, and if it is already registered, the current value of the counter 25 is set to 1
Is added, and the result is set in the counter 25 again.

[0018] Thus, the kanji character "take" whose selection frequency is high is registered.
Is always displayed at the top, so that "dake" can be stored in a database format unique to an individual. Even if it is a kanji that is frequently used by certain individuals and generally rarely used,
Similarly, by increasing the number of determinations for other kanji, specific individuals can quickly find them. If the kanji cannot be determined due to too many candidate characters in step S18, the process proceeds to step S21, and the bias "mountain" is designated as the basic element. In step S22 (X),
Similar to steps S14 to S17, the CPU 17 performs an operation such as searching the memory register 23 to check whether a kanji having "yama" as a basic element is registered or not. n is displayed. In step S23, when the target "take" is obtained from the list of candidate kanji of the middle kanji group n and is determined, the above-described steps S19 and S20 are performed.
To display the kanji with kana etc., increment the counter value, and the search process ends.

If the kanji cannot be determined in step S23,
Proceeding to step S24, another large element "large" is designated. In step S25 (X), the CPU I7 operates similarly to the above-described steps S14 to S17, searches the memory register 23, and performs an operation such as checking whether or not a kanji having "large" as a basic element is registered. Then, the Chinese character group i of the partial “large” is displayed. Step S2
When the target “take” is obtained from the list of candidate Chinese characters of the Chinese character group i in step 6, the process proceeds to steps S19 and S20, and the search process ends. If no candidate character is found and the kanji cannot be determined in step S26, the process proceeds to step S27, and another measure is considered assuming that the desired kanji "take" is not registered in the JIS second level range. Step S24
If "Dog" is indicated instead of "Large", the search for the radical "Dog" can be continued by the same operation as in Steps S14 to S17.

Further, the steps S13 and S2
In one step S24, the search may be started first. If the instruction from the keyboard is not “abbreviated” but “detailed” search in step S12, follow the arrow A in FIG.
It proceeds to the flowchart of. Now, in step S28, since the support from the keyboard is "detail", the search target is FIG.
Are expanded to 1800 small kanji groups 1-1 to p-3.
The basic element specified in step S29 is, for example, "word"
Therefore, the process proceeds to step S30. This step S30
When the "word 1" to be written first is designated as the "word" of the radical, in step S31 (X), the CPU 17 searches the memory register 23 in the same manner as in steps S14 to S17. , Etc., to determine whether or not a kanji having "" is registered. The small kanji group 1-1 shown in FIG. 1 represents all kanji whose radical "word" is the first in the stroke order.
Is displayed.

When the target "take" is obtained from the candidate kanji list of the small kanji group 1-1 in step S32 and determined, the process proceeds to step S19 in FIG. 4 according to arrow C, and the search process ends. However, since “Take” does not exist in the small kanji group 1-1 and the kanji can be determined, the process proceeds to step S33. Here, since "word 2" to be written in the middle is specified, in step S34 (X), the CPU 17 executes the processing in steps S14 to S14.
Similar to step S17, the memory register 23 is searched to determine whether a kanji having a "word" is registered, and the small kanji group in the figure showing all kanji whose radical "word" is in the middle in the stroke order 1-2 is displayed. In step S35, when the target "take" is obtained from the candidate kanji list of the small kanji group 1-2 and determined, the process proceeds to step S19 and the like in FIG. ", The affiliated page" hhh "on the dictionary, the JIS code" 5656 ", etc. are displayed, and the search process ends.

For the sake of explanation, if the kanji cannot be determined in step S35, the process proceeds to step S36. Here, since "word 3" to be written last is specified, step S37 is performed.
In (X), the CPU 17 searches the memory register 23, similar to steps S14 to S17,
An operation such as checking whether or not a kanji having "word" is registered is performed, and a small kanji group 1-3 of FIG. 1 showing all kanji whose radical "word" is the last in the stroke order is displayed. You. When the candidate character can not be determined is not found Chinese characters in step S38, seek the procedure proceeds to step S39 Kanji "bamboo" is JIS
Consider another measure as not being registered in the second level range. In step S36, instead of "word 3",
If you indicate other "biased" that does not constitute "dake", err
or is displayed.

The steps S30 and S3
3. Step S37 may start the search first. In step S29, if the instruction from the keyboard is not "word" but "mountain", the process proceeds to step S40.
For “mountain”, the process proceeds to “mountain 1”, “mountain 2”, and “mountain 3”, and the search is continued by following the same operation as in steps S30 to S39. Further, if the instruction from the keyboard is not "mountain" but "large" in step S40, the process proceeds to step S41. About "Large", "Large 1", "Large 2",
Proceeding to “Large 3” and proceeding from step S30 to step S39
The search is continued by following the same operation as. In addition, any of the steps S29, S40, and S41 may start the search first.

An actual kanji search method after completing the dictionary of the present invention will be described below using kanji groups. In view of the fact that a kanji is composed of one or more constituent elements such as radicals, for each basic element, as described above, for example, "word"
About what this basic element starts to write first
Words, "two words" to start writing halfway, and "three words" to start writing last are displayed below. Here, for example, "one word (148)" indicates that there are 148 kanji characters that start writing the word or side, and the kanji characters following ":" indicate candidate characters to be displayed.

In the following, "word" and "kemonohen" are collected for each of the small kanji groups 1-1 to 1-3 by distinguishing whether to start writing first, halfway, or last. Display kanji group. The small kanji group for the radical with each attribute is as follows. At this time, the CPU 17 checks the register 24 of the memory register 23 and the counter 25 to check whether there is any previously read kanji. If there is a registration, the character is displayed first, and if there is no registration, candidate characters are displayed as follows in the dictionary of the small kanji groups 1-1 to 1-3.

One word (148): The so-called Audience Division, the so-called affairs of the scholarship, the humorous teaching of the humor, the proverbs, the misrepresentation lecture, the false poetry, the poetry trial magazine, the admiration of the poetry, the details of the litigation, and the transfer of the decree. The story of the conspiracy, the consent of the person, the story of the birth of the inquisition, the esoteric interpretation of the mystery, the perception of the mystery, the inferiority of the inferior score, Zhu Taishou Sharp Sharp Sharp Sharp Sharp Shake Sharp Shake Shake Shake Shake Shake Shake Shake Shake Shame Shame Shame Sharp Shake Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shame Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Sharp Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Shake Sharp Shake Shake Shake Shake Shake 2 words (25): 獄 藷 藷 ２５ ２５ ２５ ２５ ２５ ２５ ２５ ２５ 言 言 言 言 言 ２５ 言 言 言膽 け け ６５ ６５ ６５ け け け ６５ け ６５ け け け け け け ６５ け け け け け ６５ ６５ け け け け け け ６５ け け け け け け け け ６５ け け けIn the case of 獵 狷 狷 豺 豺 豺 ９ ９ ９ ９ ９ 豺 ９ ９ ９ 豺 豺 豺 ９ ９ ９ 豺 豺 ９ ９ 豺 豺 ９ ９ ９ ９ ９ ９ ９ ９ ９ ９ ９ ９ ９ 豺): Hale

In this way, a plurality of kanji dictionaries are divided and displayed for each basic element, and each kanji list is associated with a list of basic elements on a CRT. To search for kanji using this, select the detailed mode in which the stroke order of the element is specified from the basic elements in the table, or the general mode in which the element is simply specified without specifying the stroke order of the element. In both the outline mode and the detailed mode, when a plurality of basic elements are designated from the list, among the candidate kanji having each of these basic elements, the candidate kanjis are commonly present in the middle kanji group and the plurality of small kanji groups. CR only candidate kanji that has been conditioned as candidate kanji
Characters displayed on T can be displayed.

A description will be given of a case in which “chapter” is searched for by using a conditional method using the outline mode. A list of basic elements is called on the CRT, and the outline mode is selected. Select "word" from the list in FIG. 2, and all the kanji (one word + two words + three words) having all "words" are displayed on the CRT. Without confirming the character, continue with "Kemonohen" from the list
If you select (1st + 2nd + 3rd), common data of "word" and "kemono" are obtained, and as a result, candidate characters "chapter", "take" and "prison" are obtained. It is easy to choose "chaud" from these. of course,
The order in which the elements are selected from the list may be selected in any order.

Here, when "chapter" is designated by a cursor or the like,
The candidate character disappears, and the selected character “Kai” is read and the pseudonym “Kyou”, “Tara” and JIS11 code 6B54 and other codes K (7552), S (E) are displayed on the CRT 18.
673) and the belonging page "ppp" on the dictionary are displayed. The operation at this time is as follows.
Alternatively, the CPU 11 reads out the Chinese character group of “word” and the Chinese character group of “Kemonohen” from the RAM 16. A packet equivalent to that shown in FIG. 6 is examined for these middle kanji groups, and only kanji characters having two types of attributes (stroke order is ignored) and two candidate kanji characters having the same radical are displayed on the CRT 18.

Next, using the detail mode,
A case in which a search is performed using a method that satisfies is described. Call the list on the CRT and select the detail mode. Select "word" from the list, but at this time "start writing"
By giving the command, "One word" becomes selectable,
A "one word" candidate is displayed on the CRT. Next, "Kemonohen" is selected from the list. At this time, by giving the instruction "Start writing in the middle", "2Kemonohen" can be selected, and "1 word" and "2Kemonohen" are common. Data is obtained, and as a result, only "chaud" is displayed on the CRT as a candidate character. It can be seen that the selectivity is superior to that in the general mode. Of course, the order in which the basic elements are selected from the list may be selected in any manner.

The operation at this time is as follows.
The small kanji group of "one word" and the small kanji group of "2 kemonohen" are read from the ISK 15 or the RAM 16. A packet equivalent to that shown in FIG. 6 is examined for these small kanji groups, and only kanji characters having two kinds of attributes (including stroke order) and two kanji characters having the same radical are displayed on the CRT 18. At this time, CPU1
7 is a register 24 of the memory register 23 and a counter 25
And check if there are any previously read kanji. If there is a registration of the number of selections for “chaud”, candidate characters are displayed with that “chaud” at the top, so that the character can be easily determined. When the prisoners of the prisoners remember the "captive", they instruct the "factory" and the "male" to recall them slightly, and follow the actions described above, and the captives "Ryo", "Toriko", and J (4E3A)
K (4626) S (97B8), belonging page "ppp"
Is easily obtained, and "captive" is stored in the register 24 of the memory register 23, and "1" is given to the value of the counter 25. In addition, based on the affiliation page "aaa" on the dictionary, actually check the page of the dictionary of Iwanami Publishing,
You can also know the etymology of. When the kanji dictionary is a floppy disk or the like, the CPU 17 in FIG.
15 and the number of times of selection is registered, the renewable learning storage area 10 shown in FIG.
And the same operation as described above.

[0032]

As described above, according to the present invention, a list of basic elements constituting a kanji is created, and the kanji, its reading kana, its various codes, and the page belonging to the print dictionary are stored in advance. Creates a lexicon, displays a group of kanji containing the specified basic elements, and selects the desired kanji from among them, so that any number of difficult-to-read kanji can be easily read without using the JIS kanji code table. You can search and input kanji in a word processor reliably and quickly. Even if the kanji is rarely used in the field of law or medicine, if it has been selected before, it will be displayed at the top in proportion to the number of selections, resulting in a very small number of kanji candidates to be extracted. It functions as a kanji dictionary for specific purposes, and has the effect of dramatically improving the speed of inputting kanji to word processors and the like in all fields. In addition, since it has a single function as a Chinese-Japanese dictionary, it can be used as a learning device for Chinese characters.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a dictionary kanji group of the present invention.

FIG. 2 is a diagram showing a list of basic elements such as unevenness of the present invention.

FIG. 3 is a flowchart illustrating the operation of the dictionary kanji group creation method of the present invention.

FIG. 4 is a flowchart showing a schematic mode of a search according to the present invention.

FIG. 5 is a flowchart showing a detailed search mode according to the present invention.

FIG. 6 is a diagram showing a storage configuration of kanji in a dictionary kanji group of the present invention.

FIG. 7 is a block diagram of an information device in which the present invention is implemented.

[Explanation of symbols]

 1, n, i Chinese character group 1-1, n-1, i-1, p-1 Small Chinese character group K Large Chinese character group 6 Page column 7 Reading column 8 Code column 9 Data packet 10 Learning storage area 11, 12, 13 Attribute column 15 Magnetic storage device 16 RAM 17 CPU 18 CRT 21 Keyboard 23 Memory register 24 Register 25 Counter 26 ICROM

Claims (6)

(57) [Claims] 1. A kanji is decomposed to extract basic elements constituting a kanji, these basic elements are arranged to create a list for search, the list is registered in a storage device, and the basic elements are A set of kanji having its constituent elements, its kana and its various codes is collected to form a group of Chinese kanji, and this group of Chinese kanji is created for each of the basic elements. In the stroke order, the first set of kanji to be written is collected and collected as a first small kanji group, the middle kanji set to be written in the middle is collected, and the second kanji set to be written last is collected as a second small kanji group Classified as a third small kanji group, a similar small kanji group is created for each of the middle kanji groups, registered in the storage device, and the list is displayed on a display device. And the candidate kanji having this basic element is An operator's instruction in the character group, the first small kanji group, the second small kanji group, or the third small kanji group
From one of the kanji groups arbitrarily selected according to
In the kanji search method, the candidate kanji is displayed on a display device, a target kanji is selected from the candidate kanji, and the selected kana is paired with a reading kana and various codes. In addition to the set of kanji, its reading kana, and its various codes, a page belonging to the kanji in the printed dictionary is added to form a set of kanji, and can be updated corresponding to each kanji in the small kanji group. A storage area is provided in a storage device, and the number of selections is recorded in the learning storage area for the selected kanji,
When displaying the candidate kanji, the candidate kanji having the larger number of selections is displayed at the top or with an identification mark, and the kana and the various codes that are paired with the selected kanji are displayed. A method for retrieving a kanji , wherein the affiliation pages on the printed material dictionary are displayed together .
Law. 2. A kanji is decomposed to extract basic elements constituting a kanji, the basic elements are arranged to create a list for search, and the list is registered in a storage device. A set of kanji having its constituent elements, its kana and its various codes is collected to form a group of Chinese kanji, and this group of Chinese kanji is created for each of the basic elements. In the stroke order, the first set of kanji to be written is collected and collected as a first small kanji group, the middle kanji set to be written in the middle is collected, and the second kanji set to be written last is collected as a second small kanji group Classified as a third small kanji group, a similar small kanji group is created for each of the middle kanji groups, registered in the storage device, and the list is displayed on the display device. Indicates one of the basic elements and has one of the basic elements
The candidate kanjis, the Chinese kanji group, the first small kanji group, and the second small kanji
One candidate kan from the kanji group and the third small kanji group
A character group that is memorized as a character group followed by the other basic element
Similarly, the supplementary kanji is divided into the above-mentioned Chinese kanji group, the first small kanji group and the second
Other candidates selected from the small kanji group and the third small kanji group
Memorized as a kanji group, and said one candidate kanji group and other
Select only candidate kanji that exists in common with the candidate kanji group
And displaying , selecting a target kanji from among these common candidate kanjis, and displaying a kana and various codes that form a pair with the selected kanji, the kanji and the kanji To the set of the reading kana and the various codes, the affiliation page of the kanji in the printed matter dictionary is added to form a kanji set, and a learning storage area that can be updated corresponding to each kanji in the small kanji group is provided. Provided in a storage device, the number of selections in the learning storage area for the selected kanji is recorded,
When displaying the candidate kanji, the candidate kanji having the larger number of selections is displayed at the top or with an identification mark, and the kana and the various codes that are paired with the selected kanji are displayed. A method for retrieving a kanji , wherein the affiliation pages on the printed material dictionary are displayed together .
Law. 3. The kanji search method according to claim 2, wherein the learning storage area is provided in the same storage device that stores the small kanji group. 4. The method according to claim 3, wherein said storage device is a magnetic disk. 5. The kanji search method according to claim 2, wherein the learning storage area is provided in a storage device separate from the storage device that stores the small kanji group. 6. The kanji search method according to claim 5, wherein said storage device comprises an integrated circuit.