JP3945075B2 - Electronic device having dictionary function and storage medium storing information retrieval processing program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to an English-Japanese dictionary, a database such as a Japanese-English dictionary, and the like, and relates to an information search device for searching and displaying information associated with a headword and a storage medium storing an information search processing program.
[0002]
[Prior art]
In recent years, dictionary data such as English-Japanese dictionaries and Japanese-English dictionaries are stored as a database, and a keyword to be searched is input as a keyword. An electronic dictionary device is conceivable in which stored semantic content is read and displayed.
[0003]
In such an electronic dictionary device, various search methods have been conceived so far as search means from a keyword for a database. Here, four representative data search methods (1) to (1) to (4) are used. (4) will be described.
[0004]
(1) Leading match search method
A method for searching for and displaying a list of headwords having a character string that matches a predetermined number of characters in order from the first character of the input keyword, and specifying a desired headword and displaying its meaning content .
[0005]
(2) Character number matching search method—part 1
A method that searches for headwords that have the same number of characters as the input keyword and displays them in descending order of headwords with the largest number of matching characters.
[0006]
(3) Character number coincidence search method-2
A method of searching for headwords having the same number of characters as the input keyword and headwords having increased or decreased several characters, and displaying them in order from headwords having the largest number of matching characters.
[0007]
(4) Spell check & collect technique
A technique in which pseudo headwords composed of character strings that are easily mistaken when entered as keywords are stored together for each headword in the database, and headwords that match the input keywords are searched and displayed.
[0008]
[Problems to be solved by the invention]
However, the electronic dictionary device provided with such a data search method has the following problems.
[0009]
(1) In the head matching search method, there is a problem that it is difficult to search for a desired headword when there is a wrong character near the head in the input keyword that is different from the desired headword.
[0010]
(2) Character number matching search method-In the first method, it is possible to search for a desired headword as long as the total number of characters is correct, even if there is a mistake in a character that is partially different from the desired headword in the keyword. When the number of characters of the input keyword itself is different from the number of characters of a desired headword due to a mistake in the character string, there is a problem that it is difficult to search for the desired headword.
[0011]
(3) Character Number Matching Search Method—Part 2 can search for a desired headword even if the number of characters of the input keyword is slightly different from the number of characters of the desired headword. There are problems that the number of words is very large and the search process takes time, and the matching determination process with a headword whose number of characters increases or decreases with respect to the keyword becomes complicated.
[0012]
(4) With the spell check & collect method, it is possible to search for a desired headword even if there is a slight mistake in the input keyword. There is a problem that it is necessary to have a dedicated dictionary that stores headwords together.
[0013]
The present invention has been made in view of the above problems, and easily searches for a desired headword even if there is a slight mistake in keywords without requiring a separate dictionary for spell check & collect. It is an object of the present invention to provide an information search device and a storage medium storing an information search processing program.
[0014]
[Means for Solving the Problems]
That is, in the present invention Person in charge Ru Electronic with dictionary function The apparatus stores a plurality of headwords and information related to the headwords in association with each other. Dictionary data Having storage means Electronic with dictionary function An input unit for inputting a keyword corresponding to a headword to be searched, and the keyword input by the input unit Dictionary data A complete match determination means for determining whether or not the headwords read from the storage means completely match; and, when the complete match determination means determines that the headword is completely matched with the keyword, When the first search word display means for displaying the head word as a search word and the complete match judgment means determine that the head word does not completely match the keyword, Dictionary data Among the headwords read from the storage means, the number of matching characters from the top of the keyword is in descending order. Within a predetermined number A first headword search means for searching for a headword, and when the headword does not completely match the keyword by the perfect match judgment means, Dictionary data Among the headwords read from the storage means, the number of matching characters from the end of the keyword is in descending order. Within a predetermined number A second headword search means for searching for a headword and a headword having a large number of matching characters from the head searched by the first headword search means When Headwords having a large number of matching characters from the end searched by the second headword search means As one search term list Number of matching characters of Many headwords Sort in the order of And a second search word display means for displaying as a search word.
[0015]
Such according to the present invention Electronic with dictionary function In the device, when you enter a keyword according to the headword you want to search, Dictionary data It is determined whether or not the headword read from the storage means is completely matched. If the headword is completely matched with the keyword by the perfect match judging means, the headword is the search word. Is displayed. On the other hand, if it is determined by the perfect match determination means that the headword does not completely match the keyword, Dictionary data Among the headwords read from the storage means, the number of matching characters from the top of the keyword is in descending order. Within a predetermined number Headwords in descending order of the number of matching characters from the end Within a predetermined number Headwords, and among the searched headwords, headwords with a large number of matching characters from the beginning When Headwords with many matching characters from the end As one search term list Number of matching characters of Many headwords Sorted in the order of, the sorted headwords in order Since it is displayed as a search term, even if the input keyword has some errors different from the desired headword, the desired headword can be easily searched and displayed.
[0018]
DETAILED DESCRIPTION OF THE INVENTION
Embodiments of the present invention will be described below with reference to the drawings.
[0019]
FIG. 1 is a block diagram showing a configuration of a dictionary search apparatus according to an embodiment of an information search apparatus of the present invention.
[0020]
The dictionary search apparatus 10 includes a control unit (CPU) 11 that is a computer.
[0021]
The control unit (CPU) 11 is a system program stored in advance in the ROM 13 or a search device control program stored in the external storage medium 14 such as a floppy disk in response to a key operation signal input from the input unit 12. Is activated via a storage medium reading unit 15 such as a magnetic disk device, and the operation of each part of the circuit is controlled using the RAM 16 as a work memory.
[0022]
In addition to the input unit 12, ROM 13, storage medium reading unit 15, and RAM 16, a liquid crystal display unit 17 is connected to the control unit (CPU) 11.
[0023]
The input unit 12 is provided with character input keys such as hiragana, katakana letters, and numbers for inputting arbitrary characters and character strings, and a dictionary database to be searched such as an English-Japanese dictionary, a Japanese-English dictionary, or a Japanese dictionary. A dictionary selection key for selecting a search key, a “search” key for instructing the start of search processing, a cursor key for performing a cursor moving operation on the display screen, and a selection data specifying operation, and the like.
[0024]
The ROM 13 stores in advance a system program that controls the overall operation of the dictionary search device 10, and various dictionary databases 13a such as English-Japanese dictionaries, Japanese-English dictionaries, Japanese dictionaries, and the like for each dictionary. Are stored in a form in which meaning contents are associated with each other, and various subprograms such as a dictionary search program 13b for searching a desired headword based on the dictionary database 13a and displaying the meaning contents are stored. Is done.
[0025]
The RAM 16 includes an input word memory 16a, an input word reverse character string memory 16b, a search word list memory 16c, and a work area 16d. The work area 16d includes a head match search index word memory 16d1, a tail match search index. A word memory 16d2 is provided.
[0026]
The input word memory 16a stores a keyword input according to a headword that the user wants to search.
[0027]
The keyword stored in the input word memory 16a is stored in the reverse character string memory 16b of the input word as a reverse character string starting from the character string.
[0028]
The search word list memory 16c stores a list of headwords finally searched based on the database 13a in the ROM 13 according to the keywords stored in the input word memory 16a and the reverse character string memory 16b of the input word.
[0029]
In the work area 16d, various data input / output to / from the control unit (CPU) 11 according to a device control program stored in the ROM 13 is temporarily stored and held as necessary.
[0030]
In the head matching search headword memory 16d1, headwords that sequentially match from the first character according to the keyword stored in the input word memory 16a are searched from the database 13a in the ROM 13 and stored together with the number of matching characters. Therefore, a preset number (for example, 12 words) of headwords is selectively stored in order of increasing number of matching characters.
[0031]
In the tail matching search headword memory 16d2, headwords that sequentially match from the last character according to the keyword of the reverse character string stored in the reverse character string memory 16b of the input word are stored from the database 13a in the ROM 13. It is searched and stored together with the number of matching characters, and a preset number (for example, 12 words) of headwords is selectively stored in order of increasing number of matching characters.
[0032]
Next, the operation of the dictionary search device having the above configuration will be described.
[0033]
FIG. 2 is a flowchart showing word search processing of the first embodiment in the dictionary search device.
[0034]
FIG. 3 is a diagram showing a storage state of a keyword in the input word memory 16a and the head matching search headword memory 16d1 and a head matching search headword based on the keyword in the word search processing of the first embodiment of the dictionary search device. It is.
[0035]
FIG. 4 shows storage of a keyword in the reverse character string memory 16b of the input word and the tail match search keyword memory 16d2 associated with the word search process of the first embodiment of the dictionary search device and the tail match search keyword based on the keyword. It is a figure which shows a state.
[0036]
FIG. 5 is a diagram showing a storage state of the search entry word list in the search word list memory 16c accompanying the word search processing of the first embodiment of the dictionary search device.
[0037]
For example, in order to search for a desired headword “announce” from the English-Japanese dictionary stored as the database 13a in the ROM 13 and check its meaning, the keyword is input “anounce” with an incorrect spelling in the input unit 12. Then, the input keyword “anounce” is stored as it is in the input word memory 16a in the RAM 16 as shown in FIG. 3A, while the RAM 16 is shown in FIG. 4A. Is converted into a reverse character string and stored in the reverse character string memory 16b of the input word (step S1). Then, a pointer for pointing to the headword for the database 13a in the ROM 13 is set at the head headword position (step S2).
[0038]
Then, the first entry word pointed to by the pointer is taken out from the database 13a in the ROM 13, and it is determined whether or not it completely matches each character of the keyword “anounce” stored in the input word memory 16a. (Steps S3 and S4).
[0039]
Here, if it is determined that the first headword in the database 13a does not completely match the keyword “anounce”, the number of characters that match from the beginning of the first headword is counted. (Step S4 → S6).
[0040]
At the same time, based on the reverse character string keyword “ecnuana” stored in the reverse character string memory 16b of the input word, the number of characters that match from the end of the first headword is counted (step S7). .
[0041]
Then, with respect to the keyword “anounce”, the number of matched characters from the beginning and the number of matched characters from the end are compared for the first headword, and the number of matched characters from the end is more than the number of matched characters from the beginning. It is determined whether there are many (step S8).
[0042]
Here, when it is determined that the number of matching characters from the end is equal to or less than the number of matching characters from the beginning, the leading matching search entry word memory 16d1 in the RAM 16 is, for example, shown in FIG. As shown in FIG. 4, the headword searched for the head match is stored together with the number of matching characters (step S8 → S9).
[0043]
At this time, it is determined whether or not the number of headwords stored in the head matching search headword memory 16d1 has exceeded a predetermined number (for example, 12 words). The headword having the smallest number of matching characters is deleted from the headword that has been searched for the head match of the 12 words (step S10 → S11).
[0044]
On the other hand, if it is determined in step S8 that the number of matching characters from the end is greater than the number of matching characters from the beginning, the end matching search entry word memory 16d2 in the RAM 16 is stored in, for example, FIG. ), The headword searched for the end matching is stored together with the number of matching characters (step S8 → S13).
[0045]
At this time, it is determined whether or not the number of headwords stored in the tail match search headword memory 16d2 exceeds a predetermined number (for example, 12 words). The headword having the lowest number of matching characters is deleted from the headword searched for the end-of-word search for 12 words (steps S14 → S15).
[0046]
Then, a pointer for indicating a headword for the database 13a in the ROM 13 is set at the next headword position, and based on this, whether or not the same matching search has been completed for all headwords in the database 13a. If it is determined that it has not been completed, the process returns to the process from step S3 again, and the matching search process with the keyword “anounce” is repeated for the next headword in the database 13a in the same manner as described above ( Steps S12, S16 → S3).
[0047]
Thus, with respect to the input keyword “anounce”, for example, for a certain headword, the complete match search for each of the headwords sequentially read from the database 13a or the match search process from the beginning and the end is repeated. When it is determined that the keyword completely matches, the semantic content stored in the database 13a in association with the keyword that completely matches the keyword is read out, and the keyword is read to the liquid crystal display unit 17. And displayed directly (step S4 → S5).
[0048]
Then, in a state where a headword that completely matches the keyword is not searched, as shown in FIGS. 3 and 4, the headword when the number of matching characters from the beginning is large and the number of matching characters from the end are larger. Are categorized into a head matching search headword memory 16d1 and a tail matching search headword memory 16d2, respectively, and a predetermined number of headwords having a large number of matching characters are retrieved and stored. When it is determined that the same match search storage processing from the beginning and end is completed for all the headwords in the database 13a, the headword search headword memory 16d1 And the maximum number of end-matching characters among the headwords having the maximum number of head-matching characters and the end-words searched and stored in the end-matching search headword memory 16d2. For a headword, any maximum matching characters is often either determined (step S16 → A1).
[0049]
Here, when it is determined that the number of matching characters of the headword having the maximum number of matching characters from the end is equal to or less than the number of matching characters of the headword having the maximum number of matching characters from the top The headword having the maximum number of matching characters from the head is searched as the headword having the maximum number of matching characters as a whole in the database 13a and stored in the search word list memory 16c in the RAM 16 (step A1 → A2).
[0050]
On the other hand, when it is determined that the number of matching characters of the headword having the maximum number of matching characters from the end is larger than the number of matching characters of the headword having the maximum number of matching characters from the head, The headword having the maximum number of matching characters is searched as the headword having the maximum number of matching characters as a whole in the database 13a and stored in the search word list memory 16c in the RAM 16 (step A1 → A3).
[0051]
Then, whether or not there are a plurality of search terms stored in the search term list memory 16c in the RAM 16, that is, in the step A2 or step A3, the number of matching characters with the keyword as a whole is the maximum in the database 13a. When it is determined that a plurality of search words are stored in the search word list memory 16c due to the presence of a plurality of headwords with the same number of matching characters, for example, as shown in FIG. The words are sorted alphabetically and displayed on the liquid crystal display unit 17 (steps A4 → A5, A6).
[0052]
When a desired headword “announce” is selected from the search word list displayed on the liquid crystal display unit 17, the selected headword “announce” and its meaning are stored in the database 13 a in the ROM 13. Are switched and displayed on the liquid crystal display unit 17 (steps A7 and A8).
[0053]
Therefore, according to the word search function of the first embodiment in the dictionary search device having the above-described configuration, when the keyword corresponding to the desired entry word is input by operating the input unit 12, the entry words in the database 13a are sequentially completed. It is determined whether or not they match, and if they do not match completely, the number of matching characters from the beginning and the number of matching characters from the end are counted and compared for each headword. The number of matching characters is stored in the search headword memory 16d1, and if the number of tail matching characters is large, the number of matching characters is stored in the tail matching search headword memory 16d2. Then, the headword having the maximum number of matching characters among the headword searched for the head match and the headword searched for the tail match is set as the search headword, stored in the search word list memory 16c, and displayed on the liquid crystal display unit 17. Therefore, it is necessary to provide a special database or complicated search processing even if there are some mistakes such as characters that are different from the desired headword or the number of characters in some of the entered keywords. The desired headword can be easily searched and displayed.
[0054]
Further, according to the word search function of the first embodiment in the dictionary search device having the above-described configuration, the headword that is the maximum number of matching characters among the headword searched for the head match and the headword searched for the tail match is the same. When there are a plurality of matching characters and they are stored in the search word list memory 16c as a plurality of search headwords, they are displayed in a list on the liquid crystal display unit 17 after being sorted, for example, in alphabetical order or Aiueo order. Therefore, even in such a case, it is possible to easily select a desired headword and display its meaning content.
[0055]
In the word search function of the first embodiment, each headword stored in the head match search headword memory 16d1 in which the number of matching characters by the head matching search is equal to or more than the number of matching characters by the tail matching search, Search for the headword having the maximum number of matching characters as a search headword among the headwords stored in the tail-match search headword memory 16d2 because the number of matching characters by the tail-match search is greater than the number of matching characters by the head-match search. Although it is configured to be stored in the list memory 16c and displayed on the liquid crystal display unit 17, as described in the word search function (see FIGS. 6 to 8) of the second embodiment, the head match search entry word memory 16d1 Each headword that is stored with a large number of head-matching characters and the number of tail-matching characters stored in the tail-matching search headword memory 16d2. Each of the headwords is stored in the search word list memory 16c as a search headword, and each search headword is sorted in descending order of the number of matching characters, and further sorted alphabetically and displayed from the first search headword. It is good.
[0056]
FIG. 6 is a flowchart showing word search processing of the second embodiment in the dictionary search device.
[0057]
FIG. 7 is a diagram showing a storage state of the search entry word list in the search word list memory 16c accompanying the word search process of the second embodiment of the dictionary search device.
[0058]
FIG. 8 is a diagram showing a display state of search headwords accompanying the word search processing of the second embodiment of the dictionary search device.
[0059]
In the flowchart showing the word search process of the second embodiment in FIG. 6, steps having the same processing contents as those in the flowchart showing the word search process of the first embodiment in FIG. 2 are the same step codes (S1 to S16). ) Will be omitted.
[0060]
That is, according to the processing of steps S1 to S16 of the word search processing of the second embodiment in FIG. 6, as shown in FIG. 3 and FIG. Each headword in the database 13a that is equal to or more than the number of matching characters by search is searched and stored in the head matching search headword memory 16d1, and when the number of matching characters by tail matching search is larger than the number of matching characters by head matching search When each headword in the database 13a is searched and stored in the tail-match search headword memory 16d2, each headword having a large number of head-match characters stored in the head-match search headword memory 16d1, The end-match search headword memory 16d2 stores both the headwords stored in the end-match search headword memory 16d2 Stored in the search word list memory 16c as by word, search headword table is created (step S16 → B1).
[0061]
Then, the headwords by the head match search and the tail match search stored in a table in the search word list memory 16c are sorted in descending order of the number of matching characters, as shown in FIG. Sorted in alphabetical order within each headword having the same number of matching characters (steps B2 and B3).
[0062]
Then, a pointer for designating the reading and displaying position of the search headword is set at the headword position of the head of each search headword in the sorted search word list memory 16c (step B4).
[0063]
Then, the first search index word corresponding to the set position of the pointer, that is, the search index word “anounce” which is the foremost alphabet in the alphabet with the maximum number of matching characters for the keyword “anounce” is read from the search word list memory 16c. The semantic contents stored in the database 13a in the ROM 13 in correspondence with the above are read out and displayed on the liquid crystal display unit 17 as shown in FIG. 8A (step B5).
[0064]
Here, as shown in FIG. 8B, when the “search” key in the input unit 12 is repeatedly operated or the cursor key is operated to instruct display of the next candidate for the search headword, the pointer becomes the search word list. It is set at the position of the next search headword in the memory 16c, and the next search headword and its meaning are read and displayed on the liquid crystal display unit 17 (steps B6 → B7, B5).
[0065]
Therefore, according to the word search function of the second embodiment in the dictionary search device having the above-described configuration, when the keyword corresponding to the desired entry word is input by operating the input unit 12, the entry words in the database 13a are sequentially and completely completed. It is determined whether or not they match, and if they do not match completely, the number of matching characters from the beginning and the number of matching characters from the end are counted and compared for each headword. The number of matching characters is stored in the search headword memory 16d1, and if the number of tail matching characters is large, the number of matching characters is stored in the tail matching search headword memory 16d2. Then, each headword having a large number of head matching characters stored in the head matching search headword memory 16d1 and each headword having a large number of tail matching characters stored in the tail matching search headword memory 16d2 are obtained. Both are stored in the search word list memory 16c as search headwords, and each search headword is sorted in descending order of the number of matching characters, further sorted in alphabetical order, and displayed on the liquid crystal display unit 17 in order from the first search headword. Even if there are some mistakes, such as characters that are different from the desired headword or part of the entered keyword, it is easy without the need for a special database or complicated search processing. A desired headword can be searched and selected to display its semantic content.
[0066]
The methods described in the above embodiments, ie, the word search processing of the first embodiment shown in the flowchart of FIG. 2 and the word search processing of the second embodiment shown in the flowchart of FIG. As a program that can be executed, it is stored in an external storage medium 14 such as a memory card (ROM card, RAM card, etc.), magnetic disk (floppy disk, hard disk, etc.), optical disk (CD-ROM, DVD, etc.), semiconductor memory, etc. Can be distributed. The computer reads the program stored in the external storage medium 14 by the storage medium reading unit 15 such as a magnetic disk device, and the operation is controlled by the read program, so that the words described in the above embodiments are used. A search function can be realized, and a headword search display process based on a head and tail match search for a keyword can be executed in the same manner as described above.
[0067]
【The invention's effect】
As described above, the present invention Person in charge Ru Electronic with dictionary function According to the device, when a keyword corresponding to a headword to be searched is input, Dictionary data It is determined whether or not the headwords read from the storage means are completely matched. If it is determined that the headwords are completely matched to the keywords by this perfect match judgment, the headwords are used as search words. Is displayed. On the other hand, if it is determined by the exact match determination that the headword does not completely match the keyword, Dictionary data Among the headwords read from the storage means, the number of matching characters from the top of the keyword is in descending order. Within a predetermined number Headwords in descending order of the number of matching characters from the end Within a predetermined number Headwords, and among the searched headwords, headwords with a large number of matching characters from the beginning When Headwords with many matching characters from the end As one search term list Number of matching characters of Many headwords Sort in order, sorted headwords in order Since it is displayed as a search word, even if there is a slight mistake in the input keyword that is different from the desired headword, the desired headword can be easily searched and displayed.
[0069]
Therefore, according to the present invention, it is possible to easily search for a desired headword even if there is a slight mistake in keywords without requiring a separate dictionary for spell check & collect.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a configuration of a dictionary search device according to an embodiment of an information search device of the present invention.
FIG. 2 is a flowchart showing word search processing of the first embodiment in the dictionary search device.
FIG. 3 is a diagram showing a storage state of a keyword in an input word memory and a head matching search headword memory and a head matching search headword based on the keyword in the word search processing of the first embodiment of the dictionary search device.
FIG. 4 shows a storage state of a keyword in the reverse character string memory and tail match search keyword memory of the input word and the tail match search keyword based on the keyword according to the word search process of the first embodiment of the dictionary search device. FIG.
FIG. 5 is a diagram showing a storage state of a search entry word list in a search word list memory accompanying a word search process of the first embodiment of the dictionary search device.
FIG. 6 is a flowchart showing word search processing of the second embodiment in the dictionary search device.
FIG. 7 is a diagram showing a storage state of a search entry word list in a search word list memory accompanying a word search process of the second embodiment of the dictionary search device.
FIG. 8 is a diagram showing a display state of search headwords in association with word search processing of the second embodiment of the dictionary search device.
[Explanation of symbols]
10 ... dictionary search device,
11: Control unit (CPU),
12 ... input part,
13 ... ROM,
13a ... Dictionary database,
13b ... dictionary search program,
14 ... an external storage medium,
15 ... Storage medium reading unit,
16 ... RAM,
16a: input word memory,
16b: reverse character string memory of input words,
16c ... Search term list memory,
16d ... work area,
16d1 ... first match search entry word memory,
16d2 ... tail match search entry word memory,
17 ... Liquid crystal display part.

Claims (2)

An electronic device having a dictionary function having dictionary data storage means that stores a plurality of headwords and information related to the headwords in association with each other,
An input means for inputting a keyword corresponding to a headword to be searched;
Perfect match judgment means for judging whether or not a headword read from the dictionary data storage means completely matches the keyword input by the input means;
A first search word display means for displaying the headword as a search word when the complete match determination means determines that the headword is completely matched to the keyword;
The number of matching characters from the head of the keyword in the headwords read from the dictionary data storage means when the headword is not completely matched with the keyword by the perfect match judgment means First headword search means for searching for headwords within a predetermined number in descending order;
The number of matching characters from the end of the keyword in the headwords read from the dictionary data storage means when the headword is not completely matched with the keyword by the perfect match judgment means Second headword search means for searching for headwords within a predetermined number in descending order;
One search word list includes a head word having a large number of matching characters from the head searched by the first head word search means and a head word having a large number of matching characters from the end searched by the second head word search means. An electronic device having a dictionary function, characterized by comprising: a second search word display means for sorting in order of head words with a large number of matching characters and displaying the sorted head words as search words in order. A storage medium storing an information retrieval processing program for controlling a computer of an electronic device having a dictionary function having dictionary data storage means for storing a plurality of headwords and information related to each headword There,
The computer,
When a keyword corresponding to a headword to be searched is input, an exact match judging means for judging whether or not the headword read from the dictionary data storage means completely matches the input keyword;
A first search word display means for displaying the headword as a search word when it is determined by the perfect match judgment means that the headword completely matches the keyword;
The number of matching characters from the head of the keyword in the headwords read from the dictionary data storage means when the headword is not completely matched with the keyword by the perfect match judgment means First headword search means for searching for headwords within a predetermined number in descending order;
The number of matching characters from the end of the keyword in the headwords read from the dictionary data storage means when the headword is not completely matched with the keyword by the perfect match judgment means Second headword search means for searching for headwords within a predetermined number in descending order;
One search word list includes a head word having a large number of matching characters from the head searched by the first head word search means and a head word having a large number of matching characters from the end searched by the second head word search means. A storage medium storing a computer-readable information search processing program for functioning as second search word display means for sorting as a search word in descending order of the number of matching characters and displaying as a search word in order from the first head word.

Images