JP5380874B2 - Information retrieval method, program and apparatus - Google Patents

Description

  The present invention relates to an information retrieval technique, and more particularly to a technique for retrieving data to be set in a table.

  For example, when preparing an analysis data on trends in a certain industry, it is common to list items to be evaluated and summarize the superiority or inferiority of several major major companies in a tabular format for each item. In this case, for example, the user searches the Internet, a server in the company, and the user's own PC, collects necessary information, and inputs it to the corresponding position in the table. However, since this work needs to be repeated for each cell in the table, the amount of work increases as the number of items increases, which takes time. In addition, for information retrieval, it is necessary to assemble an appropriate retrieval formula according to the purpose or to designate a retrieval range, and the user needs know-how and experience of retrieval. Therefore, for example, when a user unfamiliar with search performs the above-described work, it may take time to assemble a search expression, or target data may not be obtained because the search range is not appropriate.

  For example, Japanese Patent Laid-Open No. 2001-297098 discloses a registration search system that efficiently realizes a search for facility information by an information user. Specifically, the registration / retrieval system stores a management center that stores and manages facility information regarding various facilities, a registration terminal that allows an information provider to register facility information, and informs an information user of the facility information. A search terminal. Then, in order to enable the facility information to be searched based on the registered item, the search terminal obtains search information for the search item based on a search template in which a predetermined search item corresponding to the registered item is described. Search information input means to be input by an information user, search information transmission means for transmitting search information input by the search information input means to the management center, and transmission of search information by the search information transmission means from the management center Informing means for informing facility information as a search result to be transmitted is provided.

  Also, for example, Japanese Patent No. 3160265 discloses a semi-structured document information integrated search device that searches for information contained in a plurality of semi-structured documents on an open network. Specifically, the semi-structured document information integrated search apparatus stores, for each semi-structured document, meta information defining items to be extracted from the semi-structured document and item information for performing a condition search for the items. A search unit that retrieves information scattered in a plurality of semi-structured documents based on meta-information from an input query, and obtains a batch search result, in a predetermined single format for each user And an output unit for outputting a search result.

Furthermore, for example, in Japanese Patent Laid-Open No. 10-154152, when searching and referring to a homepage on the Internet, only necessary data is stored in advance in a removable storage medium, for example. A homepage search system that enables reference is disclosed. Specifically, the homepage search system includes a terminal and a center. The terminal includes a display means, an input means for the user to input, a search code input to the input means, a storage means for storing a search result received from the center, and a display means. A control means for displaying a screen prompting the user to input and as a result storing the search code input by the user into the input means in the storage means and transmitting it to the center, and a communication means used for data transmission / reception with the center . Furthermore, the center refers to communication means used for data transmission / reception with the terminal, search means for searching for a URL (Uniform Resource Locator) including the search code based on the search code, and reference when the search means performs URL search. The URL database, the storage means, the search code received by the communication means, and the search result obtained as a result of passing the search code received by the communication means to the search means are stored in the storage means and the communication means is used. Control means for transmitting to the terminal.
JP 2001-297098 A Japanese Patent No. 3160265 JP-A-10-154152

  As described above, in the conventional technique, when data to be set in a table is collected, the user must perform a search by specifying a search condition for each cell in the table.

  Accordingly, an object of the present invention is to provide a technique for easily collecting data to be set in a table.

  An information search method according to the present invention includes a search formula information storage unit storing a search formula generation rule for each format of a table composed of one or more item parts and a data part corresponding to the item part, and a search result storage part A method for retrieving information executed by a computer having: a table format specification; and a step of receiving input of title data relating to the table and an item name of each item part, and storing the data in a storage device; For the part, according to the search expression generation rule corresponding to the format of the specified table and stored in the search expression information storage part, from the title data, or the title data and the item name of the item part corresponding to the data part, A step of generating a search expression corresponding to the data part, and for each data part, a search expression corresponding to the data part is output to a predetermined search engine, A search step for acquiring a search result including information indicating the location of data to be set in the data part from a search engine, and storing it in the search result storage unit in association with information indicating a position in the table of the data part; Generating display data by setting information representing the location of data to be set in each data section based on the data stored in the search result storage section.

  In this way, a search expression corresponding to each data part (for example, a cell in the table) is automatically generated on the basis of the table format, table title, and item name, thereby reducing the burden on the user. . In addition, for example, even a user who is not used to searching can obtain target data.

  Further, for each data part, in accordance with a search expression generation rule stored in the search expression information storage part, a keyword extraction step for extracting a keyword for internal search from an item name of an item part corresponding to the data part, and each data part The web page data or file specified by the information indicating the location of the data to be set is acquired, and the inside of the web page data or file is searched based on the internal search keyword corresponding to the data section. And a search step.

  In this way, it becomes possible to determine the credibility of the search result (for example, URL (Uniform Resource Locator)) from the search engine.

  Further, when an internal search keyword is not detected in the internal search step, a new search expression is generated by adding the internal search keyword to the search expression corresponding to the data portion; A step of performing the steps after the search step may be further included using a search expression.

  In this way, the search is performed again using a new search expression, so that a more reliable search result can be presented to the user.

  The search step may include a step of specifying a search range based on the title data stored in the storage device and the item name of the item portion.

  In this way, it becomes possible to specify a search range suitable for the purpose.

  The table format includes a first format having either a column item or a row item, a second format having a column item and a row item in one layer, and a column item and a row item in a plurality of layers. And a third format having the same.

  Note that a program for causing a computer to execute the information search method according to the present invention can be created, and the program is, for example, a storage medium such as a flexible disk, a CD-ROM, a magneto-optical disk, a semiconductor memory, a hard disk, or the like. It is stored in a storage device. In some cases, digital signals are distributed over a network. Note that data being processed is temporarily stored in a storage device such as a computer memory.

  According to the present invention, data to be set in the table can be easily collected.

  An outline of an embodiment of the present invention will be described with reference to FIG. In the present embodiment, when a user selects a template suitable for a purpose from templates prepared in advance and inputs a title (title) and an item name (column item or row item), the input title or item is input. A search expression is automatically generated from the name, and the search is executed based on the search expression. Then, the search result (URL) is embedded in each cell in the table to complete the table and present it to the user.

  For example, when the homepage of company A has a hierarchical structure as shown in FIG. 1, for "sales" of company A, the URL of the page of financial data (1) is obtained as a search result, and the URL is shown in the table. Is buried. As for the “number of employees” of company A, the URL of the page of company overview (2) is obtained as a search result, and the URL is embedded in the table. Furthermore, for the “business contents”, “solution”, and “product / service” of Company A, the URL of the business contents / solution / product / service (3) page is obtained as a search result, and the URL is shown in the table. Is buried.

  An outline of an information search system according to an embodiment of the present invention is shown in FIG. For example, a user terminal (A and B in FIG. 2) and an information search apparatus 3 that performs main processing in the present embodiment are connected to a network 1 that is the Internet. Although FIG. 2 shows an example in which there are two user terminals, the number of user terminals is not limited to this.

  The information search device 3 includes a dictionary storage unit 35 that stores a keyword dictionary, a synonym dictionary, a search expression generation rule dictionary, and a search location setting dictionary, which will be described later, and a search template reception that receives a template selection input from the user. A search expression generation unit 32 that performs a process of generating a search expression based on the data input from the user and the dictionary stored in the dictionary storage unit 35, and the search expression generated by the search expression generation unit 32. A search expression storage unit 36 for storing, a search processing unit 33 for performing a search process based on the search expression stored in the search expression storage unit 36, and a search result storage unit 37 for storing a search result of a search by the search processing unit 33 And a search result display processing unit 34 that performs processing for displaying the search results stored in the search result storage unit 37, and a work memory 38. The work memory 38 is secured in the main memory or the like in the information search device 3.

  In the keyword dictionary stored in the dictionary storage unit 35, words to be keywords are registered. Each word is weighted and used to specify a search range. Further, in the synonym dictionary stored in the dictionary storage unit 35, words that are regarded as synonyms with a specific word are registered. Further, in the search expression generation rule dictionary stored in the dictionary storage unit 35, search expression generation rules are registered for each table format. In the search location setting dictionary stored in the dictionary storage unit 35, information related to the search location is registered. In the present embodiment, three patterns of a narrow area, a middle area, and a wide area, which will be described later, are used.

  3 to 5 show examples of data stored in the search result storage unit 37. FIG. First, an example of the data structure of a one-dimensional template is shown in FIG. As shown in FIG. 3A, the one-dimensional template is composed of column items (m1 to mN) and a data part (dn1m1 to dnNmN), and has a data structure as shown in FIG. Managed. Specifically, the data structure for the column items (m1 to mN) includes user identification, template identification, template name, number of columns, value of column m1, value of column m2, and so on. , And the value of column mN. The data structure for the data part (dn1m1 to dnNmN) includes user identification, template identification, template name, field number, field number (dn1m1), index value, screenshot, and actual value. , ..., including field number (dnNmN), index value, screenshot, and actual value. For the template identification, for example, identification information represented by “template number + one-dimensional template number” is set. Further, the content of the title is set in the template name. The index value is registered with a URL obtained as a search result.

  An example of the data structure of a two-dimensional template is shown in FIG. As shown in FIG. 4A, the two-dimensional template is composed of row items (n1 to nN), column items (m1 to mN), and a data part (dn1m1 to dnNmN). It is managed with a data structure as shown in b). Specifically, the data structure for the row items (n1 to nN) includes a user identification, a template identification, a template name, the number of rows, a value in the column n1, a value in the column n2, and so on. , And the value of column nN. The data structure for the column items (m1 to mN) and the data part (dn1m1 to dnNmN) is the same as the data structure shown in FIG.

  An example of the data structure of the multi-dimensional template is shown in FIG. As shown in FIG. 5 (a), the multi-dimensional template includes two levels of row items (n1 to nN, n11 to nNM), two levels of column items (m1 to mN, m11 to mNM), data Part (dn11m11 to dnNMmNM) and is managed in a data structure as shown in FIG. Specifically, the data structure for the line items (n1 to nN, n11 to nNM) includes a user identification, a template identification, a template name, the number of items, the number of items in the first item, The value of n1, the number of row items in the second row, the value of row n11, the value of row n12, ..., the value of row nN, the number of row items in the second row, and the value of row nNN , Including the value of line nNM. The data structure for column items (m1 to mN, m11 to mNM) includes user identification, template identification, template name, number of column items, number of column items in the first column, and column m1 value. , Second column item number, column m11 value, column m12 value,..., Column mN value, second column item number, column mNN value, column mNM And the value of Furthermore, the data structure for the data part (dn11m11 to dnNMmNM) includes user identification, template identification, template name, field number, field number (dn11m11), index value, screenshot, and actual value. , ..., including field number (dnNMmNM), index value, screenshot, and actual value.

  Next, processing of the information search system shown in FIG. 2 will be described with reference to FIGS. First, the processing flow of the entire information search system will be described with reference to FIGS. For example, when a user intends to summarize market research or industry trends in a tabular format, the user operates the user terminal to access the information search apparatus 3. In the following, an example of implementation with such a client-server system will be described, but the information retrieval apparatus 3 may be realized as a stand-alone computer.

  The search template reception unit 31 of the information search device 3 transmits template selection screen data to the user terminal in response to access from the user terminal. Then, the user terminal receives the template selection screen data from the information search device 3 and displays it on the display device. For example, a screen as shown in FIG. 6 is displayed. In the example of FIG. 6, the template selection screen includes a template selection field 601 that is a list box, for example, and a “Next” button 602. If there is a template used by the user in the past, the template name (in the example of FIG. 6, “○ △ list” or “performance comparison OO”) is displayed in the template selection field 601. .

  Then, the user selects a table template to be created from the template selection field 601 and clicks a “next” button 602. The user terminal accepts a template selection input (FIG. 7: step S1) and transmits it to the information search device 3. And the search template reception part 31 of the information search device 3 receives the selection information of a template from a user terminal, and judges whether the selected template is an existing template (step S3). The template selection information is stored in the work memory 38.

  When it is determined that the selected template is not an existing template (step S3: No route), the search template reception unit 31 of the information search device 3 generates item input screen data and transmits it to the user terminal. The user terminal receives the item input screen data from the information search device 3 and displays it on the display device. For example, a screen as shown in FIG. 8 is displayed. In the example of FIG. 8, the item input screen includes a target input field 801, a table title (ie, title) input field 802, a column item input field 803, a line item input field 804, and a confirmation button. 805 is provided. The table title input field 802 and the line item input field 804 have a function as, for example, a combo box, and can be selected from choices or directly input.

  Then, the user inputs a title and an item name and clicks a confirmation button 805. The user terminal accepts input of a title and an item name (step S7) and transmits it to the information search device 3. Then, the search template reception unit 31 of the information search device 3 receives the title and item name from the user terminal and stores them in the work memory 38. And the search template reception part 31 produces | generates search content confirmation screen data, and transmits to a user terminal. The user terminal receives the search content confirmation screen data from the information search device 3 and displays it on the display device. For example, a screen as shown in FIG. 9 is displayed. In the example of FIG. 9, the search content confirmation screen is provided with a target display column 901, a table title display column 902, a search result output image 903, and a search button 904.

  On the other hand, when it is determined in step S3 that the selected template is an existing template (step S3: Yes route), the search template reception unit 31 of the information search device 3 reads the title and item from the search result storage unit 37. The name is extracted (step S5) and temporarily stored in the work memory 38. And the search template reception part 31 produces | generates search content confirmation screen data based on the extracted title and item name, and transmits to a user terminal. The user terminal receives the search content confirmation screen data from the information search device 3 and displays it on the display device. That is, a search content confirmation screen as shown in FIG. 9 is displayed.

  The user confirms the search content on the search content confirmation screen, and if there is no problem, clicks the search button 904 (FIG. 9). The user terminal accepts a search start instruction (step S9) and transmits it to the information search device 3. Then, when receiving a search start instruction from the user terminal, the search expression generation unit 32 of the information search device 3 determines whether the format of the selected template is a one-dimensional format (step S11). When it is determined that the format of the selected template is a one-dimensional format (step S11: Yes route), the search expression generation unit 32 performs one-dimensional based on the data stored in the dictionary storage unit 35 and the work memory 38. A search expression generation process is performed (step S13). Although details will be described later, in the one-dimensional search expression generation process, a search expression is generated according to the search expression generation rule for the one-dimensional format and stored in the search expression storage unit 36. Thereafter, the process proceeds to step S21 (FIG. 10) via the terminal A.

  On the other hand, when it is determined that the format of the selected template is not a one-dimensional format (step S11: No route), the search expression generation unit 32 determines whether the format of the selected template is a two-dimensional format (step S11). S15). When it is determined that the format of the selected template is a two-dimensional format (step S15: Yes route), the search expression generation unit 32 uses the two-dimensional data based on the data stored in the dictionary storage unit 35 and the work memory 38. A search expression generation process is performed (step S17). Although details will be described later, in the two-dimensional search expression generation process, a search expression is generated according to a search expression generation rule for the two-dimensional format and stored in the search expression storage unit 36. Thereafter, the process proceeds to step S21 (FIG. 10) via the terminal A.

  On the other hand, when it is determined that the format of the selected template is not a two-dimensional format (step S15: No route), that is, when the format of the selected template is a multi-dimensional format, the search expression generation unit 32 uses the dictionary. Based on the data stored in the storage unit 35 and the work memory 38, a multidimensional search expression generation process is performed (step S19). Although details will be described later, in the multidimensional search expression generation process, a search expression is generated according to a search expression generation rule for the multidimensional format and stored in the search expression storage unit 36. Thereafter, the process proceeds to step S21 (FIG. 10) via the terminal A.

  Shifting to the description of FIG. 10, after the terminal A, the search processing unit 33 of the information search device 3 specifies the search range according to the search location setting dictionary stored in the dictionary storage unit 35 (FIG. 10: Step S21). ). In the present embodiment, it is assumed that three patterns (narrow area, middle area, and wide area) are set as the search range. Specifically, for example, when a company name is included in the search formula, a narrow area is specified as the search range. In the case of a narrow area, three search locations “in the PC (ie, user terminal)”, “intranet”, and “on the Internet” are searched in order. For example, when the company name is included in the search expression, the middle range is specified as the search range. In the case of the middle range, two search locations “intranet” and “on the Internet” are searched in order. Further, if neither the narrow area nor the middle area falls, a wide area is specified as the search range. If you are in a wide area, search only on the Internet.

  Then, the search processing unit 33 determines whether the search range is narrow (step S23). When it is determined that the search range is narrow (step S23: Yes route), the search processing unit 33 performs a PC search process based on the search formula stored in the search formula storage unit 36 (step S25). The PC search process will be described later in detail. Thereafter, the search processing unit 33 refers to the search result storage unit 37 and determines whether the search is completed (step S27). That is, it is determined whether all target information has been obtained by the PC search process. When it is determined that the search is completed (step S27: Yes route), the process proceeds to step S37 (FIG. 11) via the terminal B.

  On the other hand, if it is determined that the search has not been completed (step S27: No route), the search processing unit 33 performs an intranet search process (step S31). The intranet search process will be described later in detail. Thereafter, the search processing unit 33 determines whether the search is completed (step S33). That is, it is determined whether all target information has been obtained by the intranet search process. If it is determined that the search has been completed (step S33: Yes route), the process proceeds to step S37 (FIG. 11) via the terminal B.

  On the other hand, if it is determined that the search has not been completed (step S33: No route), the search processing unit 33 performs an Internet search process (step S35). The Internet search process will be described later in detail. Thereafter, the process proceeds to step S37 (FIG. 11) via the terminal B.

  On the other hand, when it is determined in step S23 that the search range is not narrow (step S23: No route), the search processing unit 33 determines whether the search range is a middle range (step S29). When it is determined that the search range is the middle range (step S29: Yes route), the process proceeds to step S31. That is, the search processing unit 33 performs an intranet search process. If the search is not completed, the search processing unit 33 subsequently performs an Internet search process.

  On the other hand, when it is determined that the search range is not the middle range (step S29: No route), that is, when the search range is the wide range, the process proceeds to step S35. That is, the search processing unit 33 performs Internet search processing.

  Moving to the description of FIG. 11, after terminal B, the search result display processing unit 34 of the information search device 3 generates search result screen data based on the data stored in the search result storage unit 37, and sends it to the user terminal. Transmit (FIG. 11: Step S37). Then, the user terminal receives the search result screen data from the information search device 3 and displays it on the display device. For example, a screen as shown in FIG. 12 is displayed.

  In the example of FIG. 12, the search result screen includes a search result display column 1201, a selected cell display column 1202, a data input column 1203, an input button 1204, and an all confirm button 1205. In this embodiment, each cell in the search result display column 1201 is set with a link to a screen shot of a Web page that is considered to disclose data corresponding to the cell. For example, when d13 is clicked, a tag 1206 including a screen shot of a Web page that is considered to have disclosed sales of C Corporation is displayed. This screen shot is acquired in a PC search process, an intranet search process, or an Internet search process described later. When d13 is clicked, “d13” is displayed in the selected cell display field 1202, and a value “120000” regarded as sales of C Corporation is displayed in the data input field 1203.

  Then, the user terminal determines whether an input instruction has been accepted (step S39). For example, the user confirms the display contents of the search result screen, and if there is no problem with the sales amount of C Corporation “120000”, the user clicks the input button 1204. On the other hand, if the sales of C Corporation is not “120000”, the user inputs a correct value in the data input field 1203 and clicks the input button 1204.

  When the user terminal accepts the input instruction (step S39: Yes route), the user terminal reflects it in the search result display column 1201 (step S41). Specifically, in the above example, “120000” is set in the sales cell of C Corporation. On the other hand, if an input instruction has not been received (step S39: No route), the process of step S41 is skipped, and the process proceeds to step S43.

  Then, the user terminal determines whether or not the all confirmation button 1205 has been clicked (step S43). For example, when the input instruction is completed for all cells, a search result screen as shown in FIG. 13 is displayed. Thereafter, the user clicks the all confirmation button 1305.

  When the user terminal receives the all confirmation instruction (step S43: Yes route), the user terminal transmits the input data to the information search device 3. And the search result display process part 34 of the information search device 3 receives input data from a user terminal, updates the search result storage part 37, and confirms registration of the data of each cell (step S45). On the other hand, if an all confirmation instruction has not been received (step S43: No route), the process returns to step S39. Then, after step S45, this process is terminated.

  In addition, although the example of a screen (FIGS. 8, 9, 12, and 13) when the selected template is in the two-dimensional format is shown above, for example, in the case of the one-dimensional format, instead of FIG. An item input screen as shown in FIG. 14 is displayed. Further, a search content confirmation screen as shown in FIG. 15 is displayed instead of FIG. 9, a search result screen as shown in FIG. 16 is displayed instead of FIG. 12, and as shown in FIG. 17 instead of FIG. The search result screen is displayed. Note that the number of rows in the table in FIG. 15 is arbitrarily set.

  By performing the processing as described above, target information can be collected without the user specifying a search expression.

  Next, a one-dimensional search expression generation process, a two-dimensional search expression generation process, and a multidimensional search expression generation process performed by the search expression generation unit 32 of the information search apparatus 3 will be described with reference to FIGS. FIG. 18 shows a process flow of the one-dimensional search expression generation process. First, the search expression generation unit 32 extracts a character string from the title stored in the work memory 38 (FIG. 18: step S51). For example, if the title is expressed in text, it is extracted by dividing it into several character strings.

  Then, based on the keyword dictionary stored in the dictionary storage unit 35, the search expression generation unit 32 specifies a character string that becomes a keyword among the extracted character strings, and stores it in the work memory 38 as a search condition (step S40). S53). For example, words that are not suitable for keywords are excluded.

  In addition, the search expression generation unit 32 stores the item name of each column item in the work memory 38 as a text mining key (step S55). Then, the search expression generation unit 32 extracts synonyms corresponding to the respective text mining keys from the synonym dictionary stored in the dictionary storage unit 35, and stores them in the work memory 38 (step S57). At this time, the text mining key and its synonym are combined in an OR condition.

  Then, the search expression generation unit 32 generates a search expression from the search conditions stored in the work memory 38 in accordance with the search expression generation rule for the one-dimensional format, and stores it in the search expression storage unit 36 (step S59). Specifically, a search expression for each cell is generated by combining keywords included in the search condition with AND or OR according to a search expression generation rule for a one-dimensional format. Information indicating which cell corresponds to the retrieval formula is also stored in the work memory 38. Then, the one-dimensional search expression generation process ends, and the process returns to the original process.

  That is, when the template is in a one-dimensional format, as shown in FIG. 19A, keywords are extracted from the titles, and text mining keys are extracted from the column items.

  FIG. 20 shows a process flow of the two-dimensional search expression generation process. First, the search expression generation unit 32 extracts a character string from the title stored in the work memory 38 (FIG. 20: step S61). For example, if the title is expressed in text, it is extracted by dividing it into several character strings.

  Then, based on the keyword dictionary stored in the dictionary storage unit 35, the search expression generation unit 32 specifies a character string that becomes a keyword among the extracted character strings, and stores it in the work memory 38 as a first search condition. (Step S63). For example, words that are not suitable for keywords are excluded.

  In addition, the search expression generation unit 32 stores the item name of each column item in the work memory 38 as the second search condition (step S65). Then, the search expression generation unit 32 extracts the synonym corresponding to the item name of each column item from the synonym dictionary stored in the dictionary storage unit 35, and stores it in the work memory 38 (step S67). At this time, the item name and its synonym are combined in an OR condition.

  Then, the search expression generation unit 32 stores the item name of each line item in the work memory 38 as a text mining key (step S69). Then, the search expression generation unit 32 extracts synonyms corresponding to the respective text mining keys from the synonym dictionary stored in the dictionary storage unit 35, and stores them in the work memory 38 (step S71). At this time, the text mining key and its synonym are combined in an OR condition.

  Then, the search expression generation unit 32 generates a search expression from the first and second search conditions stored in the work memory 38 according to the search expression generation rule for the two-dimensional format, and stores the search expression in the search expression storage unit 36. (Step S73). Specifically, in accordance with a search expression generation rule for a two-dimensional format, a search expression for each cell is generated by combining keywords included in the first and second search conditions with AND and OR. Information indicating which cell corresponds to the retrieval formula is also stored in the work memory 38. Then, the two-dimensional search expression generation process ends, and the process returns to the original process.

  That is, when the template is in a two-dimensional format, as shown in FIG. 19B, keywords are extracted from the title and column items, and text mining keys are extracted from the line items.

  FIG. 21 shows a processing flow of the multidimensional search expression generation unit processing. First, the search expression generation unit 32 extracts a character string from the title stored in the work memory 38 (FIG. 21: step S75). For example, if the title is expressed in text, it is extracted by dividing it into several character strings.

  Then, based on the keyword dictionary stored in the dictionary storage unit 35, the search expression generation unit 32 specifies a character string that becomes a keyword among the extracted character strings, and stores it in the work memory 38 as a first search condition. (Step S77). For example, words that are not suitable for keywords are excluded.

  Further, the search expression generation unit 32 stores the item name of each column item at the top in the work memory 38 as the second search condition (step S79). Then, the search expression generation unit 32 extracts the synonym corresponding to the item name of each column item from the synonym dictionary stored in the dictionary storage unit 35, and stores it in the work memory 38 (step S81). At this time, the item name and its synonym are combined in an OR condition.

  Then, the search expression generation unit 32 stores the item names of the respective column items after the second row in the work memory 38 as text mining keys (step S83). In addition, the search expression generation unit 32 stores the item name of each line item in the work memory 38 as a text mining key (step S85). Then, the search expression generation unit 32 extracts synonyms corresponding to each text mining key from the synonym dictionary stored in the dictionary storage unit 35, and stores them in the work memory 38 (step S87). At this time, the text mining key and its synonym are combined in an OR condition.

  Then, the search expression generation unit 32 generates a search expression from the first and second search conditions stored in the work memory 38 according to the search expression generation rule for the multidimensional format, and stores the search expression in the search expression storage unit 36. (Step S89). Specifically, in accordance with a search expression generation rule for a multidimensional format, a search expression for each cell is generated by combining keywords included in the first and second search conditions with AND and OR. Information indicating which cell corresponds to the retrieval formula is also stored in the work memory 38. Then, the multidimensional search expression generation process ends, and the process returns to the original process.

  That is, when the template is in a multi-dimensional format, as shown in FIG. 19 (c), keywords are extracted from the title and the top row column item, and the text mining key is extracted from the row item and the second row and subsequent column items. Extract.

  By executing the processing as described above, a search expression corresponding to each cell can be automatically generated from the title and the item name.

  Next, a PC search process by the search processing unit 33 of the information search apparatus 3 will be described with reference to FIGS. First, the search processing unit 33 specifies an unprocessed cell, and extracts a search formula corresponding to the specific cell from the search formula storage unit 36 (FIG. 22: step S101). Then, the search processing unit 33 performs an in-PC search based on the extracted search formula (step S103). Specifically, a search expression is output to a predetermined search engine that searches the PC, and a search result (for example, information indicating the file location) from the search engine is stored in the work memory 38. Note that settings necessary for the search engine are set in advance.

  Then, the search processing unit 33 determines whether information indicating the location of the file is included in the search result (step S105). When it is determined that the information indicating the location of the file is included in the search result (step S105: Yes route), the search processing unit 33 acquires the file and stores a screen shot of the file in the search result storage unit 37. (Step S107). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the file is executed based on the extracted text mining key (step S109). In the internal search, data related to the text mining key (hereinafter referred to as mining data) is extracted as a search result. For example, when the text mining key is “sales”, an amount that is regarded as sales is extracted. Since the internal search is not different from the conventional processing, the description is omitted here.

  Then, the search processing unit 33 determines whether mining data is detected as the processing result of step S109 (step S111). When the mining data is detected (step S111: Yes route), the process proceeds to step S125 (FIG. 23) via the terminal C. On the other hand, when the mining data is not detected (step S111: No route, the search processing unit 33 generates a second search formula by adding the text mining key to the search formula extracted in step S103, and the search formula The data is stored in the storage unit 36 (step S113), and then the process proceeds to step S115 (FIG. 23) via the terminal D.

  On the other hand, if it is determined in step S105 that the search result does not include information indicating the location of the file (step S105: No route), the process from step S107 to step S111 is skipped, and the process proceeds to step S113. . Then, after performing the process of step S113, the process proceeds to the process of step S115 (FIG. 23) via the terminal D.

  Shifting to the description of FIG. 23, after the terminal D, the search processing unit 33 executes an in-PC search based on the second search expression (FIG. 23: step S115). Note that the search in the PC is not different from the process in step S103, and thus the description thereof is omitted here.

  Then, the search processing unit 33 determines whether information indicating the file location is included in the search result (step S117). When it is determined that the information indicating the location of the file is included in the search result (step S117: Yes route), the search processing unit 33 acquires the file and stores a screen shot of the file in the search result storage unit 37. (Step S119). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the file is executed based on the extracted text mining key (step S121). Note that the internal search is the same as the process in step S109, and thus the description thereof is omitted here.

  Then, the search processing unit 33 determines whether mining data is detected as the processing result of step S121 (step S123). When the mining data is detected (step S123: Yes route), the search processing unit 33 stores the mining data in the search result storage unit 37 as the actual value of the specific cell (step S125).

  On the other hand, if it is determined that the information indicating the location of the file is not included in the search result (step S117: No route), or if mining data is not detected (step S123: No route), this means that no detection has been made. Information is stored in the search result storage unit 37 (step S127).

  Then, the search processing unit 33 determines whether the processing has been completed for all the cells (step S129). When the process is completed for all cells (step S129: Yes route), the PC search process is terminated and the process returns to the original process. On the other hand, if the process has not been completed for all the cells (step S129: No route), the process returns to the process of step S101 (FIG. 22) via the terminal E.

  Next, intranet search processing by the search processing unit 33 of the information search device 3 will be described with reference to FIGS. 24 and 25. First, the search processing unit 33 specifies a cell to be processed (FIG. 24: step S131). For example, when the search range is narrow, since the PC search process is performed before this process, in this process, a cell in which information indicating undetected in the PC search process is set is a cell to be processed. As specified. Then, the search processing unit 33 identifies an unprocessed cell among the cells to be processed, and extracts a search formula corresponding to the specific cell from the search formula storage unit 36 (step S133).

  Then, the search processing unit 33 performs an intranet search based on the extracted search formula (step S135). Specifically, a search expression is output to a predetermined search engine that searches the intranet, and a search result (for example, URL) from the search engine is stored in the work memory 38. Note that settings necessary for the search engine are set in advance.

  Then, the search processing unit 33 determines whether a URL is included in the search result (step S137). When it is determined that the URL is included in the search result (step S137: Yes route), the search processing unit 33 acquires the URL page data and stores a screen shot of the URL page in the search result storage unit 37 (step S1). S139). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the URL page is executed based on the extracted text mining key (step S141).

  Then, the search processing unit 33 determines whether mining data has been detected as the processing result of step S141 (step S143). When the mining data is detected (step S143: Yes route), the process proceeds to the process of step S157 (FIG. 25) via the terminal F. On the other hand, if mining data is not detected (step S143: No route, the search processing unit 33 generates a second search formula by adding the text mining key to the search formula extracted in step S133, and the search formula The data is stored in the storage unit 36 (step S145), and then the process proceeds to step S147 (FIG. 25) via the terminal G.

  On the other hand, if it is determined in step S137 that the URL is not included in the search result (step S137: No route), the process from step S139 to step S143 is skipped, and the process proceeds to step S145.

  Shifting to the description of FIG. 25, after the terminal G, the search processing unit 33 executes an intranet search based on the second search expression (FIG. 25: Step S147). The intranet search is not different from the process in step S135, and thus the description thereof is omitted here.

  Then, the search processing unit 33 determines whether a URL is included in the search result (step S149). When it is determined that the URL is included in the search result (step S149: Yes route), the search processing unit 33 acquires the URL page data and stores a screen shot of the URL page in the search result storage unit 37 (step S1). S151). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the URL page is executed based on the extracted text mining key (step S153).

  Then, the search processing unit 33 determines whether mining data is detected as the processing result of step S153 (step S155). When the mining data is detected (step S155: Yes route), the search processing unit 33 stores the mining data in the search result storage unit 37 as the actual value of the specific cell (step S157).

  On the other hand, when it is determined that the URL is not included in the search result (step S149: No route), or when mining data is not detected (step S155: No route), information indicating non-detection is stored in the search result. The data is stored in the unit 37 (step S159).

  Then, the search processing unit 33 determines whether the processing has been completed for all the cells to be processed (step S161). When the process is completed for all the cells to be processed (step S161: Yes route), the intranet search process is terminated and the process returns to the original process. On the other hand, if the process has not been completed for all the cells to be processed (step S161: No route), the process returns to the process of step S133 (FIG. 24) via the terminal H.

  Next, Internet search processing by the search processing unit 33 of the information search device 3 will be described with reference to FIGS. 26 and 27. FIG. First, the search processing unit 33 specifies a cell to be processed (FIG. 26: step S163). For example, when the search range is narrow, since the PC search process and the intranet search process are performed before this process, in this process, information indicating non-detection is set in the PC search process and the intranet search process. The specified cell is specified as a cell to be processed. Then, the search processing unit 33 identifies an unprocessed cell among the cells to be processed, and extracts a search formula corresponding to the specific cell from the search formula storage unit 36 (step S165).

  Then, the search processing unit 33 performs an Internet search based on the extracted search formula (step S167). Specifically, a search expression is output to a predetermined search engine that searches the Internet, and a search result (for example, URL) from the search engine is stored in the work memory 38. Note that settings necessary for the search engine are set in advance.

  Then, the search processing unit 33 determines whether a URL is included in the search result (step S169). When it is determined that the URL is included in the search result (step S169: Yes route), the search processing unit 33 acquires the URL page data, and stores a screenshot of the URL page in the search result storage unit 37 (step). S171). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the URL page is executed based on the extracted text mining key (step S173).

  Then, the search processing unit 33 determines whether mining data has been detected as the processing result of step S173 (step S175). When the mining data is detected (step S175: Yes route), the process proceeds to step S189 (FIG. 27) via the terminal I. On the other hand, if mining data is not detected (step S175: No route, the search processing unit 33 generates a second search formula by adding the text mining key to the search formula extracted in step S165, and the search formula The data is stored in the storage unit 36 (step S177), and then the process proceeds to step S179 (FIG. 27) via the terminal J.

  On the other hand, if it is determined in step S169 that the URL is not included in the search result (step S169: No route), the process from step S171 to step S175 is skipped, and the process proceeds to step S177.

  Shifting to the description of FIG. 27, after the terminal J, the search processing unit 33 executes an Internet search based on the second search expression (FIG. 27: Step S179). Note that the Internet search is not different from the processing in step S167, and thus the description thereof is omitted here.

  Then, the search processing unit 33 determines whether a URL is included in the search result (step S181). When it is determined that the URL is included in the search result (step S181: Yes route), the search processing unit 33 acquires the URL page data and stores a screen shot of the URL page in the search result storage unit 37 (step S1). S183). Then, a text mining key related to the specific cell is extracted from the work memory 38, and an internal search in the URL page is executed based on the extracted text mining key (step S185).

  Then, the search processing unit 33 determines whether mining data is detected as the processing result of step S185 (step S187). When the mining data is detected (step S187: Yes route), the search processing unit 33 stores the mining data in the search result storage unit 37 as the actual value of the specific cell (step S189).

  On the other hand, when it is determined that the URL is not included in the search result (step S181: No route), or when mining data is not detected (step S187: No route), information indicating non-detection is stored in the search result. The data is stored in the unit 37 (step S191).

  Then, the search processing unit 33 determines whether the processing has been completed for all the cells to be processed (step S193). When the process is completed for all the cells to be processed (step S193: Yes route), the Internet search process is terminated and the process returns to the original process. On the other hand, if the process has not been completed for all the cells to be processed (step S193: No route), the process returns to the process of step S165 (FIG. 26) via the terminal K.

  By performing the processing as described above, it is possible to perform a search based on the automatically generated search expression, and the user can collect necessary information without specifying a search condition for each cell in the table. It becomes like this.

  Although one embodiment of the present invention has been described above, the present invention is not limited to this. For example, the functional block diagram described above does not necessarily correspond to an actual program module configuration. For example, the information search device 3 may be realized by a plurality of computers instead of a single computer.

  Further, the data structure described above is an example, and the above structure is not necessarily required. Furthermore, the screen examples described above are merely examples, and other screen configurations that display similar contents can be employed.

  In addition, regarding the processing flow, if the processing result does not change, the processing order can be changed. Further, it may be executed in parallel.

  The information retrieval device 3 and the user terminal are computer devices as shown in FIG. 28, and are connected to a memory 2501 (storage device), a CPU 2503 (processing device), a hard disk drive (HDD) 2505, and a display device 2509. A display control unit 2507, a drive device 2513 for a removable disk 2511, an input device 2515, and a communication control unit 2517 for connecting to a network are connected by a bus 2519. An operating system (OS: Operating System) and an application program for performing processing in the present embodiment are stored in the HDD 2505, and are read from the HDD 2505 to the memory 2501 when executed by the CPU 2503. If necessary, the CPU 2503 controls the display control unit 2507, the communication control unit 2517, and the drive device 2513 to perform necessary operations. Further, data in the middle of processing is stored in the memory 2501 and stored in the HDD 2505 if necessary. In the embodiment of the present invention, an application program for performing the processing described above is stored in the removable disk 2511 and distributed, and is installed in the HDD 2505 from the drive device 2513. In some cases, the HDD 2505 may be installed via a network such as the Internet and the communication control unit 2517. Such a computer apparatus realizes various functions as described above by organically cooperating hardware such as the CPU 2503 and the memory 2501 described above, the OS, and necessary application programs.

(Appendix 1)
Executed by a computer having a search expression information storage section storing a search expression generation rule for each format of a table composed of one or more item sections and a data section corresponding to the item section, and a search result storage section. An information retrieval method,
Specifying the format of the table, and accepting the input of title data relating to the table and the item name of each of the item parts, and storing it in a storage device;
For each of the data parts, corresponding to the specified format of the table and corresponding to the title data or the title data and the data part according to the search formula generation rules stored in the search formula information storage unit Generating a search expression corresponding to the data part from the item name of the item part;
For each data portion, the search formula corresponding to the data portion is output to a predetermined search engine, and a search result including information indicating the location of data to be set in the data portion is obtained from the predetermined search engine. A search step of storing in the search result storage unit in association with information representing a position in the table of the data unit;
Generating display data by setting information representing the location of the data to be set in each of the data sections based on the data stored in the search result storage section;
Information retrieval method including

(Appendix 2)
For each of the data parts, in accordance with the search expression generation rules stored in the search expression information storage part, a keyword extraction step of extracting a keyword for internal search from the item name of the item part corresponding to the data part;
For each data portion, web page data or a file specified by information indicating the location of the data to be set is acquired, and the web page data is obtained based on the internal search keyword corresponding to the data portion. Or an internal search step to search the file;
The information search method according to appendix 1, further comprising:

(Appendix 3)
If the internal search keyword is not detected in the internal search step, adding the internal search keyword to the search formula corresponding to the data part, and generating a new search formula;
Performing the steps after the search step using the new search formula;
The information search method according to claim 2, further comprising:

(Appendix 4)
The searching step includes
The information search method according to claim 1, further comprising: specifying a search range based on the title data stored in the storage device and the item name of the item part.

(Appendix 5)
The format of the table includes a first format having one of a column item and a row item, a second format having a column item and a row item in one layer, and a column item and a row item in a plurality of layers. The information search method according to appendix 1, wherein the information search method includes a third format.

(Appendix 6)
A specification of a table format including one or more item parts and a data part corresponding to the item part, and input of title data relating to the table and an item name of each item part, and storing in a storage device; ,
For each of the data parts, stored in a search formula information storage unit storing a search formula generation rule for each format of the table, and according to the search formula generation rule corresponding to the specified format of the table, Generating a search expression corresponding to the data portion from the data or the title data and the item name of the item portion corresponding to the data portion;
For each data portion, the search formula corresponding to the data portion is output to a predetermined search engine, and a search result including information indicating the location of data to be set in the data portion is obtained from the predetermined search engine. A search step for storing in the search result storage unit in association with information representing the position in the table of the data unit;
Generating display data by setting information representing the location of the data to be set in each of the data sections based on the data stored in the search result storage section;
Information retrieval program for causing a computer to execute.

(Appendix 7)
Means for receiving a specification of a table format including one or more item parts and a data part corresponding to the item part, and input of title data relating to the table and an item name of each item part, and storing them in a storage device; ,
For each of the data parts, stored in a search formula information storage unit storing a search formula generation rule for each format of the table, and according to the search formula generation rule corresponding to the specified format of the table, Means for generating a search expression corresponding to the data portion from the data or the title data and the item name of the item portion corresponding to the data portion;
For each data portion, the search formula corresponding to the data portion is output to a predetermined search engine, and a search result including information indicating the location of data to be set in the data portion is obtained from the predetermined search engine. Search means for storing in the search result storage unit in association with information representing the position in the table of the data part;
Means for generating display data by setting information representing the location of the data to be set in each of the data sections based on the data stored in the search result storage section;
An information retrieval apparatus having

It is a figure for demonstrating the outline | summary of embodiment of this invention. It is a system configuration figure concerning an embodiment of the invention. (A) And (b) is a figure which shows an example of the data stored in a search result storage part. (A) And (b) is a figure which shows an example of the data stored in a search result storage part. (A) And (b) is a figure which shows an example of the data stored in a search result storage part. It is a figure which shows the example of a template selection screen. It is a figure which shows the processing flow (1st part) of an information search system. It is a figure which shows the example of an item input screen. It is a figure which shows the example of a search content confirmation screen. It is a figure which shows the processing flow (2nd part) of an information search system. It is a figure which shows the processing flow (3rd part) of an information search system. It is a figure which shows the example of a search result screen. It is a figure which shows the example of a search result screen. It is a figure which shows the example of an item input screen. It is a figure which shows the example of a search content confirmation screen. It is a figure which shows the example of a search result screen. It is a figure which shows the example of a search result screen. It is a figure which shows the processing flow of a one-dimensional search expression production | generation process. (A) thru | or (c) is a figure which shows the extraction location of a keyword and a text mining key. It is a figure which shows the processing flow of a two-dimensional search expression production | generation process. It is a figure which shows the processing flow of a multidimensional search expression production | generation process. It is a figure which shows the processing flow (1st part) of PC search processing. It is a figure which shows the processing flow (2nd part) of PC search processing. It is a figure which shows the processing flow (1st part) of an intranet search process. It is a figure which shows the processing flow (2nd part) of an intranet search process. It is a figure which shows the processing flow (1st part) of an internet search process. It is a figure which shows the processing flow (2nd part) of an internet search process. It is a functional block diagram of a computer.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Network 3 Information search device 31 Search template reception part 32 Search expression production | generation part 33 Search processing part 34 Search result display processing part 35 Dictionary storage part 36 Search expression storage part 37 Search result storage part 38 Work memory

Claims (8)

A search related to the data portion corresponding to the first item among the plurality of items is a condition that satisfies both a search condition based on the item name of the first item and a search condition based on the title name. A search condition based on the item name of the second item, and a search condition based on the title name, for a search related to the data part corresponding to the second item among the plurality of items Automatically generating a second search condition that satisfies both conditions,
A search result for the data part corresponding to the first item is acquired by executing a search process according to the generated first search condition, and the search result is acquired according to the generated second search condition. Get the search result for the data part corresponding to the item 2;
An information retrieval program that causes a computer to execute processing. The search result for the data part corresponding to the first item acquired by executing the search process according to the first search condition is information indicating the location of data to be set in the data part corresponding to the first item. And the search result for the data part corresponding to the second item acquired by executing the search process according to the second search condition is the location of the data to be set in the data part corresponding to the second item The information search program according to claim 1, further comprising: information representing The information search program according to claim 1, wherein the search condition based on the title name is generated based on a keyword dictionary in which a character string of the title name and a word as a keyword are registered. The search condition based on the first item name is generated based on a synonym dictionary in which words regarded as synonyms of the first item name are registered, and the search condition based on the second item name is: The information search program according to claim 1, wherein the information search program is generated based on a synonym dictionary in which words that are regarded as synonyms of the second item name are registered. In the process of acquiring search results for the data portion corresponding to the first and second items,
A search is performed using the first search condition in the search range specified from the first search condition, and a search is performed using the second search condition in the search range specified from the second search condition. The information search program according to claim 1, wherein the information search program is executed. The first search condition relating to the data part corresponding to the first item includes a search condition based on the item name of the third item corresponding to the data part corresponding to the first item. 1. The information search program according to 1. A search related to the data portion corresponding to the first item among the plurality of items is a condition that satisfies both a search condition based on the item name of the first item and a search condition based on the title name. A search condition based on the item name of the second item, and a search condition based on the title name, for a search related to the data part corresponding to the second item among the plurality of items Automatically generating a second search condition that satisfies both conditions,
A search result for the data part corresponding to the first item is acquired by executing a search process according to the generated first search condition, and the search result is acquired according to the generated second search condition. Get the search result for the data part corresponding to the item 2;
An information search method, wherein a computer executes a process. A search related to the data portion corresponding to the first item among the plurality of items is a condition that satisfies both a search condition based on the item name of the first item and a search condition based on the title name. A search condition based on the item name of the second item, and a search condition based on the title name, for a search related to the data part corresponding to the second item among the plurality of items A generation unit that automatically generates a second search condition that satisfies both conditions;
A search result for the data part corresponding to the first item is acquired by executing a search process according to the generated first search condition, and the search result is acquired according to the generated second search condition. An acquisition unit for acquiring a search result for the data unit corresponding to the item 2;
An information retrieval apparatus having

Images