JP2004342016A - Information retrieval program and medium having information retrieval program recorded thereon - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a means which eliminates the trouble of keyword registration and can perform retrieval from data collection to be investigated. <P>SOLUTION: Based on the information retrieval program, a CPU extracts a keyword constituting an information block of reference data from a storage means 2. The CPU extracts keywords constituting a plurality of the information blocks from data to be retrieved which is stored in the storage means 2. Further, the CPU displays the keyword extracted from the reference data and the keywords extracted from the data to be retrieved on a display means 4, and allows an investigator to select the correlation of the keywords in the data to be retrieved based on the relationship of their synonymous words or the like. In addition to this, the CPU retrieves similar blocks from the data to be retrieved based on the correlated keywords in the data to be investigated. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a system for investigating a target material, etc., and particularly to an investigator who examines the contents of a document or the like, such as an investigation of an opposition material concerning industrial property rights or a prior application. A system that assists in the investigations that need to be performed and facilitates the investigation work.
[0002]
[Prior art]
2. Description of the Related Art Conventionally, a patent information database search system capable of searching patent information and the like by a machine search has been developed and used. Taking a patent information database as an example, it is constructed by storing patent information generated for each patent application in a storage means of a host computer as a database.
[0003]
In addition, in such a patent information database, in addition to general bibliographic items, various keywords (for example, free keywords, fixed keywords, F-terms, etc.) are stored for each file. It is configured to be able to search for patent information. In addition, recently published patent publications in the form of CD-ROM, and CD-ROMs and the like relating to patent information edited by various manufacturers (hereinafter referred to as electronic patent information) include bibliographic items other than those described above. The specification, abstract, and drawings are also stored as electronic information, and the corresponding patent information can be searched based on various search items.
[0004]
Here, when searching for invalid or opposition materials using the above-mentioned patent information database or electronic patent information, the searcher creates a search formula and looks at the abstract of the contents that hit the search formula. The full text of the official gazette is read as necessary to determine whether it can be used as invalid or opposition material. If the number of hits is small as a result of this search, the user directly looks at the gazette. If the relevant publication is not found, the search formula is re-created and reading the hit publication is repeated. A prior application search for an invention to be filed in the future is also performed in a similar procedure.
[0005]
Here, the process of searching patents will be described in some detail. First, after understanding the contents and features of the present application, the researcher combines the classification symbols, keywords, and the like stored in the above-mentioned patent database and electronic patent information to determine the target technology, for example, from tens to hundreds. A search formula is created so that it is included in the answer set of about cases. Of course, it is only necessary that the number of hits as a result of the search is small, and the desired data is covered in the set of hit data. In many cases, similar technologies in the field are not extracted. For this reason, the researcher usually creates a search formula so that the target technology is included in the set of hit data, typically using the extraction of dozens, at most several hundreds. When a set exceeding several hundreds is created, it takes a lot of time for subsequent screening, and it is difficult to perform an efficient search. However, if one can be sure that the target similar technology has been extracted, the user will read the abstracts, gazettes, etc. of all the hit applications and search for the similar technology. This is done manually. If a similar technique cannot be extracted after reading many gazettes or the like, the search operation is recreated again and the same operation is repeated. Then, the investigation work is continued until it is confirmed that a similar technique cannot be extracted no matter how much search is performed. Especially in the case of publicly known examples, objections, and invalid material surveys, in addition to the time required to create a search formula, the time required for humans to peruse the results of machine search to further examine the contents and to discard them is added. Become. For this reason, it takes a lot of time to complete the survey, and the survey cost is enormous. Even a research expert who is familiar with the classification system and research methods takes a great deal of time to examine and process the results of machine search.
[0006]
By the way, there is a pattern matching as a general search processing method which has been widely used conventionally. This includes keywords and search formulas used for search (hereinafter abbreviated as “search keywords”), and keywords registered for each search unit such as documents and documents (hereinafter abbreviated as “registered keywords”). And whether the search unit is extracted as a search result based on whether the search unit matches (completely or partially). Therefore, if the search keyword and the registered keyword do not match (completely or partially) but have a synonymous relationship (including synonyms and the like), there is a problem that the search cannot be performed. That is, since there are so many terms in the expression of the technical idea, it is very difficult to extract the target similar technology by the machine search processing using pattern matching.
[0007]
As an example of this pattern matching, when a character string “primary key” is specified as a search keyword, the registered keywords such as “primary key”, “key”, and “key item” Since at least a part of the column is included, the keyword is determined to be similar. However, a registered keyword that is a technical synonym such as a “main item” or a “search item” cannot be extracted by searching if a character string “primary key” is specified as a search keyword.
[0008]
Further, since the above-mentioned registered keyword is used for a search action, it must be registered in advance for each search unit such as a document or a document, and the registration is time-consuming. (Hereinafter, this effort is referred to as "keyword registration effort.")
[0009]
As a method of determining a registered keyword, a keyword having a characteristic for each search unit such as a document or a document is partially extracted, or an administrator sets some keywords for each search unit. ing. For this reason, in general, a registered keyword often represents only a part or one side of a search unit of a document or a document. (Hereinafter, this point is referred to as “partial expression of registered keywords.”) For this reason, when a keyword or the like constituting a search unit other than a registered keyword is designated as a search keyword, one of the above-described registered keywords is not included. Due to the partial expression, the search unit is not extracted as a result of the search.
[0010]
Further, as in the case of the above-mentioned "primary key", it is necessary to use registered keywords that are technical synonyms or the like in a unified manner. (Hereinafter, this point is referred to as “necessity of unification of registered keywords.”) As an example of the necessity of unification of registered keywords, when the term “primary key” is used as a registered keyword, The registered keywords “item” and “search item” cannot be used.
[0011]
However, if the unified necessity of registered keywords is not complied with, it is not preferable for searchers who conduct searches, especially when judging the novelty or inventive step of industrial property rights, etc. The points will become more apparent.
[0012]
Here, novelty refers to whether a particular invention is new depending on whether a particular invention and one or more cited inventions to it are identified and a difference is generated by comparing the two. It is a patent requirement to determine whether or not. In the determination of novelty, even if the inventions are conventionally determined to be the same invention (determined as having no novelty) by visually confirming the contents by a researcher, the invention may be referred to as a specific invention. In the case where another technical term or the like having the same meaning is used as a registered keyword, a highly accurate search may not be performed. At the time of filing the application of the present application, the national patent database, which is widespread at the time of filing the application, is provided with F-terms, international patent classifications, FI symbols, and other technical contents as thesaurus symbols. However, since a new invention cannot always be classified into an old technical system, it is difficult to hit the corresponding patent or the like with a complete target even by combining a keyword and a classification symbol. Further, when a paper or a general technical document with few classification symbols is to be investigated, it is difficult to hit an appropriate document by a machine search from a data set narrowed down to a small number. Therefore, it is necessary for the investigator to create a certain number of data sets and examine whether there is a relevant document or the like in the data sets.
[0013]
In addition, inventive step is defined as identifying a particular invention and one or more cited inventions, and comparing the two to clarify the points of coincidence and difference in matters for specifying each invention. , Is a patent requirement determined based on whether or not the difference is easy for those skilled in the art. In the determination of novelty, inventions cited as specific inventions even if the inventions are conventionally determined to be of little difference by visual inspection by a researcher (determined as having no inventive step). However, if another synonymous technical term or the like is used as a registered keyword, appropriate search and extraction may not be performed.
[0014]
In general, there are many creators of documents such as specifications of industrial property rights, etc., and technical terms that have the same and similar meanings as in the example of the above "primary key" are a variety of terms It is expressed by As described above, since the necessity of unifying registered keywords is not taken into consideration, there is an inconvenience that it is extremely difficult to search for the same invention or a similar invention using the conventional search method.
[0015]
Further, when the registered keyword for each search unit is a part or the like constituting the search unit, there is an inconvenience that it is difficult to perform a highly accurate survey due to the partial expression of the registered keyword.
[0016]
For the reasons described above, the emergence of a system that can quickly and accurately extract materials to be investigated, such as reference materials, is desired. In addition, an apparatus that can automatically or simply analyze novelty and inventive step based on specific patent information or the like is desired.
[0017]
In this regard,
In Patent Literature 1, a plurality of pieces of information to be searched are stored in advance in association with some keyword groups included in the plurality of pieces of information, and the keywords of the information to be searched are totaled and displayed. There is disclosed a method of performing a search from a plurality of pieces of information to be searched based on a keyword selected by a researcher from the search results.
[0018]
However, in this method, it is necessary to register the association of the keyword group for each of a plurality of pieces of information to be searched in advance, and the time and effort for registering the keyword cannot be solved. Furthermore, since a specific keyword group included in a plurality of pieces of information is used for a search, the partial expression of registered keywords and the necessity of unifying them cannot be solved.
[0019]
Also,
In Patent Literature 2, a pattern expressing the presence or absence of association with a predetermined keyword group is created for each document unit to be searched, and the pattern is designated by the researcher by designating the pattern. Discloses a method of searching for a document unit having a pattern similar to.
[0020]
However, there is an inconvenience that it is difficult to reuse a past pattern when a predetermined keyword group must be determined in advance, or when the predetermined keyword group is changed on the way. Also,
As in Patent Document 1, it takes time and effort to register a pattern association for each of a plurality of pieces of information to be searched in advance, and the time and effort for keyword registration has not been solved. Further, since a pattern expressing the presence or absence of association with a predetermined keyword group is used for the search, the partial expression of the registered keywords and the necessity of unification cannot be solved.
[0021]
[Patent Document 1]
JP-A-9-73453
[0022]
[Patent Document 2]
JP-A-61-182131
[0023]
[Problems to be solved by the invention]
As described above, in the above-described conventional search method, patent information including a keyword or the like corresponding to the search formula is simply extracted by simply specifying a specific keyword or search formula. For this reason, determination of novelty, inventive step, and the like is generally performed by a researcher actually confirming the contents of the extracted patent information visually or the like. In the case where the number of cases is large, it takes a great deal of time to understand and comprehend the problem. Therefore, there is an inconvenience that it is difficult to appropriately judge the novelty, the inventive step and the like in a short time.
[0024]
In addition, the act of determining an appropriate keyword or search formula according to the data set to be surveyed must be performed by the researcher, and there is a disadvantage that the burden on the researcher is heavy.
[0025]
Furthermore,
[Patent Document 1] and
As a problem which has not been solved even in Patent Document 2, there are the following inconveniences.
[0026]
First, since the trouble of keyword registration has not been solved, there has been a disadvantage that keyword registration must be performed every time data to be investigated is generated.
[0027]
Furthermore, since the expression of some of the registered keywords has not been solved, there has been a problem that it is easy to omit the search and it is difficult to perform a highly accurate search.
[0028]
In addition, if the unified necessity of registered keywords is not considered in the data set to be surveyed, it is difficult to conduct a highly accurate survey because multiple technical terms such as synonyms are used. There was an inconvenience.
[0029]
[Object of the invention]
The present invention relates to such prior art and
[Patent Document 1] and
It is preferable to improve the inconvenience of Patent Literature 2, particularly to solve the trouble of keyword registration and perform a search from the data set to be investigated without the trouble of registering registered keywords in advance. The purpose is to provide means.
[0030]
In addition, in order to solve the partial expression of the registered keywords and to conduct a highly accurate survey, it is intended to provide a suitable means by which a researcher can select an appropriate search keyword according to a data set to be surveyed. And
[0031]
Furthermore, even when the necessity of unifying registered keywords is not considered in the data set to be surveyed, it is preferable that the researcher can appropriately select the technical terms and the like having a relation such as synonyms as search keywords. The purpose is to provide a simple means.
[0032]
[Means for Solving the Problems]
In order to achieve the above object, a system according to the present invention includes storage means for storing reference data including an information block including one or more keywords and search target data including a plurality of information blocks including one or more keywords. ing. Further, the system includes input means for inputting an association between a keyword constituting the reference data and a keyword constituting the search target data. Further, the system includes a computer that executes a process of searching the search target data for a similar information block based on the information block of the reference data. In addition, the system includes a display unit for displaying the search result. In the system as described above, the information search program according to the present invention executes, in the computer, a first extraction step of extracting a keyword constituting an information block of the reference data from the reference data stored in the storage unit. Let it. Further, the program causes the computer to execute, from the search target data stored in the storage means, a step of extracting keywords constituting a plurality of information blocks of the search target data. Further, the program displays on the display means one or more keywords extracted from the reference data and one or more keywords extracted from the search target data, and displays each keyword of the displayed reference data. And causing the investigator to select an association based on a relation such as a synonym of the keyword of the search target data. In addition, the program causes the computer to execute a search step of searching for the similar information block from the search target data based on the keyword of the associated search target data.
[0033]
According to the present invention, the similar information block is searched from the search target data based on the keyword of the search target data, which is associated with each keyword of the reference data. A highly accurate search can be performed. Further, unlike the related art, the researcher can perform a search without registering a keyword for each information block of the search target data. Further, unlike the related art, the researcher can select an appropriate search keyword according to the search target data. In addition, unlike the related art, the researcher can appropriately select a keyword of the search target data, which has a synonymous relationship or the like for each keyword of the reference data, as a search keyword.
[0034]
Also, the information search program according to another invention, wherein the search step is based on a keyword extracted from the reference data and a keyword extracted from search target data associated with each of the keywords. It is characterized in that the similar information block is searched from data.
[0035]
According to the present invention, to search for the similar information block from the search target data based on the keyword of the reference data and the keyword of the search target data associated with each of the keywords, unlike the related art, Researchers can perform more accurate searches.
[0036]
Furthermore, an information search program according to another invention is characterized in that the first extraction step includes a step of receiving from the input means that a researcher edits a keyword extracted from the reference data.
[0037]
According to the present invention, by editing the keywords of the reference data by a researcher,
Unlike before, the researcher can perform a search with higher accuracy.
[0038]
Further, the information search program according to another invention is characterized in that the first extracting step includes a step of receiving from the input means that the investigator discards a keyword extracted from the reference data.
[0039]
According to the present invention, the keyword of the reference data is discarded by a researcher,
Unlike before, the researcher can perform a search with higher accuracy.
[0040]
Furthermore, an information search program according to another invention includes a step of causing the computer to accept, from each investigator, an association with a weight indicating importance in search processing for each keyword extracted from the reference data. And searching the similar information block from the search target data based on the keyword extracted from the search target data and the weight associated with each keyword of the reference data. Is performed.
[0041]
According to the present invention, the similar information block is searched from the search target data based on the keyword of the search target data and the weight associated with each keyword of the reference data. This enables the researcher to perform a search with higher accuracy. Further, unlike the related art, since the search result is corrected by weighting, a more detailed search can be performed.
[0042]
Further, the information search program according to another invention includes a step of, when the search step searches for similar information blocks from the search target data, adding information indicating the degree of similarity to each information block. Then, the program causes the computer to execute a step of displaying the search results in the order of the similarity.
[0043]
According to the present invention, the search results are displayed in the order of the similarity, so that the researcher can easily understand the search results. Further, unlike the related art, the researcher can easily access the individual breakdown of the search result.
[0044]
Further, in the information search program according to another invention, the information block of the reference data is specific patent application information, and the plurality of information blocks of the search target data is a plurality of patent application information or technical literature information. It is characterized by having.
[0045]
According to the present invention, for specific patent application information which is an information block of the reference data, similar patent application information is obtained from a plurality of patent application information or a plurality of technical documents which are a plurality of information blocks of the search target data. Alternatively, it becomes possible to search for technical documents. As a result, unlike the related art, it is possible to reduce the research time spent by the researcher and reduce the burden.
[0046]
An information search program according to another invention is characterized in that the information block of the reference data is one or more claims of a specific patent application.
[0047]
According to the present invention, for one or more claims of a specific patent application or the like, which is an information block of the reference data, from a plurality of patent application information or scientific and technical literature which is a plurality of information blocks of the search target data, It will be possible to search for similar patent application information or scientific and technical literature. As a result, unlike the related art, it is possible to search for similar patent application information or scientific and technical literature for each claim.
[0048]
Further, in the information search program according to another invention, when the information block of the reference data, which is one or more claims of a specific patent application, is a dependent claim, the first extraction step refers to the dependent claim. And adding the independent term to the information block of the reference data.
[0049]
According to the present invention, when the information block of the reference data, which is one or more claims of a specific patent application, is a dependent claim, an independent claim cited by the dependent claim is added to the information block of the reference data. It becomes possible. Thus, unlike the related art, even if the information block of the reference data is a dependent claim, similar patent application information or scientific and technical literature can be searched for each claim.
[0050]
This aims to achieve the above-mentioned object.
[0051]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, an embodiment of the present invention will be described with reference to FIGS.
[0052]
FIG. 1 is a configuration diagram of an information search system according to an embodiment of the present invention. As shown in FIG. 1, the information search system 1 includes a storage unit 2, an input unit 3, a display unit 4, and a computer 5 for controlling these. These means and the computer 5 are connected to each other, and the information search function 15 is realized by cooperating while transmitting and receiving data. The storage unit 2 stores reference data 21 serving as a reference for a search process and search target data 22 serving as a search target of the reference data.
[0053]
Next, the storage unit 2 in FIG. 1 and the reference data 21 and the search target data 22 stored therein are shown in detail in a detailed view of the storage unit 2 in FIG. Here, the reference data 21 includes an information block 21a including a plurality of keywords. In addition, the search target data 22 includes a plurality of information blocks 22a including a plurality of keywords. The search target data 22 is search data narrowed down by a researcher in advance by using a keyword, a classification symbol, or the like in a search formula, but if the number is originally small, data that is not narrowed down by the researcher is used. I do.
[0054]
Here, the keyword included in the reference data 21 and the keyword included in the search target data 22 are composed of one or more words, symbols, numerical values, and the like, or a combination thereof. Examples of this include a "key item", a "system", a "search result", and the like. Further, in FIG. 2, the keyword a included in the reference data 21 and the keyword a ′ included in the search target data 22 have a relationship of synonyms and the like (including synonyms and the like). Similarly, the keyword b included in the reference data 21 and the keyword b ′ included in the search target data 22 have a relationship such as a synonym. The relation between synonyms and the like here means that the keywords are synonymous and the like, like the relation between the above-mentioned “primary key” and “main item” or “search item”.
[0055]
Further, the information block 21a of the reference data represents an information unit serving as a reference for information search. The information blocks to be searched for in the information block 21a of the reference data are the information blocks 22a included in the search target data 22 in plurality. Here, the information search function 15 described above allows the computer 5 to generate a reference data information block 21a based on the keyword of the reference data 21 and / or the keyword of the search target data 22 having a synonymous relationship with the keyword. This function determines the information block 22a of similar search target data. It is desirable that the information block 21a of the reference data and the information block 22a of the search target data be divided for each document or document. In this case, based on the information block 21a of the reference data, which is the specific document, the information search function 15 determines the information block 22a of the search target data, which is a similar document to the specific document.
[0056]
Next, FIG. 3 is a block diagram in a case where the information search system of FIG. 1 is applied to a personal computer. Here, the storage means 2 in FIG. 1 corresponds to the memory 6 or the hard disk 10, the input means 3 corresponds to the keyboard 9 or the like, the display means 4 corresponds to the display 7, and the computer 5 corresponds to the CPU 8. The components are connected by a bus 13 so that they can communicate with each other. The reference data 21 and the search target data 22 stored in the storage unit 2 in FIG. 1 are stored in the hard disk 10 as the reference data 11 and the search target data 12 in a format such as a file or a database. Similarly, the information search function 15 is stored in the hard disk 10 as the information search program 14. Then, in the system in FIG. 3, the CPU 8 interprets the information search program 14 to perform calculation processing and control each component. When the CPU 8 interprets and executes the information search program 14, it reads the information search program 14, data, and the like from the hard disk 10 into the memory 6.
[0057]
Here, the keyboard and the like 9 include a mouse and the like generally used in personal computers. The display 7 is a CRT display, a liquid crystal display, or the like. Further, the illustrated keyword 11a of the reference data conceptually indicates that the keyword included in the reference data 11 has been extracted by the CPU 8 and read into the memory 6. The same applies to the keyword 12a of the search target data.
[0058]
Next, the operation of each component in the present embodiment will be described with reference to the flowchart of FIG.
[0059]
When a person who intends to conduct a survey using the information search system of FIG. 3 (hereinafter abbreviated as “surveyor”) inputs a survey start command using a keyboard or the like 9 as input means, the CPU 8 receives the command. The command is interpreted and the information search program 14 is started.
[0060]
Here, the CPU 8 interprets and executes the activated information search program 14, whereby the four processes shown in the flowchart of FIG. 4 are performed. The four processes include a first extraction step S1 for extracting a keyword from the reference data, a step S2 for extracting a keyword from the search target data, and an association between the reference data keyword and the search target data keyword. Step S3 and step S4 of searching for an information block of the search target data based on the associated keyword of the search target data. The information search function 15 is realized by the above four processes. Also, a first extraction step S1 for extracting a keyword from the reference data and a step S2 for extracting a keyword from the search target data are processed in separate steps in advance, and the execution of the information search program 14 immediately starts the reference. The process can also proceed from step S3 in which the association between the data keyword and the search target data keyword is selected.
[0061]
The outline of each step of S1 to S4 will be described below first.
[0062]
First, the first extraction step S1 of extracting keywords from the reference data is a step of extracting a plurality of keywords constituting an information block included in the reference data 11 stored on the hard disk 10. The keywords extracted in this step are used in S3 and S4. Hereinafter, the first extraction step S1 of extracting a keyword from the reference data is abbreviated as “first extraction step from the reference data”.
[0063]
Next, the step S2 of extracting a keyword from the search target data is a step of extracting a plurality of keywords constituting a plurality of information blocks included in the search target data 12 stored in the hard disk 10. The keywords extracted in this step are used in S3 and S4. Hereinafter, step S2 of extracting a keyword from search target data is abbreviated as “extraction step from search target data”.
[0064]
Subsequently, the step S3 of selecting the association between the keyword of the reference data and the keyword of the search target data includes associating the keyword extracted from the reference data 11 in S1 with the keyword extracted from the search target data 12 in S2. Is a step for making the researcher select. The association selected by this step is used in S4. Hereinafter, Step S3 for selecting the association between the keyword of the reference data and the keyword of the search target data is abbreviated as “association selection step”.
[0065]
Subsequently, the step S4 of searching for the information block of the search target data based on the keyword of the associated search target data includes the step of searching for the information block of the reference data 11 based on the keyword of the search target data 12 associated in S3. In this step, a similar information block of the search target data 12 is searched. In this search step, it is determined whether or not each information block of the search target data 12 is similar to the information block of the reference data 11. Hereinafter, step S4 of searching the information block of the search target data based on the keyword of the associated search target data is abbreviated as “search step”.
[0066]
The above is the outline of each step of S1 to S4, and each step will be described in detail below.
[0067]
First, in the first extraction step S1 from the reference data, the CPU 8 interprets and executes the information search program 14 to perform the processing of S11 to S15 shown in the flowchart of FIG. Hereinafter, based on the flowchart of FIG. 5, each process of S11 to S15 will be described.
[0068]
First, in S11, the CPU 8 displays the reference data input screen 30 of FIG. 7 on the display 7, and waits for a reference data input command from the researcher. Here, the investigator uses the keyboard 9 or the like to instruct reading of the reference data through the reference data reading button 34. Further, the researcher also specifies information for specifying reference data such as a path and a file name. Then, the CPU 8 receives the instruction of reading the reference data from the investigator, and displays the designated reference data on the reference data display unit 33. Further, the CPU 8 analyzes the reference data, divides the reference data into each claim by the character “Claim” or a symbol with black brackets, and displays a list of claims on the claim list display unit 31. . An example of the reference data input by the researcher is a specification such as a patent. Further, as an example of such a process of accepting reference data, when the investigator specifies the data shown in FIG. 8 as reference data, the reference data input screen 30 is in a state as shown in FIG.
[0069]
Next, when the input screen of FIG. 9 is displayed, the CPU 8 displays an input screen of FIG. Wait for. Here, the researcher instructs selection of one or more claims by double-clicking each claim in the claim list display section 31 using the keyboard 9 or the like. Then, the CPU 8 receives an instruction for selecting a claim from the investigator, extracts data of the specified claim from the reference data display unit 33, and displays the data on the selected claim display unit 32.
[0070]
At the time of this extraction and display processing, the CPU 8 executes a branch determination S12 of determining whether or not a dependent claim is included in one or more claims selected by a previous claimer's instruction for claim selection. Is Here, whether or not a dependent claim is included is determined in the claim data extracted from the reference data display unit 33 by another claim such as a character of “claim” or a character of “claims 1 to 3”. Is determined based on whether or not is cited. If the CPU 8 determines in the step S12 that a dependent claim is included, the data of the claim cited by the dependent claim is also extracted from the reference data display section 33 and is also displayed on the selected claim display section 32. (S13). In this S13, when the claim cited by the dependent claim further cites another claim (when it is a dependent item of another claim), the data of the cited claim is also used. In addition, it is displayed on the selected claim display section 32. Such processing is repeated until the cited claim becomes an independent claim. As an example of the dependent item determination S12 as described above, when the researcher specifies “Claim 2” from the claim list display section 31 on the reference data input screen 30 in the state of FIG. The state shown in FIG. 10 is obtained, and the data of claims 1 and 2 are reflected. In this way, the claimant's instruction to select a claim is reflected in the selected claim display section 32. The claim data displayed on the selected claim display section 32 represents an information block of reference data, which is an information unit serving as an information search reference in the information search function.
[0071]
Then, the investigator can edit the claim data displayed on the selected claim display section 32 using the keyboard 9 or the like on the reference data input screen 30 of FIG. That is, it is possible to add or delete characters, symbols, and the like to the claim data displayed on the selected claim display section 32.
[0072]
Subsequently, in the reference data input screen 30 of FIG. 10, the researcher instructs the extraction of keywords from the information block of the reference data by, for example, clicking the keyword extraction button 35 using the keyboard 9 or the like. Then, the CPU 8 receives the keyword extraction instruction from the researcher, and divides the claim data displayed on the selected claim display section 32 into keywords (S14). As a method of this division, there is a method in which the CPU 8 divides each particle or blank character included in the claim data into keywords. As an example of such a keyword division, the claim data displayed on the selected claim display section 32 on the input screen of FIG. 10 is divided into keywords as a divided keyword list 37 shown in FIG.
[0073]
When the claim data is divided into keywords, the CPU 8 displays the search condition determination screen 40 of FIG. 12 on the display 7, displays the claim data on the claim data display section 42, and displays the divided keyword list 37 on the keyword list display section 43. (S15). In the search condition determination screen 40 of FIG. 12, the investigator can edit the claim data displayed on the claim data display section 42 using the keyboard 9 or the like. That is, characters or symbols can be added to or deleted from the claim data displayed on the claim data display unit 42. Here, when the claim data displayed on the claim data display section 42 is edited, the investigator can use the keyboard 9 or the like to click the keyword re-extraction button 41, and the like. Can be re-extracted, and the extracted keyword list can be re-displayed on the keyword list display section 43.
[0074]
In this way, when displaying the list of keywords on the keyword list display section 43, the CPU 8 waits for a researcher's keyword selection instruction, which is an instruction of a keyword to be used among the keywords. Here, the investigator instructs selection of one or more keywords by using the keyboard 9 or the like and double-clicking each keyword in the keyword list display section 43. Then, the CPU 8 receives the instruction of the researcher to select a keyword, extracts the specified keyword from the keyword list display unit 43, and displays the extracted keyword in the column of the components of the search condition display unit 48. As described above, when the researcher sequentially clicks, for example, each of the keywords “key item”, “order”, and “search result” from the keyword list display unit 43, the configuration of the search condition display unit 48 as shown in FIG. The selected keyword is displayed in the element column. In this case, it is appropriate that the keyword selected by the researcher is not all of the keywords displayed in the keyword list display section 43, but one that indicates the features of the invention. As described above, the discarding and editing of the keyword are determined solely by the researcher, and are not automatically determined by the information search program 14.
[0075]
The above is the description of each process in the first extraction step S1 from the reference data. Here, each keyword displayed in the column of the component of the search condition display unit 48 in FIG. 13 is a keyword extracted in the first extraction step S1 from the reference data. Hereinafter, the extraction step S2 from the search target data will be described.
[0076]
Also in the extraction step S2 from the search target data, the following processing is performed by the CPU 8 interpreting and executing the information search program 14. First, the CPU 8 receives input of search target data to be searched for the reference data received in S1 from the researcher through the keyboard 9 or the like. Examples of the search target data include a plurality of patent publications, and in that case, the patent publications for each application are individual information blocks in the search target data. Further, as described above, each information block in the search target data is an information unit whose similarity to the information block of the reference data is determined.
[0077]
Then, the CPU 8 divides the search target data input by the researcher into keywords as in S14 in the first extraction step S1 from the reference data described above. As a method of this division, there is a method in which the CPU 8 divides each particle or blank character included in the search target data into keywords. FIG. 14 illustrates the keyword list 38 of the search target data divided in the extraction step S2 from the search target data as described above. Here, the keywords displayed in FIG. 14 are the keywords extracted in the extraction step S2 from the search target data.
[0078]
The above is the description of each process in the extraction step S2 from the search target data. In the extraction step S2 from the search target data, the researcher only specifies the search target data, and the other processing is performed based on the information search program 14. Therefore, there is no inconvenience even if the information search program 14 performs the first extraction step S1 from the reference data after the extraction step S2 from the search target data. That is, the first extraction step S1 from the reference data and the extraction step S2 from the search target data are in no particular order. Hereinafter, the association selection step S3 will be described.
[0079]
Also in this association selection step S3, the following processing is performed by the CPU 8 interpreting and executing the information search program 14. Here, after S1 and S2, the search condition determination screen 40 of FIG. 13 is displayed on the display 7, and the CPU 8 waits for an association selection command from the researcher. Here, the researcher uses the keyboard 9 or the like to select an arbitrary keyword (hereinafter abbreviated as “optional keyword”) from the keywords displayed in the component column of the search condition display unit 48. By clicking the synonym button 44 or the like, an instruction to display an association selection screen is issued. Upon detecting this, the CPU 8 extracts the arbitrary keyword data from the search condition display section 48 and displays the association selection screen 50 previously held by the information search program 14 on the display 7. (See below)
[0080]
The association selection screen 50 has a target keyword display section 51, a hit keyword list display section 52, a non-hit keyword list display section 53, and an association execution button 54. Here, the target keyword display section 51 is a section for displaying an arbitrary keyword, which is previously selected from the column of the components of the search condition display section 48 by the researcher. In the association selection screen 50 of FIG. 15, it can be seen that “key item” has been selected as an arbitrary keyword. The hit keyword list display section 52 is a part that displays a list of hit keywords as a result of performing a search on the keywords extracted in S2 using an arbitrary keyword as a search key. Further, the non-hit keyword list display section 53 is a part that displays a list of keywords that did not hit as a result of performing a search on the keywords extracted in S2 using an arbitrary keyword as a search key. The above-described general pattern matching is used as a search method for the keyword extracted in S2. As a result, the keywords extracted in S2 are sorted and displayed on one of the hit keyword list display section 52 and the non-hit keyword list display section 53, respectively. This sorting process is determined based on the similarity criteria selected by the researcher. As shown in FIG. 15, the association selection screen 50 includes a plurality of radio buttons so that the researcher can select a similarity criterion. The association selection screen 50 of FIG. 15 has three radio buttons of similarity (weak), (medium), and (strong), and can select a similarity criterion according to which radio button the investigator selects. . As an example of keyword distribution based on this similarity criterion, when the similarity criterion is set to (strong) for an arbitrary key “primary key”, the characters “primary key” in the keywords extracted in S2 are completely May be displayed on the hit keyword list display section 52. Similarly, when the similarity criterion is set to (weak) for an arbitrary key “primary key”, a part of the character “primary key” (for example, “primary” or “primary key”) in the keywords extracted in S2 Key ") is displayed on the hit keyword list display section 52.
[0081]
When the previous association selection screen 50 is displayed on the display 7, the CPU 8 displays the previously extracted arbitrary keyword data on the target keyword display section 51. Further, the CPU 8 reads the similarity criterion initially set by the information search program 14 and the keyword extracted in S2, and executes the pattern extraction based on the similarity criterion based on the similarity criterion to extract the keyword extracted in S2. The hit keyword list display section 52 and the non-hit keyword list display section 53 are displayed separately. The reason for providing such a similarity criterion is that if the search target data contains many keywords similar to the keyword selected as a component, only the keywords having a high degree of similarity are displayed on the hit keyword list display section 52. This is so that the researcher can immediately select a required search keyword. Therefore, when there is almost no keyword similar to the keyword selected as a constituent element in the search target data, a keyword including a keyword having a low similarity is displayed on the hit keyword list display section 52 so that the researcher can select the keyword. . Further, one of the radio buttons can be selected by the information search program 14 so that the number of keywords displayed on the hit keyword list display section 52 is within a certain range.
[0082]
When the investigator uses the keyboard 9 or the like to select a similarity criterion selection radio button on the association selection screen 50 and changes the similarity criterion, the CPU 8 re-starts based on the similarity criterion. The keywords extracted in S2 are read and sorted and displayed on the hit keyword list display section 52 and the non-hit keyword list display section 53 by the pattern matching. In this way, the investigator can change the similarity criterion initially set by the information search program 14.
[0083]
Subsequently, using the keyboard 9 or the like, the researcher uses the target keyword display unit 51 in the keyword list extracted in S2 displayed on the hit keyword list display unit 52 and the non-hit keyword list display unit 53. Is selected as a keyword considered to have a synonymous relationship with the arbitrary keyword displayed in. As a selection method, there is a method of selecting by checking a check box provided for each keyword displayed on the hit keyword list display section 52 and the non-hit keyword list display section 53. Normally, the keyword selected by the researcher as a component is not displayed in the hit keyword list display section 52. The keyword selected by the investigator as a constituent element is not displayed, but is processed as if it were selected by the investigator. If the keyword selected by the researcher as a component is also displayed, the researcher can check the presence or absence of the selected component in the search target data. Upon detecting this check, the CPU 8 stores the association between the arbitrary keyword and the checked keyword. When the check is released, the CPU 8 deletes the association between the arbitrary keyword and the keyword whose check is released. Taking the association selection screen 50 of FIG. 15 as an example, for the “key item” which is an arbitrary keyword, “search key”, “search item”, and “characteristic portion” are keyword-selected, and the association is stored. Is in a state of being
[0084]
As described above, by using the keyboard 9 or the like, the researcher selects a keyword considered to be in a relationship such as an arbitrary keyword and a synonym, and clicks the association execution button 54 on the association selection screen 50. The association and storage of another keyword with the arbitrary keyword is performed. In response to this, the CPU 8 saves the association, and sets another keyword associated with the arbitrary keyword in the row of the arbitrary keyword in the search condition display unit 48 on the search condition determination screen 40, and the synonym item Are displayed in the area that intersects the column of. As an example of this, in the search condition display section 48 on the search condition determination screen 40 in FIG. 16, three keywords of “search key”, “search item”, and “characteristic portion” are added to an arbitrary keyword of “key item”. However, this indicates that two keywords “procedure” and “order” are associated with the arbitrary keyword “order”, respectively. At the same time, the search condition display section 48 on the search condition determination screen 40 in FIG. 16 shows that no keyword is associated with any keyword “search result”. As described above, when there is no associated keyword for the arbitrary keyword, the search of the search database is performed using only the phrase selected as a component, that is, in this case, the keyword of “search result”. (See below)
[0085]
The above is the description of each process in the association selection step S3. Here, for each of the optional keywords displayed in the column of the constituent elements of the search condition display unit 48 in FIG. 16, the keyword displayed in the synonym item of the row for each of the optional keywords is replaced with the optional keyword in S3. It is a keyword of search target data associated with each search. Hereinafter, the search step S4 will be described.
[0086]
Also in this search step S4, the following processing is performed by the CPU 8 interpreting and executing the information search program 14. Here, the search step S4 is made up of the processes of S41 to S43 shown in the flowchart of FIG. Hereinafter, based on the flowchart of FIG. 6, each process of S41 to S43 will be described.
[0087]
First, on the search condition determination screen 40 of FIG. 16, the CPU 8 issues a weighting instruction of the investigator, which is an instruction for weighting each arbitrary keyword displayed in the column of the components of the search condition display unit 48. wait. Here, the researcher selects the keyword by using the keyboard 9 or the like, for example, by clicking each keyword displayed in the column of the component of the search condition display unit 48, and then operates the weighting meter 45. Or inputting a numerical value from a keyboard or the like 9 to give a weighting instruction. Here, as shown in FIG. 16, the weighting meter 45 is configured so that the value indicated by the weighting indicator can be selected from numerical values in a specific range by operating the center weighting indicator to the left or right. . When receiving the weighting instruction from the researcher, the CPU 8 displays the value indicated by the weighting meter 45 in the column of weight in the row of the corresponding keyword in the search condition display unit 48 (S41). As an example, in the search condition determination screen 40 of FIG. 16, “8” is assigned to an optional keyword “key item”, “6” is assigned to an optional keyword “order”, and an optional keyword “search result” is assigned. In the case where “3” is weighted by the investigator, the search condition determination screen 40 is in a state as shown in FIG. In addition, if the initial values are automatically set by the information search program 14 for the keywords that are not specified by the investigator and that are displayed in the column of the constituent elements of the search condition display unit 48, it is easy for the investigator. It is desirable.
[0088]
Here, the weighting step S41 by the investigator is included in S4 for convenience of description, but may be present at the end of S1, or in another step of S2 or S3. When displayed on the search condition determination screen 40, the investigator can save the various data displayed on the search condition determination screen 40 or read the previously stored various data at an appropriate time. For example, when the researcher clicks the setting save button 46 on the search condition determination screen 40 using the keyboard 9 or the like, the CPU 8 stores the various data displayed on the search condition determination screen 40 on the hard disk 10. To save. When the researcher clicks the setting read button 47 on the search condition determination screen 40 using the keyboard 9 or the like and specifies a setting file, the CPU 8 transfers the setting file from the hard disk 10 to the memory 6. The contents of the setting file are displayed on the read / search condition determination screen 40.
[0089]
Next, the CPU 8 waits for a search start command of the investigator, which is a search start instruction for performing similarity determination for each information block of the search target data based on the conditions of the search condition display unit 48. Here, the researcher instructs to start the search by using the keyboard or the like 9 and clicking the search start button 49 on the search condition determination screen 40 or the like. Then, the CPU 8 receives the search start instruction from the researcher and extracts the search condition data displayed on the search condition display section 48. As an example of this, when a search start instruction is given from a researcher in the state of the search condition determination screen 40 in FIG. 17, search condition data 60 as shown in FIG. 18 is extracted. Here, a new management number column exists in the search condition data 60, which is given a management number in order to make each record of the search condition data 60 unique.
[0090]
Subsequently, the CPU 8 performs a similarity determination for each information block of the search target data based on the search condition data 60 (S42). As the similarity determination method, in the search condition data 60, the number of synonyms for a specific component is N and a specific information block (hereinafter, referred to as a “specific information block”) of the search target data is used. If the search using N keywords results in M hits, the score of the specific information block for that component is recorded as “(M / N) * weight” for each specific information block. . Similarly, the same search and recording are performed for the other components “order” and “search result”. Finally, the scores for each component are totaled for each specific information block, and are set as the similarity score of the specific information block.
[0091]
For example, in the search condition data 60 shown in FIG. 18, in the row where the component is “key item”, the number of synonyms is three (“search key”, “search item”, and “characteristic part”). The number of N becomes N = 4 by adding the “key item” selected as a constituent element. On the other hand, in a certain information block of the search target data, when the information block is searched using “search key”, “search item”, “characteristic part”, and “key item” as search keywords, “search key” , "Search item", "characteristic part", and "key item", it is found that M = 4, and from the search condition data 60 shown in FIG. It can be seen that the weight of the “key item” is 8. Therefore, the score of a row whose constituent element in this specific information block is “key item” becomes “(4/4) * 8” when substituted into the expression of “(M / N) * weight”, and the solution of this expression is It turns out that it is "8". Similarly, the score is calculated in the specific information block also in the row having the component “order” and the row having the “search result”. Then, the total score (similarity score) of the specific information block is calculated by summing the scores calculated for each row of the above three components. Here, the scores calculated for each row of the three constituent elements are simply totaled. However, it is possible to correct the total score by calculating the product of the scores calculated for each row of the three component requirements. it can. However, since similarity is calculated for sentences such as patent specifications and technical documents that can express the same technology with a wide range of synonyms, there is almost no meaning in strictly determining the score calculation method, and various calculation methods can be adopted. .
[0092]
In step S42, the number (N-1) not including the specific component in N, which is the number of synonyms for a specific component in the search condition data 60, may be set as N. For example, in the search condition data 60 shown in FIG. 18, in the row where the component is “key item”, the number of synonyms is three (“search key”, “search item”, and “characteristic part”). N = 3, and the above S42 is performed using the three keywords selected by the researcher as search keywords. As described above, by not using the component itself as a keyword, it is possible to perform the similarity determination using only the keyword in the search reference data.
[0093]
In this way, when calculating the similarity score for each information block of the search target data based on the search condition data 60, the CPU 8 sorts the information blocks of the search target data in descending order of the similarity score, and displays 7 is displayed in a list (S43). As an example of this, there is a display method as shown in FIG. In the information block similarity order list 70 of the search information data in FIG. 19, the value of the item of “document number” means the initial display order of the information block, and the value of the item of “score order” indicates the value of the information. It means the total scoring order of the blocks. For example, from the line of the information block whose “document number” is “373”, it is the information block initially displayed on the 373rd line, and it can be seen that the total score was the highest compared to the other information blocks. . Similarly, from the line of the information block where the “document number” is “373”, the “public number” is “H03-1234” and the “public date” is “H03 / 10/10” In addition, it can be read that the "title of the invention" is "A system". Further, the item of “link” holds identification information of individual information block data such as a path and a file name. Thus, when the researcher uses the keyboard 9 or the like to select an individual information block on the information block similarity order list 70, the CPU 8 can immediately display the information block on the display 7.
[0094]
Through S43 as described above, the researcher can recognize the information blocks of the search target data having a high similarity score with respect to the information blocks of the reference data in the order of the similarity score.
[0095]
As described above, according to the present embodiment, for each keyword extracted from the reference data, a plurality of keywords extracted from the search reference data can be related, and based on the keyword from the related search reference data. Therefore, since the information block of the search reference data can be searched, there is an effect that the target information block can be reliably searched and extracted without fail. Therefore, the investigator can view the contents included in the search reference data in the order of attention, in units of information blocks, and can greatly reduce the time required for the reading investigation.
[0096]
【The invention's effect】
Since the present invention is configured and functions as described above, according to this, for each keyword extracted from the reference data, the keyword extracted from the search target data can be associated, and the keyword from the associated search target data can be used. The similarity can be determined for each information block of the search target data based on the keyword.
[0097]
Further, it is not necessary to register a search keyword in advance for each information block of the search target data, and all the search target data can be set as a keyword target.
[0098]
Furthermore, even in the case where the unified necessity of registered keywords is not considered in the search target data, the researcher can appropriately select a technical term or the like having a relation such as a synonym as a search keyword.
[0099]
In addition, for each keyword extracted from the reference data, the similarity determination can be adjusted by assigning a weight to the keyword extracted from the associated search target data by the researcher.
[0100]
In view of the above points, it is possible to conduct more detailed investigations than before, and there is an effect that it is possible to reliably search and extract a target information block from search target data without fail, which is an unprecedented superior information search. A system can be provided.
[Brief description of the drawings]
FIG. 1 is a configuration diagram of an information search system according to an embodiment of the present invention.
FIG. 2 is a detailed diagram of a storage unit 2 in FIG.
FIG. 3 is a block diagram when the information search system of FIG. 1 is applied to a personal computer.
FIG. 4 is a flowchart illustrating a process of the information search system.
FIG. 5 is a detailed flowchart of S1 in FIG. 4;
FIG. 6 is a detailed flowchart of S4 in FIG. 4;
7 is a screen diagram of a reference data input screen 30. FIG.
FIG. 8 is a data example of reference data.
FIG. 9 is a screen diagram of a reference data input screen 30.
FIG. 10 is a screen diagram of a reference data input screen 30.
FIG. 11 is a keyword list obtained by dividing reference data into keywords.
FIG. 12 is a screen diagram of a search condition determination screen 40.
FIG. 13 is a screen diagram of a search condition determination screen 40.
FIG. 14 is a keyword list diagram in which search target data is divided into keywords.
15 is a screen diagram of an association selection screen 50. FIG.
16 is a screen diagram of a search condition determination screen 40. FIG.
17 is a screen diagram of a search condition determination screen 40. FIG.
18 is a data example of search condition data 60. FIG.
FIG. 19 is a display example of an information block similarity order list 70 of search information data.
[Explanation of symbols]
1 Information search system
2 storage means
3 Input means
4 Display means
5 Computer
6 memory
7 Display
8 CPU
9 Keyboard, etc.
10 Hard disk
11 Reference data
11a Keywords for reference data
12 Search target data
12a Keywords for search target data
13 bus
14 Information Search Program
15 Information search function
21 Reference data
21a Information block of reference data
22 Search target data
22a Information block of search target data
30 Reference data input screen
31 Claim list display section
32 Selected claim display section
33 Reference data display
34 Reference data read button
35 Keyword extraction button
36 Reference data
37 List of split keywords
38 Keyword list of search target data
40 Search condition determination screen
41 Keyword re-extraction button
42 Claim data display section
43 Keyword list display section
44 Synonym Button
45 Weighting meter
46 Setting save button
47 Setting read button
48 Search condition display area
49 Search start button
50 Association selection screen
51 Target keyword list display area
52 Hit keyword list display area
53 Non-hit keyword list display area
54 Association execution button
60 Search condition data
70 Information block similarity order list of search information data

Claims (10)

Storage means for storing reference data including an information block including one or more keywords and search target data including a plurality of information blocks including one or more keywords;
Input means for inputting the association between the keyword constituting the reference data and the keyword constituting the search target data,
A computer that executes a process of searching for a similar information block from the search target data based on the information block of the reference data,
And a display means for displaying the search result.
To the computer,
A first extraction step of extracting a keyword constituting an information block of the reference data from the reference data stored in the storage unit;
Extracting a keyword constituting a plurality of information blocks of the search target data from the search target data stored in the storage unit;
One or more keywords extracted from the reference data and one or more keywords extracted from the search target data are displayed on the display means, and for each keyword of the displayed reference data, the search target data is displayed. Allowing the investigator to select an association by synonymous relationship or the like of the keywords of the researcher;
A search step of searching for the similar information block from the search target data based on the associated keyword of the search target data. The information search program according to claim 1,
The search step includes:
An information search method for searching for the similar information block from the search target data based on a keyword extracted from the reference data and a keyword extracted from search target data associated with each keyword; program. The information search program according to claim 2,
The first extracting step includes:
An information search program characterized by including a step of accepting, from the input unit, that a researcher edits a keyword extracted from the reference data. The information search program according to claim 2,
The first extracting step includes:
An information search program characterized by including a step of receiving from an input unit that a researcher discards a keyword extracted from the reference data. The information search program according to claim 1,
Said computer,
A step of receiving an association with a weight representing the importance in search processing from a researcher for each keyword extracted from the reference data,
The searching step executes a step of searching for the similar information block from the search target data based on the keyword extracted from the search target data and the weight associated with each keyword of the reference data. An information search program characterized by the following. The information search program according to claim 1, wherein:
The search step includes:
When a similar information block is searched from the search target data, including a step of giving information indicating the degree of similarity for each information block,
To the computer,
An information search program for executing a step of displaying the search results in the order of the similarity. 7. The information search program according to claim 1, wherein
The information block of the reference data is specific patent application information,
An information search program characterized in that a plurality of information blocks of the search target data are a plurality of patent or other application information or scientific and technical literature information. The information search program according to claim 7,
An information search program wherein the information block of the reference data is one or more claims of a specific patent application. The information search program according to claim 8,
If the information block of the reference data, which is one or more claims of a particular patent application, is a dependent claim,
The first extracting step includes:
An information search program characterized by including a step of adding an independent term cited by the dependent claim to an information block of the reference data. A recording medium on which the information search program according to claim 1 is recorded.

Images