JP2000331023A - Information retrieval device and storage medium with information retrieval processing program stored - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily retrieve a desired entry word regardless of a slight error in a keyword in an information retrieval device which retrieves and displays information corresponding to the entry word. SOLUTION: When an input part 12 is operated to input a keyword corresponding to the desired entry word, the keyword is successively compared with individual entry words in a data base 13a to discriminate it completely coincides with each entry word or not. If there is not any entry word which the keyword completely coincides with, the numbers of characters from the head which coincide with those of the keyword and the numbers of characters from the end which coincide with those of the keyword are counted for individual entry words and are compared, and each entry word is stored in a head coincidence retrieval-entry word memory 16d1 together with its number of coinciding characters if the number of characters from the head which coincide with those of the keyword is large, and each entry word is stored in an end coincidence retrieval entry word memory 16d2 together with its number of coinciding characters if the number of characters from the end which coincide with those of the keyword is large. An entry word of which the number of coinciding characters is largest out of entry words obtained by head coincidence retrieval and end coincidence retrieval is taken as a retrieval entry word and is stored in a retrieval word list memory 16c and is displayed on a liquid crystal display part 17.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is directed to a database such as an English-Japanese dictionary or a Japanese-English dictionary, and stores an information retrieval apparatus and an information retrieval processing program for retrieving and displaying information associated with a headword. It relates to a storage medium.

[0002]

2. Description of the Related Art In recent years, dictionary data such as English-Japanese dictionaries and Japanese-English dictionaries are stored as a database, and by inputting a keyword to be searched as a keyword, a headword matching this keyword is searched. There has been proposed an electronic dictionary device in which the meaning content stored in association with the electronic dictionary is read and displayed.

[0003] In such an electronic dictionary device, various search methods have been considered as a means for searching a database for keywords, but here, four typical data search methods ( 1) to (4) will be described.

(1) Head Match Search Method Searches for a headword having a character string that matches a predetermined number of characters in order from the head character of the input keyword and displays the list, and a desired headword is selected from these. A method to identify and display the meaning content.

(2) Character Number Matching Search Method-Part 1 A method of searching for a headword having the same number of characters as the input keyword and displaying the headwords with the number of matching characters in descending order.

(3) Character Number Matching Search Method-Part 2 A method of searching for a headword having the same number of characters as the input keyword and a headword having a number of characters increased and decreased, and displaying the headwords with the number of matching characters in descending order.

(4) Spell Checking and Correcting Method For each headword in the database, a pseudo headword consisting of a character string that is likely to be mistaken when input as a keyword is also stored together in advance, and matches the input keyword. A method to search for and display headwords.

[0008]

However, the electronic dictionary device provided with such a data search method has the following problems.

(1) In the head match search method, if an erroneous character different from the desired headword is found near the head in the input keyword, it is difficult to search for the desired headword. There is.

(2) Character number match search method-In the first method,
Even if there is an error in the keyword that is partially different from the desired headword in the keyword, it is possible to search for the desired headword if the total number of characters is correct, but the number of characters in the input keyword itself is incorrect in the character string. However, if the number of characters of the desired headword differs from that of the headword, there is a problem that it is difficult to search for the desired headword.

(3) Character number match search method-In the second method,
Although it is possible to search for the desired headword even if the number of characters of the input keyword is slightly different from the number of characters of the desired headword, the number of headwords to be searched becomes extremely large, and the search process takes time. , And the process of determining whether a keyword matches a headword whose number of characters is increasing or decreasing becomes complicated.

(4) In the spell check and correct method, it is possible to search for a desired headword even if the input keyword is slightly wrong, but consideration is made in advance for a common headword mistake. There is a problem that it is necessary to separately provide a dedicated dictionary that stores the pseudo headwords.

SUMMARY OF THE INVENTION The present invention has been made in view of the above problems, and does not require a separate dictionary dedicated to spell checking and correction. It is an object of the present invention to provide an information search device and a storage medium that stores an information search processing program that can be searched.

[0014]

That is, a first information retrieval apparatus according to the present invention has an information retrieval means having information storage means for storing a plurality of headwords and information related to each headword in association with each other. An input unit for inputting a keyword corresponding to a headword to be searched, and determining whether or not the headword read from the information storage unit completely matches the keyword input by the input unit. A first search word display means for displaying the headword as a search word when the headword completely matches the keyword by the perfect match determination means; If it is determined by the perfect match determination means that the headword does not completely match the keyword, the headword read from the information storage means In the middle, with respect to the keyword, and one or more entry words matching the number of characters in descending order from the top
A headword search means for searching for one or more headwords in descending order of the number of matching characters from the end, a second search word display means for displaying the headword searched by the headword search means as a search word, It is characterized by having.

In the first information retrieval apparatus according to the present invention, when a keyword corresponding to a headword to be searched is input, the headword read from the information storage means completely matches the input keyword. It is determined whether or not the headword completely matches the keyword by the perfect match determination.
The headword is displayed as a search word. On the other hand, if it is determined by the perfect match determination that the headword does not completely match the keyword, the keyword from the head of the headword read from the information storage means is matched with the keyword. One or more headwords in descending order of the number of characters and one or more headwords in descending order of the number of matching characters from the end are searched, and the searched headword is displayed as a search word. Therefore, even if there is a slight error that is different from the desired headword, the desired headword can be easily searched and displayed.

Further, a second information retrieval apparatus according to the present invention is the first information retrieval apparatus, wherein the headword search means includes the keyword in the headword read from the information storage means. In response to this, while searching for a headword within a predetermined number in descending order of the number of matching characters from the head, searching for a headword within a predetermined number in descending order of the number of matching characters from the end, the second search word display means, The headwords having a large number of matching characters from the beginning and the headwords having a large number of matching characters from the end searched by the headword searching means are sorted as one search word list in the order of the headwords having a large number of matching characters. A second display control means for displaying as a search word in order from the word is provided.

In the second information retrieval apparatus according to the present invention, among the headwords read out from the information storage means, the headwords within a predetermined number are searched for in the descending order of the number of matching characters from the head. In addition, a predetermined number of headwords are searched in the descending order of the number of matching characters from the end, and one of the searched headwords having the number of matching characters from the beginning and the headword having the number of matching characters from the end is one. The word list is sorted in the order of the headwords with the highest number of matching characters, and displayed as search words in order from the first headword. Therefore, even if there is a slight mistake in the input keyword that is different from the desired headword, it is easy to search for the desired headword. Can be searched and selected and displayed.

[0018]

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of a dictionary search device according to an embodiment of the information search device of the present invention.

The dictionary search device 10 includes a control unit (CPU) 11 which is a computer.

The control section (CPU) 11 is a system program stored in advance in the ROM 13 in response to a key operation signal or the like input from the input section 12 or a search device stored in an external storage medium 14 such as a floppy disk. The control program is started via a storage medium reading unit 15 such as a magnetic disk device, and the RAM 16 is used as a work memory to control the operation of each circuit unit.

The control section (CPU) 11 includes the input section 12, the ROM 13, the storage medium reading section 15, the RAM 16
Is connected, and a liquid crystal display unit 17 is connected.

The input unit 12 is provided with character input keys for inputting arbitrary characters and character strings, such as hiragana and katakana alphabets and numbers. The input unit 12 is used to search English, Japanese, English and Japanese dictionaries. A dictionary selection key for selecting a dictionary database, a "search" key for instructing the start of a search process, a cursor key for moving a cursor on a display screen and specifying a selected data, etc. Can be

The ROM 13 stores in advance a system program for controlling the entire operation of the dictionary retrieval apparatus 10, and stores various dictionary databases 13a, such as English-Japanese dictionaries, Japanese-English dictionaries, and Japanese dictionaries, for each dictionary. And a dictionary search program 13b for searching for a desired entry word based on the dictionary database 13a and displaying its meaning content and the like. The program is stored.

The RAM 16 has an input word memory 16a, a reverse character string memory 16b of the input word, a search word list memory 16
c, a work area 16d is provided.
6d is provided with a head match search entry word memory 16d1 and a tail match search entry word memory 16d2.

The input word memory 16a stores a keyword input by the user according to a headword to be searched.

The keyword stored in the input word memory 16a is stored in the inverted character string memory 16b of the input word as an inverted character string having the character string at the end.

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. You.

The work area 16d has a control unit (CP) according to the device control program stored in the ROM 13.
Various data input / output to / from the U) 11 are temporarily stored and held as needed.

In the head match search entry word memory 16d1,
According to the keyword stored in the input word memory 16a, a headword that sequentially matches from the first character is stored in the RO.
It is searched from the database 13a in M13 and stored together with the number of matching characters. A predetermined number (for example, 12 words) of headwords are selectively stored in descending order of the number of matching characters.

The tail match search entry word memory 16d2 contains:
According to the keyword of the reverse character string stored in the reverse character string memory 16b of the input word, a headword that sequentially matches from the last character is searched from the database 13a in the ROM 13 and stored together with the number of matching characters. Things
A predetermined number (for example, 1
(2 words) are selectively stored.

Next, the operation of the dictionary search apparatus having the above configuration will be described.

FIG. 2 is a flowchart showing a word search process of the first embodiment in the dictionary search device.

FIG. 3 shows the storage states of the keywords in the input word memory 16a and the head match search entry word memory 16d1 associated with the word search processing of the first embodiment of the dictionary search device and the head match search entry words based on the keywords. FIG.

FIG. 4 shows a keyword in the reverse character string memory 16b and a tail match search entry word memory 16d2 of the input word accompanying the word search processing of the first embodiment of the dictionary search device and a tail match search index based on the keyword. It is a figure which shows the storage state of a word.

FIG. 5 is a diagram showing a storage state of a search entry list in the search entry list memory 16c associated with the word search processing of the first embodiment of the dictionary search apparatus.

For example, a database 13a in the ROM 13
In order to search for the desired headword "announce" from the English-Japanese dictionary stored as "" and check the meaning thereof, when the keyword "anaance" is input in the input unit 12 with an incorrect spelling, this input is performed. The keyword “anance” is directly stored in the input word memory 16a in the RAM 16 as shown in FIG. 3A, while the keyword “anaance” is stored in the RAM as shown in FIG.
The input word in the memory 16 is converted into an inverted character string and stored in the inverted character string memory 16b (step S1). And R
The entry word pointing pointer for the database 13a in the OM 13 is set to the first entry word position (step S2).

Then, the first headword indicated by the pointer is taken out from the database 13a in the ROM 13 and whether or not it completely matches each character of the keyword "anaance" stored in the input word memory 16a is determined. Is determined (steps S3 and S4).

Here, the keyword "anaunc"
If it is determined that the first headword in the database 13a does not completely match "e", the number of characters matching from the top of the first headword is counted (step S4 →). S6).

At the same time, the reverse character string keyword "ec" stored in the reverse character string memory 16b of the input word.
nuana ”, the number of matching characters from the end of the first headword is counted (step S).
7).

Then, the keyword “anaunc”
e), for the first headword, the number of matching characters from the beginning and the number of matching characters from the end are compared to determine whether the number of matching characters from the end is greater than the number of matching characters from the beginning. Is performed (step S8).

If it is determined that the number of matching characters from the end to the number of matching characters from the beginning is equal to or less than the number of matching characters from the beginning, the number of matching characters from the head match search headword memory 16d1 in the RAM 16 is stored in, for example, FIG. As shown in (B), the headword searched for the head match is stored together with the number of matching characters (step S8 → S9).

At this time, the head match search entry word memory 16
The number of headwords stored in d1 is a predetermined number (for example, 12
Is determined, and if it is determined that it has been exceeded, the headword with the lowest matching character number is deleted from the headwords of the twelve words stored therein that have been searched for the head match. (Step S10 → S11).

On the other hand, if it is determined in step S8 that the number of matching characters from the end is larger than the number of matching characters from the beginning, the number of matching characters from the end matching search term memory 16d2 in the RAM 16 is, for example, as shown in FIG. As shown in FIG. 4 (B), the headword searched for the end match is stored together with the number of matching characters (step S8 → S13).

At this time, the tail match search entry word memory 16
When the number of headwords stored in d2 is a predetermined number (for example, 12
Is determined to be over, and if it is determined to be over, the headword with the lowest number of matching characters is deleted from the headwords of the twelve words stored therein that have been searched for the end match. (Step S14 → S15).

Then, the database 13 in the ROM 13
The pointer for the headword instruction for a is set to the next headword position, and based on this, it is determined whether or not the same match search has been completed for all headwords in the database 13a. If it is determined that there is no keyword, the process returns to step S3 again, and the matching search process with the keyword “anance” is repeated for the next headword in the database 13a in the same manner as described above (steps S12, S16 → S3). ).

Thus, the input keyword “a”
For example, in the state where the exact match search for each of the headwords sequentially read from the database 13a or the matching search process from the beginning and end is repeated for "nance", for example, it is determined that a certain headword completely matches the keyword. In this case, the database 1 is associated with the headword that completely matches the keyword.
The meaning content stored in 3a is read out and directly displayed on the liquid crystal display unit 17 together with the headword (step S4 → S5).

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 headword that matches from the end are smaller. Are divided into a headword search headword memory 16d1 and a tailword search headword memory 16d2, respectively, and a predetermined number of headwords are searched and stored from the headword whose number of matching characters is large. Thereafter, when it is determined that the similar search and search processing from the beginning and end of all headwords in the database 13a has been completed, each headword searched and stored in the head-match search headword memory 16d1. A headword having the maximum number of characters that match the beginning of the word, and a maximum number of headwords among the headwords searched and stored in the tail match search headword memory 16d2. For a headword of number of matched characters, one of the largest number of matched characters is large or is determined (step S16 → A1).

Here, it is determined that the number of matching characters of the headword having the largest number of matching characters from the end is equal to or less than the number of matching characters of the headword having the largest number of matching characters from the beginning. In this case, 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.
It is stored in the search word list memory 16c in the AM 16 (step A1 → A2).

On the other hand, if it is determined that the number of matching characters of the headword having the largest number of matching characters from the end is larger than the number of matching characters of the headword having the largest number of matching characters from the beginning, The headword having the largest number of matching characters from the end is searched as the headword having the largest 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).

Then, it is determined whether or not there are a plurality of search words stored in the search word list memory 16c in the RAM 16, that is, in step A2 or step A3, the number of characters matching the keyword as a whole in the database 13a is maximum. The presence of a plurality of headwords with the same number of matching characters results in the search word list memory 16c.
If it is determined that a plurality of search words are stored in the search word, the plurality of search words are sorted in alphabetical order and displayed on the liquid crystal display unit 17 as shown in FIG. 5 (steps A4 → A5). , A6).

Then, from the search word list displayed on the liquid crystal display section 17, a desired headword "annown" is displayed.
ce ”, the selected headword“ ann ”
once ”and its meaning are read out from the database 13a in the ROM 13 and are switched and displayed on the liquid crystal display unit 17 (steps A7 and A8).

Therefore, according to the word search function of the first embodiment in the dictionary search apparatus having the above configuration, the input unit 12
Is operated to input a keyword corresponding to a desired headword, it is sequentially determined whether or not each headword in the database 13a is completely matched. The number of matching characters and the number of matching characters from the end are counted and compared. If the number of matching characters at the beginning is large, the number of matching characters is stored together with the number of matching characters in the matching word entry memory 16d1. It is stored in the entry word memory 16d2 together with the number of matching characters. Then, the headword having the maximum number of matching characters among the headwords searched for the head match and the tail words searched for is determined as the search headword, stored in the search word list memory 16c and displayed on the liquid crystal display unit 17. Therefore, even if there are some mistakes, such as the presence of a character different from the desired headword or the number of characters in a part of the input keyword, it is necessary to provide a special database and complicated search processing. In addition, a desired headword can be easily searched and displayed.

Further, according to the word search function of the first embodiment in the dictionary search apparatus having the above-described configuration, the headword having the maximum number of matching characters among the headword searched for the head match and the headword searched for the end match is used. Are present in the search word list memory 16c as a plurality of search headwords in the same number of matching characters, for example, after being sorted in alphabetical order or in alphabetical order, the liquid crystal display 17 Since the list is displayed, even in such a case, a desired headword can be easily selected and its meaning content can be displayed.

In the word search function of the first embodiment, the number of matching characters in the head match search is set to be equal to or more than the number of matching characters in the tail match search, and each heading stored in the head match search headword memory 16d1. It is determined that the number of characters matched by the word and the tail match search is greater than the number of characters matched by the head match search, and the tail match search entry word memory 16d2
Among the headwords stored in the search list memory 16, the headword having the maximum number of matching characters is used as a search headword.
c, and is displayed on the liquid crystal display unit 17. However, as described in the word search function (see FIGS. 6 to 8) of the next second embodiment, the head match search entry word memory 16d1 is stored. Headwords determined to have a large number of head-matched characters and the tail-matching search headword memory 1
The search word list memory 1 uses both the headwords stored in 6d2 and determined to have a large number of tail matching characters as search headwords.
6c, the search entry words may be sorted in descending order of the number of matching characters, and may be further sorted in alphabetical order and displayed from the first search entry word.

FIG. 6 is a flowchart showing a word search process of the second embodiment in the dictionary search device.

FIG. 7 is a diagram showing a storage state of a search entry list in the search entry list memory 16c associated with the word search processing of the second embodiment of the dictionary search apparatus.

FIG. 8 is a diagram showing a display state of a search entry word accompanying the word search processing of the second embodiment of the dictionary search apparatus.

FIG. 6 is a flowchart showing a word search process according to the second embodiment.
Steps having the same processing contents as those in the flowchart showing the word search processing according to the embodiment are denoted by the same step symbols (S1 to S16), and description thereof is omitted.

That is, in accordance with 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. The headwords in the database 13a whose is equal to or greater than the number of matching characters by the tail match search are searched and stored in the head match search headword memory 16d1, and the number of matching characters by the tail match search is the number of matching characters by the head match search. When each headword in the database 13a determined to be more than is searched and stored in the tail match search headword memory 16d2, each headword stored in the head match search headword memory 16d1 and determined to have a large number of head match characters is searched. And each of the headwords determined to have a large number of tail-matching characters stored in the tail-matching search headword memory 16d2. Both are stored in the search term list memory 16c as a search entry word, search headword table is created (step S16 → B1).

Then, the respective headwords obtained by the head match search and the tail match search stored in the form of a table in the search word list memory 16c are, as shown in FIG.
The characters are sorted in descending order of the number of matching characters, and further sorted in alphabetical order within each headword having the same number of matching characters (steps B2 and B3).

Then, a pointer for designating the read display position of the search headword is set to the headword position of the head of each search headword in the sorted search word list memory 16c (step B4).

Then, the head search word corresponding to the set position of the pointer, that is, the earliest search headword "announce" in the alphabet with the maximum number of matching characters for the keyword "anaance" is read from the search word list memory 16c. And a database 13a in the ROM 13 corresponding to the
Is read out and displayed on the liquid crystal display 17 as shown in FIG. 8A (step B).
5).

Here, as shown in FIG. 8B, when the "search" key in the input section 12 is repeatedly operated or the cursor key is operated to instruct the display of the next candidate of the search headword, the pointer is moved. The next search entry word is set at the position of the next search entry word in the search word list memory 16c, and the next search entry word and its meaning are read out and switched and displayed on the liquid crystal display unit 17 (steps B6 → B7, B).
5).

Therefore, according to the word search function of the second embodiment in the dictionary search apparatus having the above configuration, the input unit 12
Is operated to input a keyword corresponding to a desired headword, it is sequentially determined whether or not each headword in the database 13a is completely matched. The number of matching characters and the number of matching characters from the end are counted and compared. If the number of matching characters at the beginning is large, the number of matching characters is stored together with the number of matching characters in the matching word entry memory 16d1. It is stored in the entry word memory 16d2 together with the number of matching characters. Then, each headword stored in the head-match search entry word memory 16d1 that is determined to have a large number of head-match characters, and each headword stored in the tail-match search headword memory 16d2 that is determined to have a large number of tail-match characters. 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, and further sorted in alphabetical order.
7, even if there are some mistakes, such as the presence of a character different from the desired headword or the number of characters in a part of the input keyword, it is necessary to provide a special database or perform complicated search processing. , It is possible to easily search for and select a desired headword and display its meaning.

The techniques described in the above embodiments, that is, 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 by a computer, an external storage medium 14 such as a memory card (ROM card, RAM card, etc.), a magnetic disk (floppy disk, hard disk, etc.), an optical disk (CD-ROM, DVD, etc.), a semiconductor memory, etc. Can be stored and distributed. And
The computer reads the program stored in the external storage medium 14 by a storage medium reading unit 15 such as a magnetic disk device, and the operation is controlled by the read program, whereby the word search function described in each of the above embodiments is performed. And a headword search and display process based on a search for a match between the beginning and end of the keyword can be executed in the same manner as in the above-described method.

[0067]

As described above, according to the first information retrieval apparatus of the present invention, when a keyword corresponding to a headword to be searched is input, the headword read from the information storage means for the input keyword. It is determined whether or not the words completely match. If it is determined by the perfect match determination that the headword completely matches the keyword, the headword is displayed as a search word. On the other hand, when it is determined that the headword does not completely match the keyword by the perfect match determination,
Among the headwords read out from the information storage means, one or more headwords for the keyword in descending order of the number of matching characters from the beginning and one or more headwords in the descending order of the number of matching characters from the end. Since the searched headword is displayed as a search word, even if the input keyword has a slight error different from the desired headword, the desired headword can be easily searched and displayed. Become.

According to the second information retrieval apparatus of the present invention, among the headwords read out from the information storage means, headwords within a predetermined number of keywords in the descending order of the number of matching characters from the head are compared with the keywords. At the same time, the search is performed for a headword within a predetermined number in the order of the number of matching characters from the end, and one of the searched headwords with the number of matching characters from the beginning and the headword with the number of matching characters from the end is one. The search term list is sorted in the order of the headwords with the highest number of matching characters, and displayed as search terms in order from the first headword, so even if there is a slight mistake in the input keyword that is different from the desired headword, A desired headword can be searched and selected and displayed.

Therefore, according to the present invention, it is possible to easily search for a desired entry word even if there is a slight mistake in a keyword, without requiring a separate dictionary dedicated to spell checking and correction. .

[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 a word search process according to the first embodiment in the dictionary search device.

FIG. 3 is a view showing a keyword in an input word memory and a head match search entry word memory associated with a word search process of the first embodiment of the dictionary search device, and a storage state of a head match search entry word based on the keyword;

FIG. 4 shows a storage state of a keyword in a reverse character string memory and a tail match search entry word memory of an input word and a tail match search entry word based on the keyword in the word search processing 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 the word search processing of the first embodiment of the dictionary search device.

FIG. 6 is a flowchart showing a word search process according to 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 an exemplary view showing a display state of a search entry word accompanying a word search process of the second embodiment of the dictionary search device.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 ... Dictionary search device, 11 ... Control part (CPU), 12 ... Input part, 13 ... ROM, 13a ... Dictionary database, 13b ... Dictionary search program, 14 ... External storage medium, 15 ... Storage medium reading part, 16 ... RAM 16a: input word memory, 16b: reverse character string memory of input word, 16c: search word list memory, 16d: work area, 16d1: head match search entry word memory, 16d2: tail match search entry word memory, 17: liquid crystal Display section.

Claims (5)

[Claims] 1. An information retrieval apparatus comprising an information storage unit storing a plurality of headwords and information related to each headword in association with each other, wherein input means for inputting a keyword corresponding to the headword to be searched. Exact match determining means for determining whether or not the headword read from the information storage means completely matches the keyword input by the input means; and If it is determined that the keyword exactly matches the keyword, the first keyword display means for displaying the keyword as a keyword, and the perfect word determination means does not completely match the keyword. If it is determined that
Among the headwords read from the information storage means, for the keyword, one or more headwords in descending order of the number of matching characters from the beginning and one or more headwords in descending order of the number of matching characters from the end. An information search device comprising: a headword search means for searching; and a second search word display means for displaying the headword searched by the headword search means as a search word. 2. The method according to claim 1, wherein the second search word display means has the largest number of matching characters among the headwords searched for by the headword search means with a large number of matching characters from the beginning or a large number of matching characters from the end. 2. The information search device according to claim 1, wherein the headword is displayed as a search word. 3. The display device according to claim 2, wherein the second search word display unit displays a plurality of search words to be displayed when the plurality of headwords are displayed as search words due to a plurality of headwords having the largest number of matching characters. 3. The information retrieval apparatus according to claim 2, further comprising first display control means for sorting and displaying the information. 4. The headword search means searches a headword read from the information storage means for a predetermined number of headwords in descending order of the number of matching characters from the head of the keyword, Search for a headword within a predetermined number in the descending order of the number of matching characters from the headword. The second search word display means matches the headword searched for by the headword search means with a large number of matching characters from the head and the headword. A second method in which headwords with a large number of characters are sorted as one search word list in the order of headwords with a large number of matching characters, and displayed as search words in order from the first headword
2. A display control means according to claim 1.
An information retrieval device according to item 1. 5. A storage medium storing an information search processing program for controlling a computer of an information search device having an information storage means storing a plurality of headwords and information associated with each headword in association with each other. When a keyword corresponding to a headword to be searched is input, the computer determines whether the headword read from the information storage means completely matches the input keyword. A first search term display means for displaying the headword as a search word when the headword is determined to completely match the keyword by the perfect match determination means; If the means determines that the headword does not completely match the keyword,
Among the headwords read from the information storage means, for the keyword, one or more headwords in descending order of the number of matching characters from the beginning and one or more headwords in descending order of the number of matching characters from the end. A storage device storing a computer-readable information search processing program for functioning as a headword search means to be searched; a second search word display means for displaying the headword searched by the headword search means as a search word; Medium.