Document Search System

Abstract

In the present invention, a document change is efficiently confirmed, and the result of a search using a search query is efficiently confirmed. Provided is a document search result output method comprising: a step for specifying at least one document to be searched; a step for searching for at least one document using a search query including at least one keyword; a step for displaying a search result on a screen; and a step for displaying a sentence on the screen. The at least one document includes a plurality of versions. In the step for displaying the search result on the screen, a keyword resulting in a hit in each version of the document is displayed together with information specifying the version in which the keyword resulted in a hit. The sentence is a sentence included in the document of the version which has been selected from the search result displayed on the screen.

Description

Document search result output method, document search system

[0001] FIELD OF THE INVENTION One aspect of the present invention relates to a document retrieval system. One aspect of the present invention relates to a document retrieval method. One aspect of the present invention relates to a document retrieval result output method. One aspect of the present invention relates to a document retrieval result display method.

[0002] One embodiment of the present invention is not limited to the above technical field, and examples of the technical field of one embodiment of the present invention include semiconductor devices, display devices, light-emitting devices, power storage devices, memory devices, electronic devices, lighting devices, input devices (e.g., touch sensors), input / output devices (e.g., touch panels), driving methods thereof, and manufacturing methods thereof.

[0003] Patent-related services include prior art searches, patent prosecution, and invalidity document searches. Conducting prior art searches for pre-filing inventions allows us to investigate whether related intellectual property rights exist. Domestic and international patent documents and papers obtained through prior art searches can be used to confirm the novelty and inventiveness of an invention, as well as to determine whether to apply for a patent. Furthermore, conducting invalidity document searches for patent documents allows us to investigate whether our own patent rights are at risk of being invalidated, or whether we can invalidate patent rights owned by others.

[0004] Because patent-related work is diverse, in recent years, development has been progressing on systems to support patent-related work, such as patent application document preparation support systems, patent information analysis systems, and literature search systems. Patent Document 1 discloses an application document preparation support system that has a function of extracting and displaying claims that include input keywords.

[0005] JP 2012-48696 A

[0006] Documents such as patent applications or contracts may have multiple versions that reflect changes or edits. When evaluating or understanding a document, or when making further changes or edits to a document, it is important to understand the history of the changes or edits. However, when the difference between the document before and after the change or edit is small, it is not easy to identify the history of the changes or edits.

[0007] Therefore, an object of one aspect of the present invention is to provide a document search system or a document search result output method that can efficiently check document transitions.An object of one aspect of the present invention is to provide a document search system or a document search result output method that can efficiently check document transitions using a search query and the results of the search.

[0008] An object of one embodiment of the present invention is to provide a document search system or a document search result output method that is easy for users to operate, and that allows users to efficiently obtain required information.

[0009] Note that the description of these problems does not preclude the existence of other problems. One embodiment of the present invention does not necessarily have to solve all of these problems. Problems other than these can be extracted from the description in the specification, drawings, and claims.

[0010] One aspect of the present invention is a method for outputting document search results, comprising the steps of identifying at least one document to be searched, searching for at least one document using a search query including at least one keyword, displaying the search results on a screen, and displaying a sentence on the screen, wherein the at least one document includes multiple versions, and in the step of displaying the search results on a screen, keywords that are hit in each version of the document are displayed together with information identifying the version in which the keyword was hit, and the sentence is a sentence contained in a version of the document selected from the search results displayed on the screen.

[0011] In the above document search result display method, it is preferable that in the step of displaying the sentence on the screen, keywords contained in the sentence are highlighted.

[0012] In the above method for displaying document search results, it is preferable that the documents are claims belonging to a patent application, and that the multiple versions each correspond to an amendment to the claims during the prosecution process.

[0013] Another aspect of the present invention is a method for outputting document search results, comprising the steps of accepting an identifier, accepting a search query, obtaining search results for each of one or more blocks contained in each of a plurality of documents associated with the identifier, and outputting the search results for each block as a first table together with an identifier identifying the document containing the block.

[0014] In the above document search result output method, it is preferable that the search results are output in the first table by outputting the search query for each of the multiple documents if the document has at least one block that satisfies the search query.

[0015] Another aspect of the present invention is a method for outputting document search results, comprising the steps of accepting an identifier, accepting a first search query and a second search query, obtaining a first search result based on the first search query and a second search result based on the second search query for each of one or more blocks contained in each of a plurality of documents associated with the identifier, and outputting the first search result and the second search result for the blocks as a first table, together with an identifier that identifies the document containing the block.

[0016] In the above-mentioned method for outputting document search results, it is preferable that the first table outputs first search results by outputting a first search query for each of the multiple documents if the documents have at least one block that satisfies the first search query, and that the first table outputs second search results by outputting a second search query for each of the multiple documents if the documents have at least one block that satisfies the second search query.

[0017] It is preferable that the above document search result output method further includes a step of outputting sentences, and in the step of outputting as a first table, the first table is displayed on the screen, the sentences are sentences contained in the document selected from the first table displayed on the screen, and in the step of outputting sentences, the sentences are displayed on the screen.

[0018] In the above document search result output method, it is preferable that keywords included in the search query are highlighted in the sentences displayed on the screen.

[0019] In the above document search result output method, it is preferable that each of the plurality of documents is a patent claim, the identifier is an application control number or an application family control number, and the block is a claim.

[0020] Another aspect of the present invention is a document search system having a memory unit, a reception unit, a processing unit, and an output unit. The memory unit has a database. The reception unit has a function of receiving a search query and an identifier. The processing unit has a function of retrieving multiple documents related to the identifier from the database and a function of obtaining search results based on the search query for each of one or more blocks contained in each of the multiple documents retrieved from the database. The output unit has a function of outputting the search results obtained for the blocks as a first table, together with identifiers identifying the documents containing the blocks.

[0021] In the document search system, it is preferable that the search results are output to the first table by outputting the search query when each of the plurality of documents has at least one block that satisfies the search query.

[0022] Another aspect of the present invention is a document search system having a memory unit, a receiving unit, a processing unit, and an output unit. The memory unit has a database. The receiving unit has a function of receiving a first search query, a second search query, and an identifier. The processing unit has a function of retrieving multiple documents related to the identifier from the database, and a function of obtaining a first search result based on the first search query and a second search result based on the second search query for each of one or more blocks contained in each of the multiple documents retrieved from the database. The output unit has a function of outputting the first search result and the second search result obtained for the blocks as a first table, together with identifiers identifying the documents containing the blocks.

[0023] In the above document search system, it is preferable that the first table outputs first search results by outputting a first search query when each of the multiple documents has at least one block that satisfies the first search query, and that the first table outputs second search results by outputting a second search query when each of the multiple documents has at least one block that satisfies the second search query.

[0024] In the above document search system, it is preferable that the database is an application database, each of the plurality of documents is a patent claim, the identifier is an application management number or an application family management number, and the block is a claim.

[0025] According to one aspect of the present invention, it is possible to provide a document search system or a document search result output method that can efficiently check document evolution. According to one aspect of the present invention, it is possible to provide a document search system or a document search result output method that can efficiently check document evolution using a search query.

[0026] According to one aspect of the present invention, it is possible to provide a document retrieval system or a document retrieval result output method that is easy for users to operate. According to one aspect of the present invention, it is possible to provide a document retrieval system or a document retrieval result output method that allows users to efficiently obtain required information.

[0027] Note that the description of these effects does not preclude the existence of other effects. One embodiment of the present invention does not necessarily have all of these effects. Effects other than these can be extracted from the description in the specification, drawings, and claims.

[0028] FIG. 1 is a diagram illustrating an example of a document retrieval system. FIG. 2 is a diagram illustrating an example of a document retrieval method. FIGS. 3A and 3B are diagrams illustrating an example of a graphic user interface. FIG. 4 is a diagram illustrating an example of a graphic user interface. FIG. 5 is a diagram illustrating an example of a graphic user interface. FIG. 6 is a diagram illustrating an example of a graphic user interface. FIGS. 7A to 7D are diagrams illustrating an example of a graphic user interface. FIG. 8 is a diagram illustrating an example of a graphic user interface. FIGS. 9A to 9E are diagrams illustrating an example of a graphic user interface. FIGS. 10A to 10D are diagrams illustrating an example of a graphic user interface. FIG. 11 is a diagram illustrating an example of a graphic user interface. FIG. 12 is a diagram illustrating an example of a graphic user interface. FIG. 13 is a diagram illustrating an example of a document retrieval system. FIG. 14 is a diagram illustrating an example of a document retrieval system.

[0029] The embodiments will be described in detail with reference to the drawings. However, the present invention is not limited to the following description, and it will be readily understood by those skilled in the art that various changes can be made in form and detail without departing from the spirit and scope of the present invention. Therefore, the present invention should not be interpreted as being limited to the description of the embodiments shown below.

[0030] In the configuration of the invention described below, the same parts or parts having similar functions are denoted by the same reference numerals in different drawings, and repeated explanations thereof will be omitted. Furthermore, when referring to similar functions, the same hatching pattern may be used and no particular reference numeral may be assigned.

[0031] In addition, ordinal numbers such as "first," "second," and "third" used in this specification are used to avoid confusion of components and do not limit the number. For example, the first row is not limited to the first row, and the first column is not limited to the first column.

[0032] Furthermore, for ease of understanding, the position, size, range, etc. of each component shown in the drawings may not represent the actual position, size, range, etc. Therefore, the disclosed invention is not necessarily limited to the position, size, range, etc. disclosed in the drawings.

[0033] In this specification, when the same symbol is used for multiple elements, and particularly when it is necessary to distinguish between them, an identification symbol such as “_1”, “[n]”, or “[m, n]” may be added to the symbol.

[0034] Unless otherwise specified herein, a document is a description of an event in natural language, containing one or more sentences, and is computerized and machine-readable. Examples of documents include, but are not limited to, patent applications, precedents, contracts, terms and conditions, regulations, product manuals, novels, publications, white papers, and technical documents. A document may have multiple versions that reflect changes or edits. Each version may be assigned a serial number or date to identify the version. Here, if the document is the claims of a patent application, a change or edit refers to an amendment or correction of the claims. If two amendments are made during the prosecution process, the document can be said to have three versions, including the version at the time of filing.

[0035] In this specification, an identifier refers to an identification code used to identify a specific document from multiple documents. Identifiers are assigned to items such as title and publisher. Identification codes are made up of a combination of letters, numbers, and symbols. When identifying a specific document from multiple documents, a single identifier may be used, or multiple identifiers may be combined.

[0036] In this specification, a search query is an expression of a concept that a user wants to find in some form, and here refers to various search conditions that a user inputs when searching. The search conditions are not particularly limited, and examples include one or more words, one or more phrases, or one or more sentences. Alternatively, examples include a search formula created with at least one of one or more words, one or more phrases, and one or more sentences and a logical operator. Logical operators are also called Boolean operators, and examples include, but are not limited to, AND, OR, and NOT. When these logical operators are used, the search formula becomes an AND search, an OR search, or a NOT search. Furthermore, natural language sentences may be accepted as search queries, and words extracted by language processing may be used as search keywords, or sentence vectors may be created using distributed representations.

[0037] In this specification, a set of data configured in a model of rows and columns (vertical and horizontal axes) is called a table or tabular format. Therefore, if a set of data is configured in a model of rows and columns (vertical and horizontal axes), it can be called a table or tabular format, regardless of whether it has lines or not.

[0038] Embodiment 1 In this embodiment, a document retrieval system, a document retrieval method, a document retrieval result output method, and a document retrieval result display method according to one embodiment of the present invention will be described with reference to FIGS.

[0039] In one embodiment of the present invention, a document search system obtains search results for each of a plurality of documents based on a received search query. Then, the search results for each of the plurality of documents are output in a table format. Note that the number of documents for which search results are obtained may be one. Furthermore, the output of search results is not limited to a table format, and the search results may be output together with information identifying the document. The search results may be output, for example, in a tree format (tree structure).

[0040] The output may be, for example, one or both of displaying on a display screen (sometimes simply referred to as a screen in this specification) of a terminal used by the user and outputting a file in CSV format, etc. The display screen is not particularly limited as long as it is a display device, and may be, for example, a multi-display, which will be described later.

[0041] For example, one of the items on the vertical axis and the items on the horizontal axis of the table indicates a document, and the other indicates a search query.

[0042] As a specific example, when a search query is received, the first column of the table may show the search results for the search query. Also, when the search results are obtained from a first document and a second document, the first row of the table may show the search results for the first document, and the second row of the table may show the search results for the second document.

[0043] Furthermore, in the document search system according to one aspect of the present invention, when a document is selected from a table showing search results displayed on the display screen, the selected document is displayed on the same display screen.

[0044] The number of search queries accepted may be one or more. For example, when two search queries (a first search query and a second search query) are accepted, a first search result based on the first search query and a second search result based on the second search query may be displayed together in a first column of the table. Such an output can improve the visibility of search results using multiple search queries. Note that the first search result based on the first search query may be displayed in the first column of the table, and the second search result based on the second search query may be displayed in the second column of the table.

[0045] 1 shows a block diagram of a document search system 100. The document search system 100 includes a receiving unit 110, a storage unit 120, a processing unit 130, an output unit 140, and a transmission path 150.

[0046] The document search system 100 may be provided in an information processing device such as a personal computer used by a user, or may be configured such that a processing unit of the document search system 100 is provided in a server and the system is accessed and used from a client PC via a network.

[0047] [Reception Unit 110] The reception unit 110 receives search queries. The number of search queries received by the reception unit 110 may be one or more. For example, when the number of search queries is two, the reception unit 110 receives a first search query and a second search query.

[0048] In this embodiment, the search query received by the receiving unit 110 is described as one or more words, one or more phrases, one or more sentences, or a combination thereof. For example, when the receiving unit 110 receives multiple search queries, each of the multiple search queries is a single word, a single phrase, or a single sentence. Hereinafter, a word, a phrase, or a sentence input by a user as a search query may be referred to as a keyword.

[0049] The receiving unit 110 receives the specification of a document group (plurality of documents) to be searched. For example, the receiving unit 110 receives at least one identifier assigned to a document item. Here, the document group to be searched is made up of a plurality of documents. Therefore, the "document group" described in this specification can be rephrased as "plurality of documents." Note that the number of documents to be searched may be one.

[0050] The receiving unit 110 may receive data related to a document. For example, the receiving unit 110 may receive text data of a document to be searched.

[0051] The reception unit 110 may have a function of transmitting and receiving data. In this case, the reception unit 110 can be referred to as a communication unit. Examples of the communication unit include a hub, a router, and a modem. The reception unit 110 may also have a function of receiving input operations from a user. In this case, the reception unit 110 can be referred to as an input unit. Examples of the input unit include a mouse, a keyboard, a touch panel, a microphone, a scanner, and a camera.

[0052] The search query and identifier supplied to the reception unit 110 are supplied to one or both of the storage unit 120 and the processing unit 130 via the transmission path 150 .

[0053] [Storage Unit 120] The storage unit 120 has a function of storing a program executed by the processing unit 130. Preferably, the storage unit 120 also has a function of storing search results acquired by the processing unit 130 and tabular data generated by the processing unit 130. The storage unit 120 may also have a function of storing calculation results and inference results generated by the processing unit 130, data input to the reception unit 110, etc.

[0054] The storage unit 120 includes at least one of a volatile memory and a non-volatile memory. Examples of the volatile memory include a dynamic random access memory (DRAM) and a static random access memory (SRAM). Examples of the non-volatile memory include a resistive random access memory (ReRAM), a phase change random access memory (PRAM), a ferroelectric random access memory (FeRAM), a magnetoresistive random access memory (MRAM), and a flash memory. The storage unit 120 may also include a recording media drive, such as a hard disk drive (HDD) or a solid state drive (SSD).

[0055] The storage unit 120 may include a database containing document data.

[0056] The document search system 100 may also have a function of extracting (reading) document data (specifically, data necessary for subsequent processing) from a database that exists outside the system.

[0057] Furthermore, the document search system 100 may have a function of retrieving data from both its own database and an external database.

[0058] The database may be configured to include, for example, text data and / or image data.

[0059] Alternatively, one or both of a storage device and a file server may be used instead of the database. For example, when using files stored in a file server, it is preferable that the database has paths to files stored in the file server.

[0060] For example, the database may include an application database. The applications may include intellectual property applications such as patent applications, utility model applications, and design applications. There are no limitations on the status of each application, including whether it is published, pending at a patent office, or registered. For example, the application database may include at least one of pre-examination applications, applications under examination, and registered applications, or may include all of them.

[0061] For example, it is preferable that the application database has one or both of the specifications and claims for multiple patent applications. It is assumed that multiple claims belonging to one version of an application are treated as a single document. It is also preferable that the application database has documents managed as application progress records or examination records. For example, it is preferable that the application database has written amendments or petitions for multiple patent applications. The application database may further have abstracts for multiple patent applications. The specifications, claims, written amendments, petitions, and abstracts are stored, for example, as text data.

[0062] The application database includes at least one of the following: an application management number for identifying an application (including a company-specific number or an arbitrary number designated by the user), an application family management number for identifying an application family, an application number, a publication number, a registration number, drawings, a filing date, a priority date, a publication date, a status, a classification (e.g., a patent classification, a utility model classification), a category, and keywords. The application database may also include information regarding the progress record or examination record of an application. For example, the application database may include at least one of a history management number (including a company-specific number or an arbitrary number designated by the user), a filing date, and a receipt date. Each of these pieces of information can be used to identify a document group when accepting a specification of a document group to be searched. Therefore, this information can be used as an item for identifying a document. Alternatively, this information may be output together with the document search results. Each document in the application database is assigned an identifier for each item that identifies the document.

[0063] In addition, various types of documents, such as legal precedents, contracts, terms and conditions, collections of regulations, and product manuals, can be managed in a database. The database contains at least the text data of the documents. The database may further contain at least one of a number identifying each document, a title, a date such as the publication date, an author, and a publisher. Each of these pieces of information can be used to identify a document group when accepting the specification of a document group to be searched. Therefore, these pieces of information can be used as items for identifying documents. Alternatively, each of these pieces of information may be output together with the document search results.

[0064] A document can be divided into multiple blocks according to various rules. The term "block" used in this specification refers to a group of sentences, and includes one or more sentences. A document can be divided into multiple blocks, for example, by paragraph, section, chapter, heading, clause, page, or sentence. For example, if a document is divided by paragraph, a block can be referred to as a paragraph.

[0065] The database may have at least one of numbers assigned to paragraphs (paragraph numbers), chapter titles or numbers, heading titles or numbers, clause titles or numbers, page numbers, and numbers assigned to sentences (sentence numbers), etc. This information can be used as items for identifying blocks.

[0066] The use of the document search system of this embodiment is not particularly limited, and an example is investigating the evolution of documents such as patent claims or contracts.

[0067] The storage unit 120 may also have a thesaurus. By having a thesaurus, for example, the processing unit 130 can supplement the words or phrases included in the search query received by the receiving unit 110 with synonyms. The processing unit 130 may also be used to create the thesaurus. The processing unit 130 may also use artificial intelligence (AI) to create the thesaurus.

[0068] [Processing Unit 130] The processing unit 130 has a function of performing processing such as calculation and inference using data supplied from one or both of the receiving unit 110 and the storage unit 120. The processing unit 130 also has a function of performing processing using various data contained in a database. The processing unit 130 can supply processing results such as calculation results and inference results to one or both of the storage unit 120 and the output unit 140.

[0069] The processing unit 130 has a function of identifying a group of documents to be searched. For example, the processing unit 130 has a function of retrieving, from the database, multiple documents associated with an identifier received by the receiving unit 110. In other words, the processing unit 130 has a function of receiving document data of the multiple documents from the database. The processing unit 130 also has a function of acquiring search results based on the search query received by the receiving unit 110 for each of one or multiple blocks contained in each of the multiple documents retrieved from the database. For example, if the receiving unit 110 receives two search queries (a first search query and a second search query), the processing unit 130 has a function of acquiring a first search result based on the first search query and a second search result based on the second search query for each of one or multiple blocks contained in each of the multiple documents retrieved from the database.

[0070] The processing unit 130 has a function of performing a text search, and in particular, preferably has a function of performing a text search using a search expression created by combining a word or phrase with a logical operator.

[0071] The processing unit 130 has a function of generating tabular data based on the results of the text search. Note that the data generated by the processing unit 130 is not limited to a tabular format and may be in a tree format (tree structure), for example.

[0072] The processing unit 130 may also have a function of using a thesaurus to acquire synonyms for words or phrases included in the search query received by the receiving unit 110. The processing unit 130 may then update the search query using the synonyms and then perform a text search. This can improve search accuracy. Note that synonyms may include not only related words in the same language as the words or phrases included in the received search query, but also words obtained by translating the words or phrases included in the received search query into other languages, and may also include related words. For example, synonyms for the English word "light shielding" may include the English word "light blocking" and the Japanese word "shakou" (blocking).

[0073] The processing unit 130 may include, for example, an arithmetic circuit, and may include, for example, a central processing unit (CPU).

[0074] The processing unit 130 may have a microprocessor such as a DSP (Digital Signal Processor) or a GPU (Graphics Processing Unit). The microprocessor may be implemented by a PLD (Programmable Logic Device) such as an FPGA (Field Programmable Gate Array) or an FPAA (Field Programmable Analog Array). The processing unit 130 can perform various data processing and program control by interpreting and executing instructions from various programs using the processor. Programs that can be executed by the processor are stored in at least one of the memory area of ​​the processor and the storage unit 120.

[0075] The processing unit 130 may have a main memory, which may include at least one of a volatile memory such as a random access memory (RAM) and a non-volatile memory such as a read only memory (ROM).

[0076] The RAM may be, for example, a DRAM or an SRAM, and a virtual memory space is allocated and used as a working space for the processing unit 130. The operating system, application programs, program modules, program data, lookup tables, and the like stored in the storage unit 120 are loaded into the RAM for execution. The data, programs, and program modules loaded into the RAM are each directly accessed and operated by the processing unit 130.

[0077] The ROM can store a BIOS (Basic Input / Output System), firmware, etc., which do not require rewriting. Examples of ROM include mask ROM, OTPROM (One Time Programmable Read Only Memory), and EPROM (Erasable Programmable Read Only Memory). Examples of EPROMs include UV-EPROMs (Ultra-Violet Erasable Programmable Read Only Memories), which allow stored data to be erased by exposure to ultraviolet light, EEPROMs (Electrically Erasable Programmable Read Only Memories), and flash memories.

[0078] The document search system according to one embodiment of the present invention may use AI for some of its processing. The document search system may use, for example, an artificial neural network (ANN, hereinafter simply referred to as a neural network). The neural network is realized by a circuit (hardware) or a program (software).

[0079] In this specification, a neural network refers to a general model that mimics the neural circuit network of a living organism, determines the connection strength between neurons through learning, and has problem-solving capabilities. A neural network has an input layer, an intermediate layer (hidden layer), and an output layer.

[0080] In this specification and the like, when discussing neural networks, determining the connection strengths (also called weighting coefficients) between neurons from existing information may be referred to as "learning."

[0081] In this specification and the like, the act of constructing a neural network using connection strengths obtained by learning and deriving a new conclusion from it may be referred to as "inference."

[0082] For example, AI-based processing can be applied to the function of creating a thesaurus described above.

[0083] [Output Unit 140] The output unit 140 outputs information based on the processing results of the processing unit 130. For example, the output unit 140 can supply one or both of the calculation results and the inference results of the processing unit 130 to an external device of the document search system 100. The output unit 140 can also output various data contained in the database based on the processing results of the processing unit 130. The output unit 140 can output information to a display device (display) or a speaker used by the user.

[0084] The output unit 140 has a function of outputting search results obtained for a block in a table format together with identifiers that identify documents that include the block. For example, if the receiving unit 110 receives two search queries (a first search query and a second search query), the output unit 140 outputs the first search result and the second search result obtained for the block in a table format together with identifiers that identify documents that include the block. Note that the search results output by the output unit 140 are not limited to a table format and may be, for example, a tree format (tree structure).

[0085] The output unit 140 may have a function of transmitting and receiving data. In this case, the output unit 140 can be referred to as a communication unit. Examples of the communication unit include a hub, a router, and a modem. The output unit 140 may also have a function of displaying processing results. In this case, the output unit 140 can be referred to as a display unit. Examples of the display unit include display devices such as a liquid crystal display device and a light-emitting display device. The number of display devices used as the display unit is not limited. The number of display devices used as the display unit may be one or more. A display unit configured by arranging multiple display devices is sometimes called a multi-monitor or multi-display.

[0086] [Transmission Path 150] The transmission path 150 has a function of transmitting data. Data can be transmitted and received between the reception unit 110, the storage unit 120, the processing unit 130, and the output unit 140 via the transmission path 150.

[0087] 1, the functions of the document retrieval system 100 are classified and are mutually independent, but some or all of the functions of the document retrieval system 100 may not be independent. For example, the processing unit 130 may have the functions of one or both of the receiving unit 110 and the output unit 140. In other words, the processing unit 130 may also function as one or both of the receiving unit 110 and the output unit 140.

[0088] 2 to 12, a document search method and a document search result output method in a document search system according to one embodiment of the present invention will be described. Note that, in the following, a display method on a display will be given as an example of an output method. That is, the document search result display method according to one embodiment of the present invention will be described.

[0089] <Document Search Results Display Method> The document search results display method of this embodiment includes the processes of steps S1 to S5 shown in FIG. 2. FIGS. 3 to 12 each show an example of a graphic user interface (GUI) for the document search system of this embodiment. The icons, windows, buttons, and text boxes, as well as their arrangements, shown in FIGS. 3 to 12 are merely examples and are not particularly limited. The GUI can be configured as a web page that a user accesses via a network. Alternatively, the GUI can be configured as a screen of a program application executed on an information processing device, such as a personal computer, used by the user.

[0090] [Step S1] In step S1, an identifier is accepted. By inputting an identifier, a user can specify a group of documents (multiple documents) to be searched from documents contained in a database or the like. Hereinafter, the identifier accepted in step S1 may be referred to as a first identifier. Furthermore, an item to which the first identifier is assigned may be referred to as a first item.

[0091] If the database is an application database, the first identifier (first item) may be, for example, an application management number or an application family management number. Alternatively, it may be, for example, one selected from an application number, a publication number, a registration number, etc. Furthermore, if the database manages documents such as precedents, contracts, terms and conditions, regulations, and product manuals, the first identifier (first item) may be, for example, one selected from a number identifying each document, a title, a date such as a publication date, etc.

[0092] Area 300a shown in Figures 3A, 4 to 6, 11, and 12 is an area that the user can use to input an identifier. In Figures 3A, 4 to 6, 11, and 12, area 300a displays area 301 for inputting an identifier.

[0093] As shown in Figure 3A, after the user enters a first identifier in area 301, the user selects icon 303a labeled "Search" with mouse pointer 304, causing the document search system to accept the first identifier and begin identifying a group of documents (multiple documents) based on the first identifier.

[0094] [Step S2] In step S2, a document group (plurality of documents) related to the first identifier is retrieved. For example, the document search system retrieves (reads) data related to the document group (plurality of documents) related to the first identifier entered by the user from a database (specifically, data necessary for subsequent processing). Also, for example, the data related to the document group (plurality of documents) related to the first identifier entered by the user is supplied from the database to a processing unit. Also, for example, the processing unit receives data related to the document group (plurality of documents) related to the first identifier entered by the user from the database.

[0095] The document group retrieved from the database in step S2 (supplied from the database to the processing unit) is composed of a plurality of documents to which a first identifier is assigned as a first item. In this case, the plurality of documents have the same first identifier. Note that, as will be described in detail later, the document group retrieved in step S2 may be composed of a first document to which a first identifier is assigned and a plurality of second documents to which the same second identifier as the first document is assigned.

[0096] For example, if the database is an application database and the first identifier (first item) is an application serial number, the document group associated with the first identifier is composed of multiple patent claims with the same application serial number. In this case, the document group associated with the first identifier is the patent claims belonging to the patent application. Furthermore, each of the multiple documents associated with the first identifier can be said to be a patent claim.

[0097] Multiple claims with the same application control number include multiple versions of the claims. For example, if an application associated with a first identifier has amended or corrected claims, the documents associated with the first identifier include the claims as filed and the amended or corrected versions of the claims. Note that there may be as many amended or corrected versions as there are amendments or corrections to the claims. In other words, the multiple versions correspond to the prosecution history or file wrappers containing amendments or corrections to the claims.

[0098] In this specification, the term "prosecution history" refers to the process from the time of filing to the final disposition (such as a decision to reject or grant a patent). The term "final disposition" may be interpreted appropriately according to the status of the application (such as pre-examination, under-examination, or registered). For example, if the application is pre-examination, the prosecution history refers to the process from the time of filing to before the request for examination. Furthermore, the file wrapper refers to documents exchanged between the patent applicant and the Commissioner of the Japan Patent Office or the examiner during the prosecution history.

[0099] From the above, multiple claims with the same application control number can be said to be different versions. Versions can be identified by the application history control number, date, or other identifiers. Therefore, by using the application history control number assigned to a version as a third identifier, each of the multiple claims can be identified by a pair of a first identifier and a third identifier. In other words, the number of multiple claims is equal to the number of pairs of a first identifier and a third identifier. Hereinafter, an item assigned a third identifier will be referred to as a third item. Furthermore, if the number of third items is two or more, at least one document to be searched will contain multiple versions. In this case, each of the multiple versions can be said to correspond to an amendment to the claims during the prosecution process.

[0100] If no amendment or correction of claims has been made in an application, a document associated with a first identifier will only have the claims in the version at the time of filing. In other words, a group of documents associated with the first identifier will consist of a single claim with the same application management number.

[0101] Alternatively, for example, if the database is an application database and the first identifier (first item) is an application family reference number, the document group associated with the first identifier is composed of multiple claims with the same application family reference number. In this case, the document group associated with the first identifier is the claims belonging to the patent application. Furthermore, each of the multiple documents associated with the first identifier can be said to be a claim.

[0102] Multiple applications with the same application family control number may each have multiple versions of claims. Note that if no amendments or corrections have been made to the claims in an application, a document associated with a first identifier will only have the version of claims at the time of filing. In other words, multiple applications with the same family control number can be said to each have one or more claims.

[0103] The document group extracted in step S2 is not limited to the above. For example, the document group extracted in step S2 may be composed of a first document assigned a first identifier and multiple second documents assigned the same second identifier as the first document. The number of second documents may be one. For example, the document search system identifies the first document assigned a first identifier and the second document assigned the same second identifier as the first document. Here, the item assigned the second identifier (referred to as the second item) is different from the first item.

[0104] If the database is an application database, the first identifier (first item) is an application management number, and the second identifier (second item) is an application family management number, the group of documents extracted in step S2 will consist of, for example, multiple patent claims with the same application family management number.

[0105] Multiple applications with the same application family control number may each have multiple versions of claims. Furthermore, the multiple claims of multiple applications with the same application family control number can be said to be different versions. Therefore, by using the history control number assigned to the version as the third identifier, each of the multiple claims can be identified by a combination of a first identifier, a second identifier, and a third identifier. In other words, the number of multiple claims is equal to the number of combinations of a first identifier, a second identifier, and a third identifier.

[0106] Also, when the database manages documents such as legal precedents, contracts, terms and conditions, regulations, and product manuals, the third identifier (third item) is, for example, a history management number.

[0107] The document group extracted in step S2 is the search target. In this embodiment, the number of documents extracted in step S2 (documents to be searched) is m (m is an integer equal to or greater than 1). In this case, the document group to be searched consists of the first to mth documents. In particular, if the document group associated with the first identifier consists of multiple claims with the same application management number, m corresponds to the number of versions of the claims.

[0108] As mentioned above, a document can be divided into multiple blocks according to various rules. That is, each of the m documents has one or more blocks. Therefore, the smallest unit of search target is a document or a block. Hereinafter, an item that identifies a block may be referred to as a fourth item, and an identifier assigned to a fourth item may be referred to as a fourth identifier. Note that the i-th document (i is an integer between 1 and m) is assumed to have p[i] blocks (p[i] is an integer greater than or equal to 1).

[0109] If the database is an application database and the documents to be searched are composed of claims of at least one of multiple versions and multiple applications, for example, one block may represent one claim and the fourth identifier (fourth item) may be the claim number. Also, if the database manages contracts, for example, one block may represent one clause and the fourth identifier (fourth item) may be the clause number.

[0110] Note that steps S1 and S2 can be collectively referred to as a step of identifying a group of documents to be searched. In other words, steps S01 and S02 can be collectively referred to as a step of identifying at least one document to be searched. Furthermore, if the number of third items is two or more, the at least one document to be searched will include multiple versions. Note that the method of identifying a group of documents to be searched is not limited to this.

[0111] [Step S3] In step S3, n search queries (n is an integer equal to or greater than 1) are accepted. In other words, in step S3, at least one search query is accepted. For example, if the number of accepted search queries is one, step S3 is a step of accepting one search query. Also, for example, if the number of accepted search queries is two, step S3 is a step of accepting a first search query and a second search query.

[0112] There are no particular limitations on the search query accepted in step S3. For example, one word, one phrase, or one sentence can be accepted as one search query. Furthermore, for example, a search formula created by combining one or more words and logical operators can also be accepted as one search query. The search query includes at least one keyword.

[0113] Area 300b shown in Figures 3A, 4 to 6, 11, and 12 is an area that a user can use to input a search query. In Figures 3A, 4 to 6, 11, and 12, area 300b displays area 302 for inputting a search query. When multiple search queries are input into area 302, it is recommended to use a delimiter between the search queries. Examples of delimiters include a line break, tab, semicolon, slash, or backslash. Alternatively, a word, phrase, or sentence enclosed in an area surrounded by single quotes, double quotes, parentheses, or the like may be considered a single search query.

[0114] 3A illustrates an example in which area 300b includes one area for accepting search queries, but the present invention is not limited to this. Area 300b may include multiple areas for accepting search queries. This allows multiple search queries to be accepted and multiple searches to be performed without the need for separators between the search queries.

[0115] After the user inputs a search query in area 302, the user selects icon 303b labeled "Search" with the mouse pointer, causing the document search system to accept the search query and begin a search based on the search query.

[0116] When the document search system acquires synonyms from a thesaurus or the like using keywords included in the received search query, the document search system may automatically add the synonyms to the search query. Alternatively, the document search system may display the synonyms and prompt the user to reconsider the search query. For example, the user may add, change, or delete keywords by referring to the synonyms.

[0117] 3A shows a configuration in which the area that a user can use to input an identifier and the area that a user can use to input a search query are provided in different areas, but the configuration of the GUI related to the document search system is not limited to this. For example, the areas that a user can use to input an identifier and a search query may be provided in a single area.

[0118] For example, as shown in Fig. 3B, an area 301 for inputting a first identifier and an area 302 for inputting a search query may be provided in area 300. Also, icon 303 shown in Fig. 3B may serve as both an icon for starting a search of a document group based on a first identifier and an icon for starting a search based on a search query.

[0119] Specifically, when a first identifier is entered in area 301 and a search query is not entered in area 302, and the user selects icon 303 with the mouse pointer, the document search system accepts the first identifier and begins identifying a group of documents based on the first identifier.

[0120] Alternatively, when a user selects icon 303 with the mouse pointer after inputting a first identifier in area 301 and a search query in area 302, the document search system may accept the first identifier and the search query, begin identifying a document group based on the first identifier, extract the document group, and then begin a search based on the search query. In this case, step S1 doubles as step S3. Therefore, in the process shown in FIG. 2, it may be possible to accept the identifier and the search query in step S1 and omit step S3.

[0121] [Step S4] In step S4, n search results are obtained for each of the n search queries. In other words, in step S4, at least one document identified up to step S2 is searched for using a search query including at least one keyword, and the search results are obtained.

[0122] Step S4 obtains n search results for one search target. For example, if m documents are search targets, n search results are obtained for each of the m documents. Note that if each of the m documents has one or more blocks, n search results are obtained for each of the one or more blocks in each document. In other words, n search results are obtained for each block.

[0123] For example, if the document group associated with the first identifier is made up of multiple documents and one search query is accepted in step S3, search results for each of one or more blocks contained in each of the multiple documents based on the search query are obtained in step S4. Also, if the document group associated with the first identifier is made up of multiple documents and two search queries (a first search query and a second search query) are accepted in step S3, search results for each of one or more blocks contained in each of the multiple documents based on the first search query and the second search query are obtained in step S4.

[0124] Note that steps S3 and S4 can be collectively referred to as a step of searching a document group using a search query. In other words, steps S3 and S4 can be collectively referred to as a step of searching at least one document to be searched for using a search query including at least one keyword. Note that the method of searching a document group using a search query is not limited to this.

[0125] [Step S5] In step S5, the search results are output. For example, in step S5, n search results are displayed on the display screen. Specifically, in step S5, n search results in a block are displayed on the display screen in a table format. Note that in step S5, the n search results may be output as a file in a table format (for example, CSV format). Furthermore, the output of the n search results is not limited to a table format. For example, they may be in a tree format (tree structure).

[0126] One of the items on the vertical axis and the items on the horizontal axis of the table indicates at least one of a document and a block, and the other indicates a search query. In other words, one of the items on the vertical axis and the items on the horizontal axis of the table indicates an identifier that identifies a document, and the other indicates a search result. Therefore, step S5 can be said to be a step of outputting the search results for a block in table form together with an identifier that identifies the block. Also, step S5 can be said to be a step of outputting the search results for a block in table form together with an identifier that identifies a document that has the block.

[0127] Area 310 shown in Fig. 4 is an area where search results are displayed. Various data contained in a database or the like may also be displayed in area 310. In Fig. 4, a table 320 showing search results is displayed in area 310.

[0128] 4 shows an example of search results when a group of documents to be searched is composed of multiple documents to which first identifiers are assigned (multiple documents with the same first identifier). In table 320 in FIG. 4, the items on the vertical axis indicate documents (item: item 353) and blocks (item: item 354), and the items on the horizontal axis indicate search queries (item: keyword). Here, item 353 corresponds to the third item, and item 354 corresponds to the fourth item.

[0129] For example, when m documents are searched and n search queries are received, table 320 shows search results equal to the total number of blocks contained in the m documents multiplied by n.

[0130] 4 also shows an example of displaying search results by accepting one search query (search query 311) and outputting the search query if a block satisfies the search query. In FIG. 4, information identifying each block is displayed in the row of each block. Specifically, a third identifier and a fourth identifier are displayed. Furthermore, the search query 311 is displayed in the first column of the row of a block that satisfies the search query 311, and the first column of the row of a block that does not satisfy the search query 311 is left blank.

[0131] 4, it can be seen that a block whose third identifier is 2 and whose fourth identifier is 1 satisfies the search query 311. It can also be seen that a block whose third identifier is 3 and whose fourth identifier is 1 does not satisfy the search query 311. In this way, by displaying the search query together with information that identifies the block (here, the third identifier and the fourth identifier), the results of the document search can be checked efficiently.

[0132] The order in which the document and block pairs are sorted is not particularly limited. For example, the search results may be displayed in the order in which they are registered in the database. Alternatively, the documents may be sorted so that documents containing more blocks that satisfy the search query are placed at the top of the table. Alternatively, the user may be able to select a desired sort order from multiple sorting options.

[0133] Furthermore, it is preferable that in addition to a table 320 showing the search results, at least one of the documents and blocks shown in the table 320 is displayed in the area 310. In this case, the area 310 includes an area 330 that displays in addition to the table 320 showing the search results at least one of the documents and blocks shown in the table 320.

[0134] 5 shows an example in which a user inputs "tungsten" as a search query in area 302 and selects icon 303b marked "Search" with the mouse pointer, whereby a table 320 and at least one of a document and a block are displayed in area 310. In this example, the search query is the keyword "tungsten."

[0135] In table 320 of Fig. 5, "tungsten" is displayed in the first column of the row of the block that satisfies the search query. That is, in table 320 of Fig. 5, the keyword (here, "tungsten") that hits in the document is displayed along with information that identifies the document in which the keyword hits (here, the third identifier and the fourth identifier). This makes it possible to quickly identify documents that satisfy the search query. In other words, it is possible to quickly identify documents in which the keyword hits.

[0136] 5, search result 321 is selected, and the block (one or more sentences contained in the block) corresponding to search result 321 is displayed in area 330. Since table 320 and area 330 are included in area 310, table 320 and the sentences (here, blocks) contained in the selected document are displayed on the same screen.

[0137] After table 320 is displayed on the screen, by selecting an identifier (fourth identifier) ​​assigned to a block or a search result for a block from table 320, the block (one or more sentences included in the block) is displayed in area 330. In other words, the method for outputting document search results can be said to have a step of displaying the search results on the screen and a step of displaying the sentences on the screen. Alternatively, the method for outputting document search results can be said to have a first step of outputting the search results and a second step of outputting the sentences. In this case, table 320 is displayed on the screen in the first step, and the sentences are displayed on the screen in the second step. The sentences are sentences included in the document selected from table 320.

[0138] 5 displays a sentence that satisfies search query 311 in a block whose third identifier is 2 and whose fourth identifier is 1. For example, area 330 can display a sentence that satisfies search query 311, a block containing the sentence (a block whose third identifier is 1 and whose fourth identifier is 2), or a document containing the sentence (a document whose third identifier is 1). Furthermore, one or more sentences before and after the sentence or one or more blocks before and after the block may also be displayed.

[0139] By selecting an identifier assigned to a document, an identifier assigned to a block, or a search result shown in table 320, the selected document, block, or document or block corresponding to the search result can be displayed in area 330. This allows not only confirmation of the search results but also confirmation of the contents of the document or block in a short time.

[0140] In the area 330, the keyword ("tungsten" in FIG. 5) is preferably highlighted. While FIG. 5 shows an example in which the keyword is underlined, this is not limiting. For example, the keyword in the sentence can be emphasized by thickening the lines of the characters, distinguishing the color of the characters from the other characters, or highlighting the characters. This can improve the visibility of the keyword.

[0141] Additionally, area 330 may display an identifier assigned to the selected document or block. In FIG. 5, the third identifier (here, 2) is displayed using angle brackets, and the fourth identifier (here, 1) is displayed using square brackets. Note that the symbols used to display the identifiers are not limited to these, and other symbols such as brackets, frames, or figures may also be used. This allows the user to quickly check the contents of documents that match keywords and the information identifying those documents.

[0142] Note that even when an identifier assigned to a document, an identifier assigned to a block, or a search result that does not satisfy the search query 311 is selected, the selected document, block, or document or block corresponding to the search result may be displayed in area 330. In this case, the document or block displayed in area 330 does not include the above keyword, and therefore is not highlighted.

[0143] By switching between displaying documents or blocks that satisfy the search query 311 and displaying documents or blocks that do not satisfy the search query 311, the transition of documents or blocks can be confirmed in a short time.

[0144] It should be noted that the number of identifiers assigned to selected documents, identifiers assigned to blocks, or search results is not limited to 1. The number of identifiers assigned to selected documents, identifiers assigned to blocks, or search results may be two or more.

[0145] 6 shows an example in which a table 320 and two documents or blocks are displayed in area 310. In FIG. 6, search results 321 and 322 are selected, and the block corresponding to search result 321 (one or more sentences contained in the block) and the block corresponding to search result 322 (one or more sentences contained in the block) are displayed in area 330.

[0146] Specifically, in Figure 6, sentences that satisfy the search query 311 in a block whose third identifier is 2 and whose fourth identifier is 1 are displayed in the upper part of area 330, and sentences that do not satisfy the search query 311 in a block whose third identifier is 3 and whose fourth identifier is 1 are displayed in the lower part of area 330. Since the keyword is a hit in the sentence displayed in the upper part of area 330, the keyword is highlighted in the sentence. On the other hand, since the keyword is not a hit in the sentence displayed in the lower part of area 330, the keyword is not highlighted in the sentence. By comparing these two sentences, the evolution of the document can be confirmed in a short time.

[0147] Tables 320 shown in Figures 7A to 9E are each modified versions of table 320 shown in Figure 4. In the description of Figures 7A to 9E, the description of parts common to Figure 4 may be omitted.

[0148] 4, rows of blocks that do not satisfy the search query 311 are displayed, and the first column of the rows is left blank. Note that the method of displaying blocks that do not satisfy the search query is not limited to this. For example, rows of blocks that do not satisfy the search query may be hidden.

[0149] 7A shows an example in which rows of blocks that do not satisfy search query 311 are not displayed in table 320. For example, a block with a third identifier of 3 does not satisfy search query 311 (see FIG. 4 ), so the row of that block is not displayed. In this way, by displaying only blocks that satisfy search query 311, it is possible to quickly check the blocks that satisfy search query 311.

[0150] In table 320 of FIG. 4 , search results are displayed by block. Note that the method of displaying search results is not limited to this. FIG. 7B shows an example in which search results are displayed by document. In FIG. 7B , the items on the vertical axis indicate documents (item: item 353). Furthermore, search query 311 is displayed in the first column of the row of a document that has at least one block that satisfies search query 311, and the first column of the row of a document that does not have a block that satisfies search query 311 is left blank.

[0151] 7B shows that for documents with a third identifier of 1 or 2, at least one of the blocks contained in the document satisfies the search query 311. Also, for documents with a third identifier of 3, it can be seen that none of the blocks contained in the document satisfies the search query 311. In this way, by displaying the search results for each document, the information displayed in table 320 is consolidated, making it easier to grasp the overall picture of the search results for a group of documents.

[0152] 7B shows rows of documents that do not have blocks that satisfy the search query 311, with the first column of the rows being blank, but this is not limiting. As in FIG. 7A, the rows of the documents may be hidden.

[0153] In addition, in table 320 of Figure 7B, it may be necessary to confirm which blocks in a document that satisfies the search query satisfy the search query. Therefore, in table 320 of Figure 7B, a user may select a third identifier or search result (e.g., a document whose third identifier is 2 or search results for that document) with the mouse pointer, and search results for the document corresponding to the selected third identifier or search result may be displayed by block, as shown by the dotted line in Figure 7C. In this case, it can be said that in table 320, search results for some documents are displayed by block, and search results for other documents are displayed by document.

[0154] 7C shows that in a document whose third identifier is 2, blocks whose fourth identifier is 1 or 2 satisfy the search query 311, and blocks whose fourth identifier is p[2] do not satisfy the search query 311. In this way, it is possible to quickly check which blocks in a document satisfy the search query and which do not.

[0155] As described above, the display format of table 320 can be changed by the user selecting an identifier assigned to a document (e.g., the third identifier), an identifier assigned to a block (e.g., the fourth identifier), or a search result with the mouse pointer, thereby enabling efficient confirmation of document search results.

[0156] 4, if a block satisfies the search query, the search result is displayed by outputting the search query, but the method of outputting the search result is not limited to this. For example, the search result may be displayed as a binary value indicating whether or not the block satisfies the search query.

[0157] 7D shows an example of a search result in which, when a search query is received, a block satisfies the search query in binary form. In FIG. 7D, the horizontal axis represents the search query (e.g., search query 311). A circle (○) is displayed in the first column of the row of a block that satisfies search query 311, and a cross (×) is displayed in the first column of the row of a block that does not satisfy search query 311.

[0158] From table 320 in Figure 7D, it can be seen that a block whose third identifier is 2 and whose fourth identifier is 1 satisfies search query 311 (indicated by a circle in the figure). It can also be seen that a block whose third identifier is 3 and whose fourth identifier is 1 does not satisfy search query 311 (indicated by a cross in the figure). In this way, by displaying search results as binary values, document search results can be intuitively confirmed.

[0159] As in Fig. 7A, rows of blocks that do not satisfy search query 311 may be hidden in table 320 of Fig. 7D. As in Fig. 7B, search results may be displayed for each document in table 320 of Fig. 7D. As in Fig. 7C, search results for some documents may be displayed for each block, and search results for other documents may be displayed for each document.

[0160] In addition, when search results are displayed as a binary value indicating whether a document satisfies the search query, it may be difficult to determine which blocks in the document satisfy the search query. Therefore, search results may be displayed as multiple values, or the search results may be displayed using three or more symbols. For example, when displaying search results for each document as shown in FIG. 7B , a first symbol (e.g., a circle) may be used if all blocks in the document satisfy the search query, a second symbol (e.g., a cross) may be used if all blocks in the document do not satisfy the search query, and a third symbol (e.g., a triangle) may be used if only some of the blocks in the document satisfy the search query.

[0161] The method for displaying the search results is not limited to the above. For example, the search results may be displayed by showing in table 320 the number of blocks contained in the document and the number of blocks that satisfy search query 311.

[0162] 8 shows an example of search results when the documents to be searched are composed of documents to which second identifiers have been assigned (documents with the same second identifier). In table 320 in Fig. 8, the items on the vertical axis indicate documents (items: item 351 and item 353) and blocks (item: item 354), and the items on the horizontal axis indicate search queries (item: keyword). Here, item 351 corresponds to the first item.

[0163] 8 illustrates an example in which the document group assigned the second identifier is composed of the first to qth document groups (q is an integer equal to or greater than 1), the jth document group (j is an integer equal to or greater than 1 and equal to or less than q) is composed of m[j] documents (m[j] is an integer equal to or greater than 1), and the kth document (k is an integer equal to or greater than 1 and equal to or less than m[j]), which is one of the m[j] documents, has p[j, k] blocks. The first document group is composed of multiple documents with the same first identifier, and the same is true for each of the second to qth document groups. The number of documents constituting the document group to be searched is the total number of documents included in the first to qth document groups. When n search queries are received, the search results shown in table 320 are the total number of blocks contained in the documents included in the first to qth document groups multiplied by n.

[0164] For example, if the first identifier is an application control number and the second identifier is an application family control number, q corresponds to the number of applications belonging to the same patent family. Furthermore, for a jth application, which is one of the q applications, m[j] corresponds to the number of claims in the jth application. In other words, m[j] corresponds to the number of versions of claims in the jth application.

[0165] 8 shows an example of a search result display in which a single search query (search query 311) is received and, if a block satisfies the search query, the search query is output. In FIG. 8, information identifying each block is displayed in the row of each block. Specifically, a first identifier, a third identifier, and a fourth identifier are displayed. Furthermore, the search query 311 is displayed in the first column of the row of a block that satisfies the search query 311, and the first column of the row of a block that does not satisfy the search query 311 is left blank.

[0166] 8, it can be seen that a block whose first identifier is 1, whose third identifier is 2, and whose fourth identifier is 1 satisfies the search query 311. It can also be seen that a block whose first identifier is 1, whose third identifier is 3, and whose fourth identifier is 1 does not satisfy the search query 311. In this way, by displaying the documents and blocks to be searched in a tabular format, it is possible to efficiently check the results of the document search.

[0167] 9A to 9E are each modified examples of table 320 shown in Fig. 8. In the explanation of Fig. 9A to 9E, parts common to Fig. 8 may be omitted. Note that Fig. 9A to 9E omit display of rows of documents whose first identifier is other than 1 (2 or more).

[0168] 9A , in table 320, rows of blocks that do not satisfy search query 311 may be hidden. This allows only blocks that satisfy search query 311 to be displayed, allowing the user to quickly check which blocks satisfy search query 311.

[0169] 9B and 9D, the search results may be displayed for each document or for each group of documents in table 320. Note that in Fig. 9B, similar to Fig. 7B, search query 311 is displayed in the first column of the row of a document that has at least one block that satisfies search query 311, and the first column of the row of a document that does not have a block that satisfies search query 311 is left blank.

[0170] For example, in FIG. 9B , search results are displayed for each pair of a first identifier and a third identifier. In table 320 in FIG. 9B , a user may select a third identifier or search result (e.g., a document whose first identifier is 1 and whose third identifier is 2, or a search result for that document) with a mouse pointer, thereby displaying the search results for the document corresponding to the selected third identifier or search result in blocks, as indicated by the dotted line in FIG. 9C . In table 320 in FIG. 9C , a user may select a third identifier or a fourth identifier (e.g., a document whose first identifier is 1 and whose third identifier is 2) with a mouse pointer, thereby changing the display format of table 320 shown in FIG. 9B . In table 320 in FIG. 9B , a user may select a first identifier (e.g., a group of documents whose first identifier is 1) with a mouse pointer, thereby changing the display format of table 320 shown in FIG. 8 .

[0171] For example, in Fig. 9D, search results are displayed for each document group having the same first identifier. Note that in table 320 in Fig. 9D, the user may select a first identifier or search result (e.g., a document group having a first identifier of 1 or a search result for that document group) with the mouse pointer, thereby changing the display format of table 320 shown in Fig. 8 or 9B.

[0172] Figure 9E shows a modified example of table 320 shown in Figure 9D. Table 320 shown in Figure 9E is similar to table 320 shown in Figure 9D in that search results are displayed for each first identifier. Note that Figure 9E displays rows of documents in which none of the blocks satisfy search query 311, with the first column of the row left blank.

[0173] Table 320 in Figure 9E differs from table 320 in Figure 9D in that it displays search results for one of multiple documents with a first identifier of 1. For example, the single document for which the search results are displayed may be, for example, the document with the first or last registered third identifier among multiple documents with a first identifier of 1, the document with the most blocks that satisfy the search query, or the document with the fewest blocks that satisfy the search query. Note that, for example, when a user selects one of the first identifier and the third identifier with the mouse pointer, search results for documents assigned that first identifier may be displayed for each third identifier. In other words, the display may be as shown in Figure 9B.

[0174] As described above, by displaying the search results for each document, the information displayed in table 320 is consolidated, making it easier to grasp the overall picture of the search results for a group of documents. Furthermore, the user can change the display format of table 320 by selecting the first identifier, third identifier, fourth identifier, and search result with the mouse pointer. This allows the results of a document search to be checked efficiently.

[0175] 9B to 9E, similar to FIG. 7D, the search results may be represented by a binary value indicating whether or not a document or block satisfies the search query. Alternatively, the search results may be represented by a symbol based on the number of blocks that satisfy the search query, or by displaying the number of blocks contained in a document and the number of blocks that satisfy the search query 311 in table 320.

[0176] The above is an explanation of an example of search results when one search query is received. Next, an example of search results when two search queries are received will be explained.

[0177] 10A shows an example in which a document group to be searched is composed of multiple documents assigned a first identifier, and two search queries are received and displayed as search results by outputting the two search queries, where the two search queries are a first search query 311a and a second search query 311b.

[0178] 10A is common to tables 320 shown in Figures 4 to 7 in that it shows search results when a document group to be searched is made up of multiple documents to which first identifiers are assigned. Therefore, the explanation of table 320 shown in Figure 10A can be made by referring to the explanations of the parts common to Figures 4 to 7.

[0179] In the table 320 of FIG. 10A , the items on the vertical axis represent documents (item: item 353) and blocks (item: item 354), and the items on the horizontal axis represent search queries (item: keyword). That is, in FIG. 10A , the search results for the first search query 311a and the search results for the second search query 311b are displayed in the first column. Specifically, the first search query 311a is displayed in the first column of the row of the block that satisfies the first search query 311a, and the second search query 311b is displayed in the first column of the row of the block that satisfies the second search query 311b. More specifically, the first search query 311a and the second search query 311b are displayed in the first column of the row of the block that satisfies both the first search query 311a and the second search query 311b. Furthermore, the first search query 311a is displayed in the first column of the row of the block that satisfies the first search query 311a but does not satisfy the second search query 311b. Furthermore, the second search query 311b is displayed in the first column of the row of a block that does not satisfy the first search query 311a but satisfies the second search query 311b. The first column of the row of a block that does not satisfy the first search query 311a or the second search query 311b is left blank.

[0180] 10A , it can be seen that a block whose third identifier is 1 and whose fourth identifier is 2 satisfies the first search query 311a but does not satisfy the second search query 311b. It can also be seen that a block whose third identifier is 2 and whose fourth identifier is 2 does not satisfy the first search query 311a but satisfies the second search query 311b. Therefore, when the third identifier of a block whose fourth identifier is 2 changes from 1 to 2, it can be quickly determined that the keyword in the first search query 311a has changed to the keyword in the second search query 311b. In this way, by displaying a list of documents or blocks that satisfy at least one search query in a tabular format, it is possible to efficiently check the evolution of documents and the results of document searches.

[0181] In FIG. 10A, rows of blocks that do not satisfy the first search query 311a and the second search query 311b are displayed, and the first column of the rows is left blank, but the rows of the blocks may also be hidden.

[0182] 10B to 10D are each modified examples of table 320 shown in Fig. 10A. Table 320 shown in Fig. 10B to 10D is common to table 320 shown in Fig. 10A in that it shows search results when a document group to be searched is made up of multiple documents assigned a first identifier and two search queries (a first search query and a second search query) are received. In the description of Fig. 10B to 10D, the description of parts common to Fig. 10A may be omitted.

[0183] Table 320 in FIG. 10B displays search results for one of the blocks in the document. For example, table 320 in FIG. 10B displays search results for a block whose fourth identifier is 2, but does not display search results for blocks whose fourth identifier is other than 2. Table 320 in FIG. 10B shows that a block whose third identifier is 1 and whose fourth identifier is 2 satisfies first search query 311a but does not satisfy second search query 311b. It can also be seen that a block whose third identifier is 2 and whose fourth identifier is 2 does not satisfy first search query 311a but does satisfy second search query 311b. In this way, by displaying only search results for blocks with the same fourth identifier, the transition of blocks can be quickly confirmed.

[0184] In the table 320 shown in FIG. 10C , search results are displayed for each document. In FIG. 10C , the items on the vertical axis represent documents (items: items 353). In FIG. 10C , the first search query 311a is displayed in the first column of the row of a document that has at least one block that satisfies the first search query 311a, and the second search query 311b is displayed in the first column of the row of a document that has at least one block that satisfies the first search query 311a and at least one block that satisfies the second search query 311b. Specifically, the first search query 311a and the second search query 311b are displayed in the first column of the row of a document that has at least one block that satisfies the first search query 311a and at least one block that satisfies the second search query 311b. Furthermore, the first search query 311a is displayed in the first column of the row of a document that has at least one block that satisfies the first search query 311a and no blocks that satisfy the second search query 311b. Additionally, a second search query 311b is displayed in the first column of the row of a document that does not have any blocks that satisfy the first search query 311a but has at least one block that satisfies the second search query 311b. Additionally, the first column of the row of a document that does not have any blocks that satisfy the first search query 311a and does not have any blocks that satisfy the second search query 311b is left blank.

[0185] 10C , it can be seen that a document having a third identifier of 1 has one or more blocks that satisfy the first search query 311a. It can also be seen that a document having a third identifier of 2 has at least one block that satisfies the first search query 311a and at least one block that satisfies the second search query 311b. It can also be seen that a document having a third identifier of 3 has one or more blocks that satisfy the second search query 311b. By displaying the search results for each document in this way, the information displayed in table 320 is consolidated, making it easier to grasp the overall picture of the search results for a group of documents.

[0186] In table 320 of Fig. 10D, search results are displayed as a binary value indicating whether or not the document or block satisfies the search query. In table 320 of Fig. 10D, the items on the horizontal axis represent search queries (e.g., first search query 311a and second search query 311b). That is, in Fig. 10D, the first column shows search results for first search query 311a, and the second column shows search results for second search query 311b.

[0187] 10D, it can be seen that a block whose third identifier is 1 and whose fourth identifier is 2 satisfies the first search query 311a (shown as a circle in the figure) but does not satisfy the second search query 311b (shown as a cross in the figure). It can also be seen that a block whose third identifier is 2 and whose fourth identifier is 2 does not satisfy the first search query 311a but does satisfy the second search query 311b. In this way, by displaying the search results as two values, the document search results can be intuitively confirmed.

[0188] As described above, the display format of the table 320 can be changed by the user selecting an identifier assigned to a document (e.g., the third identifier), an identifier assigned to a block (e.g., the fourth identifier), or a search result with the mouse pointer, thereby enabling efficient confirmation of document search results.

[0189] Furthermore, when a document or block is displayed in area 330, it is preferable that the keyword input as first search query 311a (referred to as the "first keyword") and the keyword input as second search query 311b (referred to as the "second keyword") be highlighted using different highlighting methods. For example, if the first keyword in a sentence is highlighted using one of the following methods, such as underlining, thickening the lines, distinguishing the color of the characters from the other characters, or highlighting, it is preferable to highlight the second keyword in the sentence using a method different from the method used to highlight the first keyword. Alternatively, for example, the first keyword and the second keyword in the sentence may be highlighted using different highlighting colors, different types of underlining, or different character colors.

[0190] [Display Example] An example of a method for displaying document search results will now be described with reference to Figures 11 and 12. Figures 11 and 12 show an example of a graphic user interface (GUI) related to the document search system of this embodiment.

[0191] In the following example, the database is an application database, and the document group to be searched consists of multiple patent claims. Note that, since the amended claims are described in the amendment, the document group to be searched may include one or more amendments.

[0192] When searching for patent documents, it is preferable to group and display documents belonging to the same patent family using software such as INPADOC (registered trademark). Because documents belonging to the same patent family are highly similar, grouping and displaying the results significantly improves the efficiency of reviewing search results and document content. Furthermore, applications belonging to the same patent family share the same specifications. Therefore, if the evolution of patent application documents (especially claims) can be quickly confirmed, for example, within a single patent family, users can efficiently review other applications by referring to the prosecution history of one application (e.g., the evolution of claims).

[0193] In the following, an example will be shown in which the first item is an application management number (including a unique number within the company, an arbitrary number designated by the user, etc.) and the second item is an application family management number.

[0194] In this case, if the document group to be searched is made up of multiple documents with the same first identifier, the document group to be searched is a document group belonging to the same application. Alternatively, if the document group to be searched is made up of multiple documents with the same second identifier, the document group to be searched is a document group belonging to the same patent family. Below, an example will be shown in which the document group to be searched is a document group belonging to the same patent family.

[0195] When an application is pending, the claims may be amended before or during examination. The claims may also be corrected after patent registration. When claims are amended or corrected, the application will contain both the pre-amendment or pre-correction claims and the amended or corrected claims. In other words, when claims are amended or corrected, the application database will contain multiple documents (claims) with the same application management number. Note that "amendment of claims" as used in this specification includes "correction of claims."

[0196] In addition, whether or not the claims have been amended can be confirmed by looking at documents managed as application progress records or examination records. In other words, claims may be assigned a history management number (including a unique number within the company or an arbitrary number designated by the user). In this case, documents with the same application management number will each have a different history management number.

[0197] In the following example, the third item is a history management number and the fourth item is a paragraph number. Note that, since the paragraph numbers in the claims correspond to the claim numbers, the paragraph numbers as the fourth item can be rephrased as claim numbers. Furthermore, the blocks of a document are claims.

[0198] In the above, if the number of the third item is two or more, at least one document to be searched includes multiple versions.

[0199] 11, when a user inputs "Patent A" as a first identifier in area 301 and then selects icon 303a marked "Search" with the mouse pointer, the document search system extracts, as documents to be searched, documents that belong to the same patent family as Patent A. In FIG. 11, it is assumed that at least Patent B belongs to the same patent family as Patent A.

[0200] Next, when the user inputs "transistor" as a search query in area 302, the keyword "transistor" becomes search query 311. Next, when the user selects icon 303b marked "Search" with the mouse pointer, the document search system obtains search results based on search query 311 for each of one or more blocks contained in each of the multiple documents included in the document group.

[0201] Table 320 showing the search results is shown in Fig. 11. Fig. 11 is an example of displaying search results by outputting a search query. In Fig. 11, the search results for Patent A are shown for each block, and the search results for Patent B are shown for each document.

[0202] In table 320 of FIG. 11, the items on the vertical axis indicate documents (items: Name (e.g., Patent A) and Log (e.g., 1)) and blocks (item: No., e.g., 1), and the items on the horizontal axis indicate keywords (item: Keyword). Here, "Name" corresponds to the first item (application management number), "Log" corresponds to the third item (history management number), and "No." corresponds to the fourth item (claim number).

[0203] From Table 320 in FIG. 11 , it can be seen that in Patent A, a block (here, a claim) with a Log (third identifier) ​​of 2 and a No. (fourth identifier) ​​of 1 contains "transistor." It can also be seen that in Patent A, a block with a Log of 3 and a No. of 1 does not contain "transistor." Therefore, when the third identifier (management history number) in Patent A changes from 2 to 3, it can be quickly determined that the keyword "transistor" contained in the block (claim) with a fourth identifier (claim number) of 1 has been replaced with another word or deleted. In this way, by displaying a list of documents or blocks that satisfy a search query in a tabular format, it is possible to efficiently check the evolution of documents or blocks and the results of document searches.

[0204] 11 shows an example in which area 310 includes area 330 displaying the contents of a document or block in addition to table 320 showing the search results. In FIG. 11, search result 321 is selected. Area 330 displays the block in Patent A whose Log is 2 and whose No. is 1. In area 330, the keyword "transistor" is underlined to emphasize the keyword in the sentence.

[0205] Next, Figure 12 shows an example in which a user enters two keywords, "transistor" and "switch," as search queries in area 302. In Figure 12, a line break is used as a delimiter between keywords. In this case, the first search query 311a is the keyword "transistor," and the second search query 311b is the keyword "switch." When the user selects icon 303b marked "Search" with the mouse pointer, the document search system obtains search results for each of the first search query 311a and the second search query 311b for one or more blocks contained in each of the multiple documents included in the document group.

[0206] FIG. 12 is an example of displaying search results by outputting a search query. In FIG. 12, search results for Patent A are shown by block, and search results for Patent B are shown by document. Note that table 320 shown in FIG. 12 is common to table 320 shown in FIG. 11 in that the documents to be searched belong to the same patent family as Patent A. Therefore, the explanation of the common parts with FIG. 11 can be used to explain table 320 shown in FIG. 12.

[0207] In table 320 of FIG. 12, the items on the vertical axis indicate documents (items: Name (e.g., Patent A) and Log (e.g., 1)) and blocks (item: No., e.g., 1), and the items on the horizontal axis indicate search queries (item: Keyword). Here, "Name" corresponds to the first item (application management number), "Log" corresponds to the third item (history management number), and "No." corresponds to the fourth item (claim number).

[0208] From Table 320 in FIG. 12 , it can be seen that in Patent A, a block (here, a claim) with a Log (third identifier) ​​of 2 and a No. (fourth identifier) ​​of 1 contains "transistor" but does not contain "switch." Furthermore, in Patent A, a block with a Log of 3 and a No. of 1 contains "switch" but does not contain "transistor." Therefore, when the third identifier (management history number) in Patent A changes from 2 to 3, it can be quickly determined that the keyword "transistor" contained in the block (claim) with a fourth identifier (claim number) of 1 has been replaced with the keyword "switch." In this way, by displaying a list of documents or blocks satisfying a search query in a tabular format, it is possible to efficiently confirm the evolution of documents or blocks and the results of document searches.

[0209] FIG. 12 shows an example in which area 310 includes area 330 displaying the contents of a document or block in addition to table 320 showing search results. In FIG. 12, search results 321 and 322 are selected. Area 330 displays the block in Patent A with a Log value of 2 and a No. of 1, and the block with a Log value of 3 and a No. of 1. Area 330 also highlights the keywords in the sentence by underlining the keyword "transistor" with a straight line and underlining the keyword "switch" with a wavy line. In this way, when multiple search queries are accepted, different highlighting methods can be used to quickly determine whether a keyword has changed. This allows for efficient confirmation of document evolution.

[0210] As described above, the document search system of this embodiment allows efficient confirmation of document evolution. Furthermore, it also allows efficient searches using multiple search queries and confirmation of search results. This allows necessary information to be obtained in a short time, even when there are many documents to be searched. Furthermore, even when there are many documents to be searched, the contents of the documents can be efficiently understood without missing any.

[0211] This embodiment mode can be combined with other embodiment modes as appropriate. In addition, in this specification, when a plurality of configuration examples are shown in one embodiment mode, the configuration examples can be combined as appropriate.

[0212] Embodiment 2 In this embodiment, a document search system according to one embodiment of the present invention will be described with reference to FIGS.

[0213] <Document Search System 2> Fig. 13 shows a block diagram of a document search system 210. The document search system 210 has a server 220 and a terminal 230 (such as a personal computer). Note that for the same components as those in the document search system 100 shown in Fig. 1, the description of <Document Search System 1> in the first embodiment can also be referred to.

[0214] The server 220 includes a communication unit 171a, a transmission path 172, a storage unit 120, and a processing unit 130. Although not shown in Fig. 13, the server 220 may further include at least one of a reception unit, a database, an output unit, an input unit, etc.

[0215] The terminal 230 has a communication unit 171b, a transmission path 174, an input unit 115, a storage unit 125, a processing unit 135, and a display unit 145. Examples of the terminal 230 include a tablet terminal, a notebook information terminal, and various portable information terminals. Alternatively, the terminal 230 may be a desktop information terminal that does not have the display unit 145, and the terminal 230 may be connected to a monitor or the like that functions as the display unit 145.

[0216] A user of the document search system 210 inputs the identifier of a document group to be searched and a search query to the server 220 via the input unit 115 of the terminal 230. The input contents are transmitted from the communication unit 171b to the communication unit 171a. For example, the identifier of the document group to be searched and the search query are transmitted from the communication unit 171b to the communication unit 171a.

[0217] The information received by the communication unit 171a is stored in the memory of the processing unit 130 or in the storage unit 120 via the transmission path 172. Furthermore, the information may be supplied from the communication unit 171a to the processing unit 130 via a reception unit (see reception unit 110 shown in FIG. 1 ).

[0218] The various processes described in the <Document Search Result Display Method> of the first embodiment are performed by the processing unit 130. Because these processes require high processing power, they are preferably performed by the processing unit 130 of the server 220. The processing unit 130 preferably has a higher processing power than the processing unit 135.

[0219] The processing result of the processing unit 130 is stored in the memory of the processing unit 130 or in the storage unit 120 via the transmission path 172. Thereafter, the processing result is output from the server 220 to the display unit 145 of the terminal 230. The processing result is transmitted from the communication unit 171a to the communication unit 171b. Furthermore, based on the processing result of the processing unit 130, various data included in the database may be transmitted from the communication unit 171a to the communication unit 171b. Furthermore, the processing result may be supplied from the processing unit 130 to the communication unit 171a via an output unit (the output unit 140 shown in FIG. 1 ).

[0220] [Communication Units 171a and 171b] Using the communication units 171a and 171b, data can be transmitted and received between the server 220 and the terminal 230. A hub, a router, a modem, or the like can be used as the communication units 171a and 171b. Data can be transmitted and received using either a wired connection or wirelessly (for example, radio waves, infrared rays, etc.).

[0221] [Transmission Path 172 and Transmission Path 174] The transmission paths 172 and 174 have the function of transmitting data. Data can be transmitted and received between the communication unit 171a, the storage unit 120, and the processing unit 130 via the transmission path 172. Data can be transmitted and received between the communication unit 171b, the input unit 115, the storage unit 125, the processing unit 135, and the output unit 140 via the transmission path 174.

[0222] The input unit 115 can be used by a user to specify a document group and a search query. For example, the input unit 115 can have a function for operating the terminal 230, and specific examples of the input unit 115 include a mouse, a keyboard, a touch panel, a microphone, a scanner, a camera, and the like.

[0223] The document search system 210 may have a function of converting voice data into text data. For example, at least one of the processing unit 130 and the processing unit 135 may have this function.

[0224] The document search system 210 may have an optical character recognition (OCR) function, which allows it to recognize characters included in image data and create text data. For example, at least one of the processing unit 130 and the processing unit 135 may have this function.

[0225] [Storage Unit 125] The storage unit 125 may store one or both of data related to documents and data supplied from the server 220. Furthermore, the storage unit 125 may store at least a portion of the data that the storage unit 120 can store.

[0226] [Processing Unit 130 and Processing Unit 135] The processing unit 135 has a function of performing calculations and the like using data supplied from the communication unit 171b, the storage unit 125, the input unit 115, etc. The processing unit 135 may have a function of executing at least a part of the processing that can be performed by the processing unit 130.

[0227] The processing section 130 and the processing section 135 can each have one or both of a transistor having a metal oxide in a channel formation region and a transistor having silicon in a channel formation region (Si transistor).

[0228] Note that in this specification and the like, a transistor whose channel formation region includes an oxide semiconductor or a metal oxide is referred to as an oxide semiconductor transistor or an OS transistor. The channel formation region of an OS transistor preferably includes a metal oxide.

[0229] In this specification and the like, a metal oxide refers to an oxide of a metal in a broad sense. Metal oxides are classified into oxide insulators, oxide conductors (including transparent oxide conductors), oxide semiconductors (also referred to as oxide semiconductors or simply as OSs), and the like. For example, when a metal oxide is used for a semiconductor layer of a transistor, the metal oxide may be referred to as an oxide semiconductor. In other words, when a metal oxide can form a channel formation region of a transistor having at least one of an amplifying function, a rectifying function, and a switching function, the metal oxide can be referred to as a metal oxide semiconductor, or OS for short.

[0230] The metal oxide included in the channel formation region preferably contains indium (In). When the metal oxide included in the channel formation region contains indium, the carrier mobility (electron mobility) of the OS transistor is increased. Furthermore, the metal oxide included in the channel formation region is preferably an oxide semiconductor containing an element M. The element M is preferably at least one of aluminum (Al), gallium (Ga), and tin (Sn). Other elements that can be used as the element M include boron (B), silicon (Si), titanium (Ti), iron (Fe), nickel (Ni), germanium (Ge), yttrium (Y), zirconium (Zr), molybdenum (Mo), lanthanum (La), cerium (Ce), neodymium (Nd), hafnium (Hf), tantalum (Ta), and tungsten (W). However, a combination of two or more of the above elements may be used as the element M. The element M is, for example, an element having a high bond energy with oxygen. For example, the element M is an element having a higher bond energy with oxygen than indium. The metal oxide contained in the channel formation region is preferably a metal oxide containing zinc (Zn), since zinc-containing metal oxides may be easily crystallized.

[0231] The metal oxide contained in the channel formation region is not limited to a metal oxide containing indium. The semiconductor layer may be, for example, a metal oxide containing zinc but not indium, such as zinc tin oxide or gallium tin oxide, a metal oxide containing gallium, or a metal oxide containing tin.

[0232] The processing unit 130 preferably includes an OS transistor. Because an OS transistor has an extremely low off-state current, using the OS transistor as a switch for retaining charge (data) flowing into a capacitor functioning as a memory element can ensure a long data retention period. By utilizing this characteristic in at least one of the register and cache memory of the processing unit 130, the processing unit 130 can be operated only when necessary and can be turned off in other cases by saving information from the previous process to the memory element. In other words, normally-off computing is possible, thereby enabling low power consumption in the document search system. The same applies to the processing unit 135.

[0233] [Display Unit 145] The display unit 145 has a function of displaying output results. Examples of the display unit 145 include display devices such as liquid crystal display devices and light-emitting display devices. Examples of light-emitting elements that can be used in light-emitting display devices include LEDs (Light Emitting Diodes), OLEDs (Organic LEDs), QLEDs (Quantum-dot LEDs), and semiconductor lasers. The display unit 145 can also be a display device using a shutter-type or optical interference-type MEMS (Micro Electro Mechanical Systems) element, or a display device using a display element that applies a microcapsule type, an electrophoresis type, an electrowetting type, or an electronic liquid powder (registered trademark) type.

[0234] FIG. 14 shows an image diagram of the document search system according to this embodiment.

[0235] 14 includes a server 5100 and terminals (which may also be considered electronic devices). Communication between the server 5100 and each terminal can be performed via an internet line 5110.

[0236] The server 5100 can perform calculations using data input from a terminal via the Internet line 5110. The server 5100 can transmit the results of the calculations to the terminal via the Internet line 5110. This can reduce the calculation load on the terminal.

[0237] 14 illustrates an information terminal 5300, an information terminal 5400, and an information terminal 5500 as terminals. The information terminal 5300 is an example of a mobile information terminal such as a smartphone. The information terminal 5400 is an example of a tablet terminal. The information terminal 5400 can also be used as a notebook information terminal by connecting it to a housing 5450 having a keyboard. The information terminal 5500 is an example of a desktop information terminal.

[0238] With such a configuration, a user can access the server 5100 from an information terminal 5300, an information terminal 5400, an information terminal 5500, or the like. The user can receive a service provided by an administrator of the server 5100 through communication via the Internet line 5110. For example, the service may be a service using the document search method of one embodiment of the present invention. In the service, the server 5100 may use artificial intelligence.

[0239] This embodiment mode can be combined with other embodiment modes as appropriate.

[0240] 100: document search system, 110: reception unit, 115: input unit, 120: storage unit, 125: storage unit, 130: processing unit, 135: processing unit, 140: output unit, 145: display unit, 150: transmission path, 171a: communication unit, 171b: communication unit, 172: transmission path, 174: transmission path, 210: document search system, 220: server, 230: terminal, 300a: area, 300b: area, 300: area, 301: area, 302: area, 303a: eye icon, 303b: icon, 303: icon, 304: mouse pointer, 310: area, 311a: first search query, 311b: second search query, 311: search query, 320: table, 321: search results, 322: search results, 330: area, 351: item, 353: item, 354: item, 5100: server, 5110: internet line, 5300: information terminal, 5400: information terminal, 5450: housing, 5500: information terminal

Claims

1. A storage unit, a reception unit, a processing unit, and an output unit are included, the storage unit has a database, the reception unit has a function of receiving a search query and an identifier; the processing unit has a function of retrieving a plurality of documents associated with the identifier from the database, and a function of acquiring search results based on the search query for each of one or more blocks contained in each of the plurality of documents retrieved from the database; the output unit has a function of outputting the search results obtained for the blocks as a first table together with the identifiers that identify documents having the blocks. Document search system.

2. In claim 1, the search results are output to the first table by outputting the search query when each of the plurality of documents has at least one block that satisfies the search query; Document search system.

3. A storage unit, a reception unit, a processing unit, and an output unit are included, the storage unit has a database, the receiving unit has a function of receiving a first search query, a second search query, and an identifier; the processing unit has a function of retrieving a plurality of documents associated with the identifier from the database, and a function of obtaining a first search result based on the first search query and a second search result based on the second search query for each of one or more blocks contained in each of the plurality of documents retrieved from the database; the output unit has a function of outputting the first search result and the second search result obtained for the block as a first table together with the identifier that identifies a document having the block. Document search system.

4. In claim 3, In the first table, for each of the plurality of documents, if the document has at least one block that satisfies the first search query, the first search result is output by outputting the first search query, and if the document has at least one block that satisfies the second search query, the second search result is output by outputting the second search query. Document search system.

5. In any one of claims 1 to 4, the database is an application database, each of said plurality of documents being a claim; the identifier is an application control number or an application family control number; The block is a claim. Document search system.