JP6790942B2 - Search support program, search support device and search support method - Google Patents

Description

The present invention relates to a search support program and the like.

A computer uses a search engine to search a large amount of information for information including a target keyword. For example, when a computer sends a keyword input from a search window of a browser to a search engine, the computer receives a search target searched by the search engine using the keyword. As a search engine in recent years, for example, a search engine of Google (registered trademark) or Yahoo (registered trademark) is often used.

Further, a search system that executes information retrieval based on a plurality of combinations of search conditions is disclosed. (See, for example, Patent Document 3). Such a search system has a search device and an interface. The interface receives multidimensional data that specifies search conditions from the user, generates a plurality of combinations of search conditions from the multidimensional data, and gives them to the search device. Then, the interface receives a plurality of search results from the search engine in the search device, selects necessary data as output information, and outputs the selected data in the form of multidimensional data. The multidimensional data referred to here includes, for example, a search target period, a search target database, and keywords included in a document.

Japanese Unexamined Patent Publication No. 2013-3727 JP-A-11-296537 Japanese Unexamined Patent Publication No. 2000-315206

However, the conventional information retrieval has a problem that the process of narrowing down the target search target is complicated.

For example, in information retrieval by a search engine in recent years, a user determines whether or not the search target is the target search target by browsing the search target displayed in the search result list. The process of narrowing down is complicated.

Further, in the conventional search system, information retrieval is performed based on a plurality of combinations of search conditions, but it is necessary for the user to input multidimensional data for specifying the search conditions. If the multidimensional data for which the search conditions are specified is accurately determined, the target search target can be narrowed down by inputting the determined multidimensional data. However, since the multidimensional data that specifies the search conditions is rarely determined accurately, it is necessary to input various multidimensional data, and the process of narrowing down the target search target becomes complicated. Is expected.

In one aspect, the purpose of information retrieval is to easily narrow down the target search target.

In one embodiment, the search support program presents the computer with a first set of search results searched based on the search conditions, and designates at least one search result from the first set of the presented search results. Is accepted, and the similarity between the search results included in the second set of search results searched based on the predetermined search conditions obtained from the specified search results and the specified search results is calculated. A process of sorting the search results included in the second set based on the calculated similarity and presenting the sorted search results is executed.

According to one aspect, the target search target can be easily narrowed down in relation to the information retrieval.

FIG. 1 is a functional block diagram showing a configuration of a search support device according to an embodiment. FIG. 2 is a diagram showing an example of the data structure of the search management table according to the embodiment. FIG. 3 is a diagram showing an example of the data structure of the search keyword management table according to the embodiment. FIG. 4 is a diagram showing an example of the data structure of the time designation keyword management table according to the embodiment. FIG. 5 is a diagram showing an example of the data structure of the search result management table according to the embodiment. FIG. 6 is a diagram showing an example of the data structure of the syntax analysis result management table according to the embodiment. FIG. 7 is a diagram showing an example of the data structure of the display order management table according to the embodiment. FIG. 8 is a diagram showing an example of a re-search screen according to the embodiment. FIG. 9A is a diagram (1) showing an example of the flow of the search support process according to the embodiment. FIG. 9B is a diagram (2) showing an example of the flow of the search support process according to the embodiment. FIG. 10A is a diagram (1) showing an example of the flow of the re-search support process according to the embodiment. FIG. 10B is a diagram (2) showing an example of the flow of the re-search support process according to the embodiment. FIG. 11 is a diagram showing an example of a flowchart of the search keyword analysis unit according to the embodiment. FIG. 12 is a diagram showing an example of a flowchart of the search result narrowing-down unit according to the embodiment. FIG. 13 is a diagram showing an example of a flowchart of the search result analysis unit according to the embodiment. FIG. 14 is a diagram showing an example of a flowchart of the search result display order changing unit according to the embodiment. FIG. 15 is a diagram showing an example of a flowchart of the search result graphing unit according to the embodiment. FIG. 16 is a diagram showing an example of a flowchart of the re-search unit according to the embodiment. FIG. 17 is a diagram showing an example of a computer that executes a search support program.

Hereinafter, examples of the search support program, the search support device, and the search support method disclosed in the present application will be described in detail with reference to the drawings. The present invention is not limited to the examples.

[Configuration of search support device]
FIG. 1 is a functional block diagram showing a configuration of a search support device according to an embodiment. The search support device 1 shown in FIG. 1 realizes search support by a method of adding in to the search process of the search engine 90 used in the existing search service system 9. Examples of the search engine 90 referred to here include a Google (registered trademark) search engine and a Yahoo (registered trademark) search engine. When inputting the search condition, the search support device 1 accepts the search condition in which the priority of the search keyword and the search target period are input in addition to the keyword (referred to as the search keyword) used in the search. The search support device 1 narrows down the target search results based on the priority and the search target period included in the search conditions from the search results searched by using the search keyword included in the search conditions as a key, and the first of the narrowed down search results. Present a set of to the user. Then, when the search support device 1 receives the designation of at least one search result from the first set of the presented search results, the search support device 1 performs the following processing. That is, the search support device 1 calculates the degree of similarity between the search result included in the second set of search results searched by the predetermined search keyword obtained from the designated search result and the designated search result. Then, the search support device 1 sorts the search results included in the second set based on the calculated similarity, and presents the sorted search results.

The search support device 1 has a control unit 10 and a storage unit 20. The control unit 10 corresponds to an electronic circuit such as a CPU (Central Processing Unit). The control unit 10 has an internal memory for storing programs and control data that define various processing procedures, and executes various processing by these. The control unit 10 includes a search keyword analysis unit 11, a search engine execution unit 12, a search result narrowing unit 13, a search result analysis unit 14, a search result display order changing unit 15, a search result graphing unit 16, and a research unit 17. .. The search result display order changing unit 15 is an example of the first presentation unit. The re-search unit 17 is an example of a reception unit, a calculation unit, a sort unit, and a second presentation unit.

The storage unit 20 is, for example, a semiconductor memory element such as a RAM or a flash memory, or a storage device such as a hard disk or an optical disk. The storage unit 20 has a search management table 21, a search keyword management table 22, a time-designated keyword management table 23, a search result management table 24, a parsing result management table 25, and a display order management table 26.

The search management table 21 is a table that manages an identifier that uniquely identifies a search. Here, an example of the data structure of the search management table 21 will be described with reference to FIG.

FIG. 2 is a diagram showing an example of the data structure of the search management table according to the embodiment. As shown in FIG. 2, the search management table 21 stores the user identifier 21a, the execution time 21b, and the search ID (Identifier) 21c in association with each other. The user identifier 21a is an identifier that uniquely identifies the user who requested the search. The execution time 21b is the execution time of the search. The search ID 21c is an identifier that uniquely identifies the search. As an example, when the user identifier 21a is "user1", the execution time 21b is stored as "yy / mm / dd hh: mm: ss", and the search ID 21c is stored as "10".

Returning to FIG. 1, the search keyword management table 22 manages search keywords for each search ID. Here, an example of the data structure of the search keyword management table 22 will be described with reference to FIG.

FIG. 3 is a diagram showing an example of the data structure of the search keyword management table according to the embodiment. As shown in FIG. 3, the search keyword management table 22 stores the search ID 22a, the priority order 22b, and the search keyword 22c in association with each other. The search ID 22a is an identifier that uniquely identifies the search. The priority order 22b indicates the priority order of the search keyword set together with the search keyword when a plurality of search keywords are specified. The search keyword 22c indicates a character string of the search keyword. The character string of the search keyword indicates, for example, a phrase.

As an example, when the search ID 22a is "10", the priority 22b is stored as "1" and the search keyword 22c is stored as "word A". It is stored as "2" as the priority order 22b and "word C" as the search keyword 22c. "3" is stored as the priority order 22b, and "word B" is stored as the search keyword 22c.

Returning to FIG. 1, the time-designated keyword management table 23 manages the time-designated keywords for each search ID. Timed keywords indicate the range of dates described in the document. That is, the keyword for specifying the time represents the search target period. Here, an example of the data structure of the time designation keyword management table 23 will be described with reference to FIG.

FIG. 4 is a diagram showing an example of the data structure of the time designation keyword management table according to the embodiment. As shown in FIG. 4, the time designation keyword management table 23 stores the search ID 23a, the start 23b, and the end 23c in association with each other. The search ID 23a is an identifier that uniquely identifies the search. The start 23b indicates a start time point of the search target. The end 23c indicates the end time of the search target.

As an example, when the search ID 23a is "10", "-5 days" is stored as the start 23b and "current time" is stored as the end 23c. "-5 days" means a time 5 days before the current time. It is stored as "current time" as the end 23c.

Returning to FIG. 1, the search result management table 24 manages the URL (uniform resource locator) and the update time of the search result for each search ID. Here, an example of the data structure of the search result management table 24 will be described with reference to FIG.

FIG. 5 is a diagram showing an example of the data structure of the search result management table according to the embodiment. As shown in FIG. 5, the search result management table 24 stores the search ID 24a, the search result No. 24b, the URL 24c, and the update time 24d in association with each other. The search ID 24a is an identifier that uniquely identifies the search. The search result No. 24b is a serial number of the search result. URL24c is the URL of the search result. The update time 24d is the update time of the search result.

As an example, when the search ID 24a is "10", the search result No. 24b is "1", the URL 24c is "http://www.xxxxxxxa.co.jp/", and the update time is "yy / mm / dd hh:". I remember "mm: ss". The search result No. 24b is stored as "2", the URL 24c is stored as "http://www.xxxxxxxb.co.jp/", and the update time 24d is stored as "yy / mm / dd hh: mm: ss".

Returning to FIG. 1, the parsing result management table 25 manages the number of occurrences of words whose parsing is syntactically analyzed for each search result. Here, an example of the data structure of the parsing result management table 25 will be described with reference to FIG.

FIG. 6 is a diagram showing an example of the data structure of the syntax analysis result management table according to the embodiment. As shown in FIG. 6, the syntax analysis result management table 25 stores the search ID 25a, the search result No. 25b, the phrase No. 25c, the number of occurrences 25d, and the phrase 25e in association with each other. The search ID 25a is an identifier that uniquely identifies the search. The search result No. 25b is a serial number of the search result. The phrase No. 25c is a serial number of the phrase. The number of occurrences 25d indicates the number of words and phrases included in the search result. The word 25e indicates a character string of the word.

As an example, when the search ID 25a is "10", the search result No. 25b is stored as "1", the phrase No. 25c is stored as "1", the number of occurrences is 25d as "10", and the phrase 25e is stored as "word A". The search result No. 25b is stored as "1", the phrase No. 25c is stored as "2", the number of occurrences is 25d as "8", and the phrase 25e is stored as "word B".

Returning to FIG. 1, the display order management table 26 manages the display order of the search results for each search ID. Here, an example of the data structure of the display order management table 26 will be described with reference to FIG. 7.

FIG. 7 is a diagram showing an example of the data structure of the display order management table according to the embodiment. As shown in FIG. 7, the display order management table 26 stores the search ID 26a, the search result No. 26b, the display order 26c, and the correlation coefficient 26d in association with each other. The search ID 26a is an identifier that uniquely identifies the search. The search result No. 26b is a serial number of the search result. The display order 26c is the display order of the search results. The correlation coefficient 26d is a coefficient representing the correlation between the search result and the reference search result. The correlation coefficient 26d is used at the time of re-search.

As an example, when the search ID 26a is "10", the search result No. 26b is stored as "2", the display order 26c is stored as "1", and the correlation coefficient 26d is stored as "". The search result No. 26b is stored as "3", the display order 26c is stored as "2", and the correlation coefficient 26d is stored as "".

Returning to FIG. 1, the search keyword analysis unit 11 analyzes the search keyword. For example, when the search keyword analysis unit 11 receives the search keyword specified by the user, it determines whether or not the priority is specified for the search keyword. When a priority is specified for the search keyword, the search keyword analysis unit 11 extracts the priority from the search keyword. In addition, the search keyword analysis unit 11 determines whether or not a keyword with a time designation is specified as the search keyword. When the time-specified keyword is specified in the search keyword, the search keyword analysis unit 11 extracts the time-specified keyword from the search keyword. Then, the search keyword analysis unit 11 requests the start and end of the search target period based on the current time from the keyword specified by the time. Further, the search keyword analysis unit 11 stores the retrieved search keyword and priority information in the search keyword management table 22, and stores the retrieved time-designated keyword information in the time-designated keyword management table 23. The keyword for specifying the time may or may not be specified. That is, the keyword for specifying the time may be any specification.

The search engine execution unit 12 executes the search engine. For example, the search engine execution unit 12 excludes the priority order and the time designation from the search keywords of the result analyzed by the search keyword analysis unit 11. Then, the search engine execution unit 12 delivers the search keyword of the excluded result to the search engine 90 and executes the search engine 90.

The search result narrowing unit 13 narrows down the search results executed by the search engine 90. For example, the search result narrowing unit 13 excludes search results that do not match the time designation when a keyword with a time designation is specified for the search keyword designated by the user. As an example, the search result narrowing unit 13 extracts the target URL from the search result, accesses the content of the search result based on the extracted URL, and acquires the update time of the content of the search result. Then, when the acquired update time does not match the time designation, the search result narrowing unit 13 excludes the search results that do not match. Then, when the acquired update time matches the time designation, the search result narrowing unit 13 stores the matching search result in the search result management table 24.

The search result analysis unit 14 parses the search result. For example, the search result analysis unit 14 parses the contents of the search results narrowed down by the search result narrowing unit 13. For the parsing process, an existing parsing system such as MeCab or KNP may be used. Then, the search result analysis unit 14 stores the phrase and the number of occurrences in the syntax analysis result management table 25 in association with each other based on the analysis result. The phrase referred to here includes a single phrase and a phrase that is a combination of phrases. Then, the search result analysis unit 14 performs a search result analysis process for all the narrowed down search results.

The search result display order changing unit 15 changes the display order of the narrowed down search results based on the search keyword, the priority order, and the syntactic analysis result. For example, the search result display order changing unit 15 refers to the parsing result management table 25 for the search results stored in the search result management table 24, and displays the search results in descending order of the number of occurrences of the search keywords indicating the highest priority. Change the order. When the number of appearances is the same, the search result display order changing unit 15 changes the display order in descending order of the number of appearances of the search keyword having the next highest priority. Then, if the number of appearances is the same even if the display order is changed for all the priority search keywords, the search result display order changing unit 15 changes the display order in the new order of the update time 24d. Then, the search result display order changing unit 15 stores the search result and the display order in the display order management table 26 in association with each other.

Further, the search result display order changing unit 15 presents to the user a list of search results in which the display order is rearranged.

The search result graphing unit 16 graphs the search results specified by the user. For example, when the search result graphing unit 16 receives the designation of the search result moused over by the user, the search result graphing unit 16 refers to the parsing result management table 25 and graphs the number of occurrences for each word of the search result for which the designation is accepted. .. When graphing, the search result graphing unit 16 changes the color of the graph based on whether or not the phrase includes a search keyword. The mouse over here means an operation of hovering the mouse cursor over the target search result from the list of search results.

In addition, the search result graphing unit 16 presents to the user a graph generated from the search results designated by the user by mouse over.

The re-search unit 17 re-searches based on a predetermined search condition obtained from the search result specified by the user.

For example, when the re-search unit 17 receives the designation of the search result clicked by the mouse from the user, the re-search unit 17 displays a re-search screen including the information graphed by the search result graphing unit 16. The re-search screen contains check boxes that are used when the user reselects a search keyword. The re-search unit 17 extracts a phrase for which a check box has been selected from the re-search screen, and the search engine execution unit 12 executes the search engine 90 using the extracted phrase as a new search keyword. The mouse click here means an operation of hovering the mouse cursor over the target search result from the list of search results and clicking.

In addition, the re-search unit 17 performs processing by the search result narrowing unit 13 and processing by the search result analysis unit 14 on the search results searched by the new search keyword.

Further, the re-search unit 17 calculates the degree of similarity between the search result analyzed by the search result analysis unit 14 and the search result (re-search source) that has received the designation. As an example, the re-search unit 17 refers to the parsing result management table 25 and acquires the number of occurrences for the new search keyword of the re-search source. The re-search unit 17 refers to the syntax analysis result management table 25, and acquires the number of occurrences of a new search keyword in the search result analyzed by the search result analysis unit 14. Then, the re-search unit 17 calculates the correlation coefficient between the number of appearances for the new search keyword in the search result and the number of appearances for the new search keyword of the re-search source for each analyzed search result. That is, the re-search unit 17 expresses the similarity of the appearance number pattern with respect to the new search keyword of the re-search source by using the correlation coefficient.

In addition, the re-search unit 17 sorts the search results in descending order of positive correlation coefficient. That is, the re-search unit 17 ranks the display order of the search results having a pattern similar to the pattern of the number of appearances for the new search keyword of the re-search source. Then, the re-search unit 17 presents the search results arranged in the display order to the user. Although the similarity has been described as a correlation coefficient, it is not limited to this. That is, it may be a predetermined coefficient that can calculate the similarity between the patterns of the number of appearances for the new search keyword.

[Example of screen for re-search]
FIG. 8 is a diagram showing an example of a re-search screen according to the embodiment. It is assumed that the re-search unit 17 accepts the search result No. "2" as the designation of the search result clicked by the mouse by the user.

As shown in FIG. 8, when the re-search unit 17 receives the search result No. "2", the re-search unit 17 displays a re-search screen including the information graphed by the search result graphing unit 16. Here, "2" is displayed as the search result No. and "YYYY / MM / DD HH: MM: SS" is displayed as the update time on the re-search screen. In addition, a graph of the number of occurrences for the parsed words is displayed. Also, a checkbox used to reselect a phrase as a search keyword is displayed. As an example, the check boxes of the phrase B, the phrase C, the phrase H, the phrase B + E, the phrase B + C, and the phrase E + H are selected. The phrase for which the check box is selected is set as a new search keyword.

Then, when the re-search button is pressed, the re-search unit 17 re-searches with a new search keyword obtained from the re-search source (search result No. "2"). Then, the re-search unit 17 displays the search results having a pattern similar to the pattern of the number of appearances for the new search keyword of the re-search source at the top. That is, the re-search unit 17 performs a pattern similar to the pattern of 16 cases of word B, 12 cases of word C, 7 cases of word H, 10 cases of word B + E, 8 cases of word B + C, and 6 cases of word E + H. Display the search results you have at the top.

[Example of search support processing flow]
9A and 9B are diagrams showing an example of the flow of the search support process according to the embodiment. FIG. 9A describes the processes from the search keyword analysis unit 11 to the search result analysis unit 14. FIG. 9B describes the processes from the search result display order changing unit 15 to the search result graphing unit 16.

As shown in FIG. 9A, when the search keyword analysis unit 11 receives the search keyword k1 designated by the user (S101), the search keyword analysis unit 11 analyzes the search keyword k1 (S102). Here, the search keyword k1 specified by the user is "1> phrase A 3> phrase B 2> phrase C". That is, in the search keyword k1, "word A" having a priority of "1", "word B" having a priority of "3", and "word C" having a priority of "2" are designated as search keywords. ing. In the search keyword k1, "-5 days to" indicating the current time from the time 5 days ago is specified as the keyword for specifying the time.

The search keyword analysis unit 11 stores the search keyword and priority information as the analysis result <1> in the search keyword management table 22 (S103). The search keyword analysis unit 11 stores the information of the time-designated keyword in the time-designated keyword management table 23. Here, the search keyword management table 22 stores "word A" as the search keyword 22c when the priority order 22b is "1". When the priority order 22b is "2", the search keyword 22c is stored as "word C". When the priority order 22b is "3", the search keyword 22c is stored as "word B". The time designation keyword management table 23 stores that the start 23b is "-5 days" and the end 23c is "current time".

Next, the search engine execution unit 12 excludes the priority and the time designation from the search keyword k1. Here, the search keyword k2 as the result of exclusion is "word A word phrase B word phrase C". The search engine execution unit 12 delivers the excluded result search keyword k2 to the search engine 90 and executes the search engine 90 (S104).

Next, the search result narrowing unit 13 narrows down the search results executed by the search engine 90 using a keyword at a specified time (S105). Here, the search result narrowing-down unit 13 acquires search results that match the time-designated keyword “-5 days ~”. Then, the search result narrowing unit 13 stores the acquired search result as the analysis result <2> in the search result management table 24. Here, the search result management table 24 stores the URL 24c and the update time 24d when the search result No. 24b is “1”. The URL 24c and the update time 24d when the search result No. 24b is "2" are stored. The URL 24c and the update time 24d when the search result No. 24b is "3" are stored.

Next, the search result analysis unit 14 parses the narrowed down search results (S106). Then, the search result analysis unit 14 stores the syntax analysis result in the syntax analysis result management table 25 for each search result. Here, the parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “1” as follows. The number of appearances of "word A" is "10", the number of appearances of "word B" is "8", the number of appearances of "word C" is "3", and the number of appearances of "word D" is 25d. Is memorized as "2 cases". The parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “2” as follows. The number of appearances of "word A" is "10", the number of appearances of "word B" is "7", the number of appearances of "word C" is "6", and the number of appearances of "word E" is 25d. Is memorized as "4 cases". The parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “3” as follows. The number of appearances of "word A" is "10", the number of appearances of "word B" is "7", the number of appearances of "word C" is "4", and the number of appearances of "word F" is 25d. Is memorized as "7 cases".

As shown in FIG. 9B, the search result display order changing unit 15 changes the display order of the parsed search results based on the search keywords and priorities included in the analysis result <1> and the parsed results ( S107). The search keywords and priorities included in the analysis result <1> are stored in the search keyword management table 22. Here, the search keyword management table 22 stores "word A" as the search keyword 22c when the priority order 22b is "1". When the priority order 22b is "2", the search keyword 22c is stored as "word C". When the priority order 22b is "3", the search keyword 22c is stored as "word B". Therefore, the search result display order changing unit 15 refers to the parsing result management table 25 for the search results stored in the search result management table 24, and the number of occurrences of the search keyword “word A” indicating the highest priority. Change the display order in descending order of. Here, the number of appearances 25d of the "word A" in which the search result No. 25b is "1", "2", and "3" is "10". Therefore, the search result display order changing unit 15 changes the display order in descending order of the number of occurrences of the search keyword “word C” indicating the next order of priority. Here, with respect to the number of occurrences of "word C" 25d, the search result No25b "1" is "3", the search result No25b "2" is "6", and the search result No25b "3" is "4". Since it is "case", the display order is "2", "3", and "1" as the search result No. 26b.

Then, the search result display order changing unit 15 stores the search result No. and the display order in the display order management table 26 in association with each other (S108).

Then, the search result display order changing unit 15 presents the search result list in which the display order is rearranged to the user (S109). Here, as indicated by reference numeral D1, the search result list displays information on each search result in the order of search result No. 2, search result No. 3, and search result No. 1.

Next, it is assumed that the user positions (mouse over) any of the search result lists with the mouse (S110). Here, it is assumed that the user mouses over the search result No. 2. Then, the search result graphing unit 16 acquires the mouse-over search result No. Then, the search result graphing unit 16 refers to the syntax analysis result management table 25 and graphs the number of occurrences for each word of the search result indicated by the acquired search result No. (S111). Here, as indicated by reference numeral D2, the search result graph of the search result No. 2 is displayed.

[Example of re-search support processing flow]
10A and 10B are diagrams showing an example of the flow of the re-search support process according to the embodiment.

As shown in FIG. 10A, it is assumed that the user positions any one of the search result lists with the mouse and clicks (mouse clicks) (S201). Here, it is assumed that the user clicks the mouse on the search result No. 2. Then, the re-search unit 17 displays a re-search screen including the search result graph of the search result No. 2 graphed by the search result graphing unit 16. Here, as indicated by reference numeral D3, a check box is arranged next to the phrase together with the search result graph of the search result No2. It is assumed that all the check boxes are specified as selected in the initial display. Further, for convenience, the search result No. 2 is referred to as a "research source".

Here, in order to select the search keyword, the user specifies the check boxes of the words to be excluded as the search keyword without selecting (S202). Here, "word A", "word C", and "word E" are selected as search keywords.

Then, when the re-search button is pressed (S203), the re-search unit 17 sets the phrase selected in the phrase of the search result No. 2 as the search keyword k2 (S204) and searches again (S205). That is, the re-search unit 17 executes the search engine 90 by the search engine execution unit 12 with the search keyword k2 as “word A word phrase C word phrase E” (S206).

Next, the re-search unit 17 performs processing by the search result narrowing-down unit 13. That is, the search result narrowing unit 13 narrows down the search results executed by the search engine 90 using a keyword at a specified time (S207). Here, the search result narrowing-down unit 13 acquires search results that match the time-designated keyword “-5 days ~”. Then, the search result narrowing unit 13 stores the acquired search result as the analysis result <2> in the search result management table 24. Here, the search result management table 24 stores the URL 24c and the update time 24d when the search result No. 24b is “1”. The URL 24c and the update time 24d when the search result No. 24b is "2" are stored. The URL 24c and the update time 24d when the search result No. 24b is "3" are stored. The URL 24c and the update time 24d when the search result No. 24b is "4" are stored.

Next, the re-search unit 17 performs processing by the search result analysis unit 14. That is, the search result analysis unit 14 parses the narrowed down search results (S208). Then, the search result analysis unit 14 stores the syntax analysis result in the syntax analysis result management table 25 for each search result. Here, the parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “1” as follows. The number of appearances of "word A" is "5", the number of appearances of "word B" is "2", the number of appearances of "word C" is "8", and the number of appearances of "word E" is 25d. Is memorized as "3 cases". The parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “2” as follows. The number of appearances of "word A" is "6", the number of appearances of "word C" is "7", the number of appearances of "word E" is "6", and the number of appearances of "word G" is 25d. Is memorized as "4 cases". The parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “3” as follows. The number of appearances of "word A" is "8", the number of appearances of "word C" is "6", the number of appearances of "word E" is "5", and the number of appearances of "word F" is 25d. Is memorized as "4 cases". The parsing result management table 25 stores the phrase 25e and the number of occurrences 25d when the search result No. 25b is “4” as follows. The appearance number 25d of "word A" is stored as "10 cases", the appearance number 25d of "word C" is stored as "6 cases", and the appearance number 25d of "word E" is stored as "4 cases".

As shown in FIG. 10B, the re-search unit 17 has a correlation between the number of appearances for the search keyword of the re-search source and the number of appearances for each search result of the parsing result analyzed by the search result analysis unit 14. Calculate the number (S209). Here, the search keyword is "word A word phrase C word phrase E". Regarding the re-search source, the number of occurrences for the search keyword "word A" is "10". The number of occurrences for the search keyword "word C" is "6", and the number of occurrences for the search keyword "word E" is "4". On the other hand, regarding the search result No. "1" of the parsing result, the number of occurrences for the search keyword "word A" is "5", and the number of occurrences for the search keyword "word C" is "8". , The number of occurrences for the search keyword "word E" is "3". Regarding the search result No. "2" of the parsing result, the number of occurrences for the search keyword "word A" is "6", the number of occurrences for the search keyword "word C" is "7", and the search keyword "word" The number of appearances for "E" is "6". Regarding the search result No. "3" of the parsing result, the number of occurrences for the search keyword "word A" is "8". The number of occurrences for the search keyword "word C" is "6", and the number of occurrences for the search keyword "word E" is "5". Regarding the search result No. "4" of the parsing result, the number of occurrences for the search keyword "word A" is "10", the number of occurrences for the search keyword "word C" is "6", and the search keyword "word" The number of appearances for "E" is "4". Therefore, the re-search unit 17 calculates the correlation coefficient between the re-search source and the search result No. “1” of the syntactic analysis result as “0.59”. The re-search unit 17 calculates the correlation coefficient between the re-search source and the search result No. “2” of the syntactic analysis result as “0.59”. The re-search unit 17 calculates the correlation coefficient between the re-search source and the search result No. “3” of the syntactic analysis result as “0.65”. The re-search unit 17 calculates the correlation coefficient between the re-search source and the search result No. “4” of the syntactic analysis result as “1.00”. The search result No. "4" of the parsing result has the same content as the re-search source.

Next, the re-search unit 17 changes the display order of the search results obtained by parsing in descending order of the positive correlation coefficient based on the calculated correlation coefficient (S210). The correlation coefficient for the search result No. "1" is "0.59", the correlation coefficient for the search result No. "2" is "0.59", and the correlation coefficient for the search result No. "3" is "0.65". Since the correlation coefficient for the search result No. "4" is "1.00", the display order is "4", "3", "1", and "2" as the search result No.

Then, the re-search unit 17 stores the search result No., the display order, and the correlation coefficient in the display order management table 26 in association with each other (S211).

Then, the re-search unit 17 presents the search result list in which the display order is rearranged to the user (S212). Here, in the search result list, information on each search result is displayed in the order of search result No. 4, search result No. 3, search result No. 1, and search result No. 2.

[Flowchart of search keyword analysis unit]
FIG. 11 is a diagram showing an example of a flowchart of the search keyword analysis unit according to the embodiment. It is assumed that the search keyword analysis unit 11 has received the input search keyword. The input search keyword refers to the search keyword k1 shown in FIG. 9A.

As shown in FIG. 11, the search keyword analysis unit 11 reads keywords one by one from the input search keyword k1 (step S11). Keywords include, for example, a search keyword indicating a phrase and a time-specified keyword. The search keyword analysis unit 11 determines whether or not the input search keyword k1 has been completed (step S12). When it is determined that the input search keyword k1 is completed (step S12; Yes), the search keyword analysis unit 11 proceeds to step S17.

On the other hand, when it is determined that the input search keyword k1 is not completed (step S12; No), the search keyword analysis unit 11 determines whether or not the read keyword is a time-designated keyword (step). S13). When it is determined that the keyword is not the time designation keyword (step S13; No), the search keyword analysis unit 11 extracts the priority of the search keyword because the read keyword is the search keyword (step S14). Then, the search keyword analysis unit 11 proceeds to step S16.

On the other hand, when it is determined that the keyword is a time-designated keyword (step S13; Yes), the search keyword analysis unit 11 analyzes the time-designated keyword (step S15). Then, the search keyword analysis unit 11 proceeds to step S16.

In step S16, the search keyword analysis unit 11 registers the analysis result of the search keyword k1 in the search keyword management table 22 and the time designation keyword management table 23. Then, the search keyword analysis unit 11 proceeds to step S11 in order to read the next keyword.

In step S17, the search keyword analysis unit 11 outputs the search keyword (step S17). For example, the search keyword analysis unit 11 outputs a search keyword excluding the priority and time designation keywords from the search keyword k1. The output search keyword refers to the search keyword k2 shown in FIG. 9A. Then, the search keyword analysis unit 11 ends the search keyword analysis process.

[Flowchart of search result narrowing section]
FIG. 12 is a diagram showing an example of a flowchart of the search result narrowing-down unit according to the embodiment. It is assumed that the search engine execution unit 12 executes the search engine 90 with the search keyword k2 output by the search keyword analysis unit 11 and acquires the search result.

As shown in FIG. 12, the search result narrowing-down unit 13 determines whether or not the search keyword k1 has a time-designated keyword (step S21). When it is determined that there is no time designation keyword (step S21; No), the search result narrowing unit 13 sets the acquired search result as the narrowed search result. Then, the search result narrowing unit 13 ends the search result narrowing process.

When it is determined that there is a time designation keyword (step S21; Yes), the search result narrowing unit 13 extracts one search result from the acquired search result (step S22). Then, the search result narrowing-down unit 13 determines whether or not the search result is completed (step S23). When it is determined that the search result is not completed (step S23; No), the search result narrowing unit 13 extracts the update date and time of the search result from the content of the search result (step S24).

Then, the search result narrowing-down unit 13 determines whether or not the extracted update date and time matches the time-designated keyword (step S25). If it is determined that the keyword does not match the time designation keyword (step S25; No), the search result narrowing unit 13 excludes the actually fetched search result. Then, the search result narrowing-down unit 13 proceeds to step S22 in order to retrieve the next search result.

If it is determined that the keyword matches the time designation keyword (step S25; Yes), the search result narrowing-down unit 13 processes the actually retrieved search result (step S26). Then, the search result narrowing unit 13 stores the processing target together with the update date and time in the search result management table 24. It should be noted that the search results are narrowed down to be processed. Then, the search result narrowing-down unit 13 proceeds to step S22 in order to retrieve the next search result.

On the other hand, when it is determined that the search result is completed (step S23; Yes), the search result narrowing unit 13 ends the search result narrowing process.

[Flowchart of search result analysis unit]
FIG. 13 is a diagram showing an example of a flowchart of the search result analysis unit according to the embodiment. It is assumed that the search result analysis unit 14 receives the search results narrowed down from the search result narrowing down unit 13.

As shown in FIG. 13, the search result analysis unit 14 extracts one search result from the narrowed search results (processing target) (step S31). The search result analysis unit 14 determines whether or not the search result is completed (step S32). If it is determined that the search result is not completed (step S32; No), the search result analysis unit 14 extracts the update date and time of the search result from the content of the search result (step S33). Then, the search result analysis unit 14 parses the extracted search result (step S34).

The search result analysis unit 14 extracts one word from the result of the syntactic analysis (step S35). The search result analysis unit 14 determines whether or not the phrase has ended (step S36). When it is determined that the phrase is completed (step S36; Yes), the search result analysis unit 14 registers the syntax analysis result of the retrieved search result in the syntax analysis result management table 25 (step S37). Then, the search result analysis unit 14 proceeds to step S31 in order to retrieve the next search result.

On the other hand, when it is determined that the phrase is not completed (step S36; No), the search result analysis unit 14 determines whether or not the extracted phrase is a single phrase (step S38). When it is determined that the phrase is a single phrase (step S38; Yes), the search result analysis unit 14 determines whether or not the extracted phrase is a search keyword (step S39). If it is determined that the search keyword is used (step S39; Yes), the search result analysis unit 14 counts the search keyword (step S40). Then, the search result analysis unit 14 proceeds to step S35 in order to extract the next phrase.

On the other hand, if it is determined that the keyword is not the search keyword (step S39; No), the search result analysis unit 14 counts words and phrases that are not the search keyword (step S41). Then, the search result analysis unit 14 proceeds to step S35 in order to extract the next phrase.

If it is determined in step S38 that the phrase is not a single phrase (step S38; No), the search result analysis unit 14 determines whether or not the retrieved phrase includes a search keyword (step S42). When it is determined that the search keyword is included (step S42; Yes), the search result analysis unit 14 counts a plurality of words and phrases including the search keyword (step S43). Then, the search result analysis unit 14 proceeds to step S35 in order to extract the next phrase.

On the other hand, when it is determined that the search keyword is not included (step S42; No), the search result analysis unit 14 counts a plurality of words and phrases that do not include the search keyword (step S44). Then, the search result analysis unit 14 proceeds to step S35 in order to extract the next phrase.

If it is determined in step S32 that the search result has been completed (step S32; Yes), the search result analysis unit 14 ends the search result analysis process.

[Flowchart of search result display order change part]
FIG. 14 is a diagram showing an example of a flowchart of the search result display order changing unit according to the embodiment.

As shown in FIG. 14, the search result display order changing unit 15 sorts the parsed search results in descending order (latest order) of the update date and time (step S51). The search result display order changing unit 15 refers to the search keyword management table 22 and determines whether or not the search keyword k2 has a priority (step S52). If it is determined that there is no priority (step S52; No), the search result display order changing unit 15 proceeds to step S59.

On the other hand, when it is determined that there is a priority (step S52; Yes), the search result display order changing unit 15 extracts the highest-level search keyword 22c from the search keyword management table 22 (step S53).

Then, the search result display order changing unit 15 uses the syntax analysis result as the analysis result and groups the analysis result according to the number of occurrences of the retrieved search keyword 22c (step S54). That is, the search result display order changing unit 15 groups the search results having the same number of occurrences of the retrieved search keywords 22c in the same group. Then, the search result display order changing unit 15 arranges the groups in descending order of the number of appearances (step S55).

Then, the search result display order changing unit 15 determines whether or not there is a group including a plurality of search results (step S56). If it is determined that there is no group including a plurality of search results (step S56; No), the search result display order changing unit 15 proceeds to step S59.

On the other hand, when it is determined that there is a group including a plurality of search results (step S56; Yes), the search result display order changing unit 15 refers to the search keyword management table 22 and sets the search keyword k2 to the next. It is determined whether or not there is a priority (step S57).

If it is determined that there is no next priority (step S57; No), the search result display order changing unit 15 proceeds to step S59. On the other hand, when it is determined that there is the next priority (step S57; Yes), the search result display order changing unit 15 extracts the search keyword 22c of the next order from the search keyword management table 22 (step S58). Then, the search result display order changing unit 15 shifts to step S54 in order to group the group including the plurality of search results as the analysis result.

In step S59, the search result display order changing unit 15 presents a search result list in which the display order is rearranged (step S59), and ends the search result display order changing process.

[Flowchart of search result graphing section]
FIG. 15 is a diagram showing an example of a flowchart of the search result graphing unit according to the embodiment. It is assumed that the user specifies one of the search results on the search result list by mouse over.

As shown in FIG. 15, the search result graphing unit 16 accepts the designation of the mouse-over search result (step S61). The search result graphing unit 16 refers to the syntax analysis result management table 25 and extracts the syntax analysis result corresponding to the received search result (step S62).

The search result graphing unit 16 extracts the words 25e included in the syntactic analysis result from the extracted syntactic analysis results in descending order of the number of appearances 25d (step S63). The search result graphing unit 16 determines whether or not there is the following phrase (step S64). When it is determined that there is the next phrase (step S64; Yes), the search result graphing unit 16 determines whether or not the next phrase matches the search keyword (step S65).

When it is determined that the next phrase matches the search keyword (step S65; Yes), the search result graphing unit 16 creates a graph with the color of this phrase as red (step S66), and proceeds to step S68. .. On the other hand, when it is determined that the next phrase does not match the search keyword (step S65; No), the search result graphing unit 16 creates a graph with the color of this phrase as blue (step S67), and steps S68. Move to.

In step S68, the search result graphing unit 16 sets the check box to selected (step S68), and proceeds to step S63 in order to extract the next phrase.

If it is determined in step S64 that there is no next word (step S64; No), the search result graphing unit 16 uses the extracted syntactic analysis results to display the number of combinations of words included in the syntactic analysis result. Take out in descending order (step S69). The search result graphing unit 16 determines whether or not there is the following phrase (step S70). When it is determined that there is the next phrase (step S70; Yes), the search result graphing unit 16 determines whether or not the next phrase includes the search keyword (step S71).

When it is determined that the next phrase includes a search keyword (step S71; Yes), the search result graphing unit 16 creates a graph with the color of this phrase as red (step S72), and proceeds to step S74. .. On the other hand, when it is determined that the next phrase does not include the search keyword (step S71; No), the search result graphing unit 16 creates a graph with the color of this phrase as blue (step S73), and steps S74. Move to.

In step S74, the search result graphing unit 16 sets the check box to selected (step S74), and proceeds to step S69 in order to extract the next combination phrase.

If it is determined in step S70 that there is no next word (step S70; No), the search result graphing unit 16 displays the created graph (step S75) and ends the search result graphing process.

[Flowchart of re-search section]
FIG. 16 is a diagram showing an example of a flowchart of the re-search unit according to the embodiment. The user specifies the search result on the search result list by clicking the mouse, and the re-search unit 17 displays the re-search screen. Then, it is assumed that the user presses the re-search button on the re-search screen.

As shown in FIG. 16, the re-search unit 17 refers to the syntax analysis result management table 25 and extracts the syntax analysis result corresponding to the designated search result (step S81). Then, the re-search unit 17 extracts a phrase from the syntactic analysis result (step S82). Then, the re-search unit 17 determines whether or not the phrase is finished (step S83). If it is determined that the phrase is not finished (step S83; No), the re-search unit 17 determines whether or not the check box for the retrieved phrase is selected (step S84).

If it is determined that the check box for the extracted phrase is not selected (step S84; No), the re-search unit 17 proceeds to step S82 in order to extract the next phrase.

On the other hand, when it is determined that the check box for the extracted phrase is selected (step S84; Yes), the re-search unit 17 extracts the phrase and the number of occurrences (step S85). Here, the number of occurrences for a phrase is (A). Then, the re-search unit 17 identifies the phrase as a search keyword (step S86). Then, the re-search unit 17 proceeds to step S82 in order to retrieve the next phrase.

If it is determined in step S83 that the phrase is finished (step S83; Yes), the re-search unit 17 executes a search using the specified search keyword (step S87). For example, the re-search unit 17 executes the search engine 90 by the search engine execution unit 12 with the search keyword k2 as the specified search keyword.

Then, the re-search unit 17 executes the search result analysis process (step S88). That is, the re-search unit 17 executes the processing by the search result narrowing unit 13 and the processing by the search result analysis unit 14. The process by the search result narrowing-down unit 13 is the same as the process shown in FIG. The processing by the search result analysis unit 14 is the same as the processing shown in FIG.

Then, the re-search unit 17 retrieves one search result from all the search results (step S89). Then, the re-search unit 17 determines whether or not the search result is completed (step S90). When it is determined that the search result is not completed (step S90; No), the re-search unit 17 extracts the words and phrases of the retrieved search result and the number of occurrences (step S91). Here, the number of occurrences for a phrase is (B).

Then, the re-search unit 17 calculates the correlation coefficient between (A) and (B) (step S92). Then, the re-search unit 17 proceeds to step S89 in order to retrieve the next search result.

If it is determined in step S90 that the search result is finished (step S90; Yes), the re-search unit 17 changes the display order of the search results so that the display order of the search results is in descending order of the positive correlation coefficient (step S90; Yes). Step S93). Then, the re-search unit 17 presents a search result list in which the display order is rearranged (step S94), and ends the re-search process.

[Effect of Examples]
In this way, the search support device 1 presents a first set of search results searched based on the search conditions. The search support device 1 accepts the designation of at least one search result from the first set of the presented search results. The search support device 1 calculates the degree of similarity between the search results included in the second set of search results searched based on the predetermined search conditions obtained from the designated search results and the designated search results. The search support device 1 sorts the search results included in the second set based on the calculated similarity, and presents the sorted search results. According to such a configuration, the search support device 1 can easily narrow down the search target intended by the user in relation to the information retrieval. That is, the information support device 1 can narrow down the search results intended by the user without the user opening the search results, and can easily improve the accuracy of the narrowing down.

Further, the search support device 1 presents a graph relating to a phrase obtained by parsing the search result for which the designation has been accepted and the number of occurrences of the phrase. According to such a configuration, the search support device 1 can make the user estimate whether or not the search target is the target by using the phrase included in the search result and the number of occurrences of the phrase. In addition, the search support device 1 can make the words and phrases constituting the search conditions used for narrowing down the target search target estimated.

Further, the search support device 1 accepts the designation of at least one word and phrase constituting the graph in the presented search result. The search support device 1 searches based on a predetermined search condition including a designated phrase. The search support device 1 has a similarity between the pattern of the number of occurrences of the search result for the specified phrase included in the second set of the searched search results and the pattern of the number of occurrences of the specified search result for the specified phrase. Calculate the degree. According to such a configuration, the search support device 1 can find a search result similar to the pattern of the number of occurrences of the specified search result for the specified word / phrase from the search results included in the second set. .. As a result, the search support device 1 can find a search result similar to the designated search result, and can narrow down the target search target.

Further, the search support device 1 calculates the degree of correlation between the pattern of the number of appearances of the search result included in the second set for the specified word and phrase and the pattern of the number of appearances of the specified search result for the specified word and phrase. To do. According to such a configuration, the search support device 1 can easily find a search result similar to the specified search result by setting the degree of similarity as the degree of correlation.

[Other]
The search support device 1 can be realized by mounting each function such as the control unit 10 and the storage unit 20 on a known information processing device such as a personal computer or a workstation.

Further, in the above embodiment, each component of the illustrated device does not necessarily have to be physically configured as shown in the figure. That is, the specific aspects of device distribution / integration are not limited to those shown in the figure, and all or part of the device may be functionally or physically distributed / integrated in arbitrary units according to various loads and usage conditions. Can be configured. For example, the search result display order changing unit 15 and the search result graphing unit 16 may be integrated. The re-search unit 17 is divided into a processing unit that requests processing from the search engine execution unit 12, a processing unit that requests processing from the search result narrowing unit 13, a processing unit that requests processing from the search result analysis unit 14, and a search result. It may be distributed to the processing unit that changes the display order of. The storage unit 20 may be connected via a network as an external device of the search support device 1.

In addition, the various processes described in the above embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. Therefore, in the following, an example of a computer that executes a search support program that realizes the same functions as the search support device 1 shown in FIG. 1 will be described. FIG. 17 is a diagram showing an example of a computer that executes a search support program.

As shown in FIG. 17, the computer 200 has a CPU 203 that executes various arithmetic processes, an input device 215 that receives data input from a user, and a display control unit 207 that controls the display device 209. Further, the computer 200 has a drive device 213 that reads a program or the like from a storage medium, and a communication control unit 217 that exchanges data with another computer via a network. Further, the computer 200 has a memory 201 for temporarily storing various information and an HDD 205. The memory 201, CPU 203, HDD 205, display control unit 207, drive device 213, input device 215, and communication control unit 217 are connected by a bus 219.

The drive device 213 is, for example, a device for the removable disk 211. The HDD 205 stores the search support program 205a and the search support processing-related information 205b.

The CPU 203 reads the search support program 205a, expands it in the memory 201, and executes it as a process. Such a process corresponds to each functional unit of the search support device 1. The search support processing-related information 205b corresponds to each table stored in the storage unit 20. Then, for example, the removable disk 211 stores each information such as the search support program 205a.

The search support program 205a does not necessarily have to be stored in the HDD 205 from the beginning. For example, the program is stored in a "portable physical medium" such as a flexible disk (FD), a CD-ROM, a DVD disk, a magneto-optical disk, or an IC card inserted into the computer 200. Then, the computer 200 may read the search support program 205a from these and execute it.

1 Search support device 10 Control unit 11 Search keyword analysis unit 12 Search engine execution unit 13 Search result narrowing unit 14 Search result analysis unit 15 Search result display order change unit 16 Search result graphing unit 17 Re-search unit 20 Storage unit 21 Search management Table 22 Search keyword management table 23 Time-specified keyword management table 24 Search result management table 25 Syntax analysis result management table 26 Display order management table 9 Search service system 90 Search engine

Claims (6)

On the computer
Presenting the first set of search results searched based on the search conditions,
Accepting the designation of at least one search result from the first set of the presented search results,
The similarity between the search results included in the second set of search results searched based on the predetermined search conditions obtained from the specified search results and the specified search results is calculated.
The search results included in the second set are sorted based on the calculated similarity.
A search support program characterized by executing a process of presenting the sorted search results. The search support program according to claim 1, wherein a graph relating to a phrase obtained by parsing the search result for which the designation is accepted and the number of occurrences of the phrase is presented. The calculation process is
Accepting the designation of at least one word that constitutes the graph in the presented search result,
A search is performed based on the predetermined search condition including the specified phrase.
The degree of similarity between the pattern of the number of occurrences of the search results included in the second set of the searched search results for the specified phrase and the pattern of the number of occurrences of the specified search result for the specified phrase. The search support program according to claim 2, wherein the search support program is characterized in that. The similarity is the degree of correlation between the pattern of the number of occurrences of the search results included in the second set for the specified phrase and the pattern of the number of appearances of the specified search result for the specified phrase. The search support program according to claim 3, wherein the search support program is shown. The computer
A first presenting unit that presents a first set of search results searched based on search conditions, and
A reception unit that accepts designation of at least one search result from the first set of search results presented by the first presenting unit.
Calculate the similarity between the search results included in the second set of search results searched based on the predetermined search conditions obtained from the search results indicated by the designation received by the reception unit and the search results indicated by the designation. Calculation unit and
A sort unit that sorts the search results included in the second set based on the similarity calculated by the calculation unit, and a sort unit.
A second presenting unit that presents the search results sorted by the sorting unit, and
A search support device characterized by having. The computer
Presenting the first set of search results searched based on the search conditions,
Accepting the designation of at least one search result from the first set of the presented search results,
The similarity between the search results included in the second set of search results searched based on the predetermined search conditions obtained from the specified search results and the specified search results is calculated.
The search results included in the second set are sorted based on the calculated similarity.
A search support method characterized by executing each process of presenting the sorted search results.

Images