JPH05314183A - Automatic result correction and retrieval system - Google Patents

Abstract

PURPOSE:To retrieve and display a related key word. CONSTITUTION:Not only a retrieving condition inputted by an input control part 301, but also the retrieving condition obtained by replacing the key word parts of the retrieving condition with words of a higher-rank concept or a lower-rank concept are added to an executing condition, and the number of retrieved results which fulfill the entire conditions is searched and displayed at a display part 308. When the retrieving condition is inputted, not only the inputted condition but also the retrieving condition obtained by replacing the key word parts of the retrieving condition with the words of the higher-rank concept or the lower-rank concept are added to the executing condition, and the number of the retrieved results which fulfill the entire conditions is searched and displayed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a result automatic correction retrieval system for retrieving, for example, documents, newspaper articles and the like according to retrieval conditions in which a plurality of key words input by an operator are combined by a logical operation.

[0002]

2. Description of the Related Art Conventionally, a search device has been provided which displays data matching a search condition input by an operator.
FIG. 8 is a block diagram showing an example of a conventionally used device. In the figure, 101 is an input operation unit and 102
Is a condition storage unit, 103 is a comparison unit, 104 is a database, 105 is a result storage unit, 106 is a counting unit, 107 is a result reading unit, and 108 is a display unit.

The search condition input by the operator from the input operation unit 101 is stored in the search condition storage unit 102, and the comparison unit 103 using the search condition compares the document information accumulated in the database 104 and determines the condition. The identifier of the matching information is stored in the result storage unit 105.

The counting unit 106 counts the number of pieces of information stored in the result storage unit 105, that is, the number of documents and the like that meet the search conditions. After searching all the information in the database, the result of the counting unit 106 is sent to the display unit 108, and the operator is notified of the number of pieces of information matching the search conditions.

The operator decides whether to obtain the entire information retrieved according to the instructed number or to change the retrieval condition so that the number of matching information becomes a more suitable value. When all the information matching the search conditions is to be obtained, the operator instructs the input operation unit 101 so that the result reading unit 10
Reference numeral 7 reads from the database 104 all the information such as documents corresponding to the identification of the information matching the search conditions stored in the result storage unit 105, and displays it on the display unit 108.

FIG. 9 shows an example of retrieval in the conventional system.
Although 201 and 202 are physically one, they are shown as separate figures to explain the temporal results. Two
Reference numeral 04 is a database accumulating document information, 212 and 222 are condition storage units, 213 and 223 are comparison units, 215 and 225 are result storage units, 216 and 2.
26 is a counting unit.

FIG. 9 shows a case where it is desired to search for documents relating to the memory of the personal computer, but it is also considered that the document relating to the memory of the computer, which is a superordinate concept of the personal computer, can also be referred to. When the search condition for the first time is "PC and memory", the number of search results is 2, which is too small. Therefore, the search condition is changed to "computer and memory" and the search is executed again. When the first search condition “personal computer and memory” is stored in the condition storage unit 212 from the input operation unit not shown in FIG. 9, the comparison unit 213 reads the document information from the database 204 and stores it in the condition storage unit 212. The identifier (ID) of the document information that matches the search condition “personal computer and memory” is stored in the result storage unit 215.

The counting unit 216 counts the number of IDs stored in the result storage unit 215. The value of the counting unit 216 is the number of documents satisfying the search condition when the comparing unit 213 finishes comparing all the information in the database 204, and this is displayed on the result display unit (not shown in FIG. 9).

In the database 204, documents with IDs 3 and 7 satisfy the search condition, and the number of results is 2. The operator looks at the value of 2 in the result and changes the search condition to "computer and memory" because the number is small, and tries the search.

The second operation is also 201, the condition storage unit 21.
2, 202 instead of the comparison unit 213, the result storage unit 215, and the counting unit 216, the condition storage unit 222, the comparison unit 223, and the result storage unit 225 are the same as the first time. The second time, the documents with IDs 2, 3, 5, 7, 8, and 9 satisfy the search condition, and the number of results is 7.

The operator repeats the search by changing the search condition until the number of records becomes appropriate. It is possible to search from the beginning with the search condition of "computer and memory", but the number of documents may become too large depending on the documents accumulated in the database. In such a case, the second time "PC And you have to change to the search condition of "and memory".

[0012]

However, in such a conventional system, since the number of search results is obtained and displayed only for the search condition entered by the operator, the operator tries to obtain an appropriate number. It had the problem of having to make mistakes.

The present invention has been made in view of such a situation, and the number of search results is obtained and displayed even for the conditions related to the search conditions input by the operator, and the search conditions are changed for the operator. It gives clues and reduces the number of trials and errors.

[0014]

In order to solve such a problem, the present invention provides a search condition in which a keyword part of the search condition is replaced by a word of a superordinate concept or a subordinate concept in addition to the input search condition. In addition to the execution conditions, the number of cases satisfying all of these conditions is calculated and displayed.

[0015]

Operation: When a search condition is input, in addition to the input condition, a search condition in which the keyword part of the search condition is replaced by a word of a superordinate concept or a subordinate concept is added to the execution condition, and for all these conditions The number of satisfied cases is calculated and displayed.

[0016]

FIG. 1 is a block diagram showing an embodiment of the present invention. In the figure, 301 is an input unit, 302 is a condition storage unit, 303 is a comparison unit, 304 is a database, 305 is a result storage unit, 306 is a counting unit, 307 is a result reading unit, 3
Reference numeral 08 is a display unit, 309 is a condition adding unit, and 310 is a storage device storing a thesaurus.

The search condition input by the operator from the input operation unit 301 is stored in the condition storage unit 302. The condition storage unit 302 does not store the input search conditions as they are, but stores them by dividing them into a plurality of keywords and logical expressions. The condition storage unit 302 sends a plurality of keywords to the condition adding unit 309. The condition adding unit 309 obtains a superordinate conceptual word and a subordinate conceptual word of each keyword by the thesaurus stored in the storage device 310, and sends them to the condition storage unit 302.

The condition storage unit 302 uses a keyword extracted from a search condition input by the operator as a main keyword, and a superordinate conceptual word and a subordinate conceptual word sent from the condition adding unit 309 as sub-keywords to form a logical expression. Created by applying all the main / sub keywords as a search condition at the time of execution. The main search conditions are those that all use the main keyword, and the sub search conditions are those that include one or more sub-keywords.

Further, the condition storage unit 302 corresponds to each search condition, and sets “1” if there is any main / sub keyword and “0” if there is no keyword, and connects all the keywords. Create a result pattern and store it together.

The comparison unit 303 compares the database 304 with all the primary and secondary keywords stored in the read condition storage unit 302 and creates a result pattern. Furthermore, the comparison unit 3
Reference numeral 03 stores an identifier (ID) and a result pattern in the result storage unit 305 for those that match the result pattern stored in the condition storage unit 302. ID in the result storage unit 305
And the result pattern are stored as a pair.

The counting unit 306 counts the number of IDs and result patterns stored in the result storage unit 305 for each search condition stored in the condition storage unit 302. The value of the counting unit 306 at the time when the comparison unit 303 finishes comparing all the information in the database 304 is the number of documents satisfying the search condition and the number of documents satisfying the condition related to the search condition. The result is displayed on the result display unit 308.

The operator can know the number of cases that match the main search condition that he has entered and the related sub-search condition. The operator examines the number of cases that match these plural search conditions, selects the search condition that is judged to be the most suitable, and gives the input operation unit 301 an instruction to obtain all information such as documents that match the search conditions.

As a result, the result reading unit 307 reads from the database 304 all information such as documents corresponding to the identifier of the information matching the selected search condition stored in the result storage unit 305, and displays it on the display unit 308. ..

2 to 6 show the internal state of each part of FIG. The condition adding unit 302 does not store the input search condition “PC and memory” as it is, but divides it into key 1 “PC” and key 2 “memory”, and logical expressions <key 1> and <key 2>. Store. The condition storage unit 302 sends the key 1 “personal computer” and the key 2 “memory” to the condition adding unit 309.

The condition adding unit 309 uses the thesaurus stored in the storage device 310 to specify a superordinate concept "computer" of the "personal computer" and a subordinate concept "notebook personal computer", ... A superordinate concept “storage device” and a subordinate concept word “EMS” memory are obtained, and these are returned to the condition storage unit 302.

In the condition storage unit 302, the keys 1 are "personal computer", "computer", "notebook personal computer, ...
-Create all combinations of "memory", "storage device", "EMS memory", ... As key 2 and create respective result patterns. In the result pattern, 1 indicates that there is a keyword, 0 indicates that there is no keyword, and X indicates whether or not there is a keyword.

The comparison unit 303 compares the database 304 with all the primary and secondary keywords stored in the read condition storage unit 302, and creates a result pattern. Furthermore, the comparison unit 3
03 stores the identifier (ID) and the result pattern in the result storage unit 305 for the one that matches the result pattern stored in the condition storage unit 302.

In this case, the result pattern in the condition storage section is X.
The part of matches with both 1 and 0. Result storage unit 305
Then, the ID and the result pattern are finally stored. The counting unit 306 counts the conditions of the ID and the result pattern stored in the result storage unit 305 for each search condition stored in the condition storage unit 302. The comparison unit 303 is the database 304
After the comparison of all the information in (3), the value of the counting unit 306 is the number of documents satisfying the search condition and the number of documents satisfying the condition related to the search condition, and this is displayed in the result display unit (not shown).

In the database 304, it can be seen that the entered search condition "personal computer and memory" satisfies two cases and the related condition "computer and memory" satisfies seven cases. Also, other conditions are known. In this way, not only the search condition entered by the operator but also the related search condition are searched at the same time, so that the operator can reduce the number of trial and error of changing the search condition.

[0030]

As described above, according to the present invention, in addition to the search condition input by the operator, the number of search results can be obtained even with the search condition replaced with a word of a superordinate concept or a subordinate concept by a thesaurus or the like. Since it is possible to display and give the operator a clue to change the search condition, there is an effect that the number of trials and errors of changing the search condition by the operator when an appropriate condition cannot be obtained can be reduced.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

FIG. 2 is a diagram showing an internal structure of a condition storage unit 302 in FIG.

FIG. 3 is a diagram showing an internal structure of a database 304 in FIG.

FIG. 4 is a diagram showing an internal structure of a result storage unit 305 in FIG.

5 is a diagram showing an internal structure of a counting unit 306 in FIG.

6 is a diagram showing an internal structure of a condition adding unit 309 in FIG.

7 is a diagram showing an internal structure of a thesaurus (storage unit) 310 in FIG.

FIG. 8 is a diagram showing an example of a conventional device.

9 is a diagram showing details of the inside of FIG.

[Explanation of symbols]

 301 Input Operation Unit 302 Condition Storage Unit 303 Comparison Unit 304 Database 305 Result Storage Unit 306 Counting Unit 307 Result Reading Unit 308 Display Unit 309 Condition Storage Unit 310 Storage Unit (Thesaurus)

Claims (1)

[Claims] 1. An information retrieval system for conducting a search according to a search condition in which a plurality of search key words are combined by a logical operation. In addition to the input search condition, the keyword part of the search condition is defined by a word of a superordinate concept or a subordinate concept. A result automatic correction search system characterized in that the replaced search conditions are added to the execution conditions, and the number of cases satisfying all of these conditions is calculated and displayed.