A patent search sentence design method, device, medium and equipment

Abstract

The application provides a patent search sentence design method and device, a medium and equipment. The method comprises the following steps: identifying a logical operator in a search formula; based on the logical operator, splitting the search formula into at least one search term group; wherein the search term group comprises at least one search term; identifying the category of the search term group; based on the category of the search term group, generating an extended search term of the search term group; and based on the category of the search term group, the search term group and the extended search term, generating a search sentence of the search formula. That is, the search formula is split into search term groups according to the logical operator, the extended search term is generated by identifying the category of the search term group, and a more accurate search sentence is generated in combination with the category of the search term group, the search term group and the extended search term, so as to provide a more expected patent file for the searcher, reduce the search difficulty and improve the search efficiency and effect.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of patent data retrieval, and particularly relates to a design method and device of a patent retrieval sentence, a medium and equipment. BACKGROUND

[0002] Patent retrieval is a channel and method for specifically searching for patents. Through patent retrieval, the status of existing technologies can be understood, and repeated development can be avoided, thereby saving research and development time and funds. Moreover, through retrieval, relevant comparison files can be obtained, which is helpful for an applicant to perfect a technical solution, so as to better propose a technical solution and obtain the best protection effect.

[0003] In the prior art, when searching, in order to quickly obtain a search result, only a keyword input by a user and a relationship between the keywords are compared with a title and an abstract of a patent file, and it is determined whether the content meets the search condition input by the user, and then a patent file meeting the search condition input by the user is returned. Since a retriever is likely to be a non-professional person, the retriever is not very accurate when setting a retrieval formula, and therefore it is difficult to achieve an expected result. Therefore, a method for simply understanding a retrieval formula of a retriever and obtaining a relatively accurate retrieval sentence is urgently needed. SUMMARY

[0004] In order to solve the above technical problem, the present application is provided. Embodiments of the present application provide a design method, device, medium and equipment of a patent retrieval sentence.

[0005] According to an aspect of the present application, a design method of a patent retrieval sentence is provided, including: identifying a logical operator symbol in a retrieval formula; based on the logical operator symbol, splitting the retrieval formula into at least one retrieval term group; wherein the retrieval term group includes at least one retrieval term; identifying a category of the retrieval term group; based on the category of the retrieval term group, generating an extended retrieval term of the retrieval term group; and based on the category of the retrieval term group, the retrieval term group and the extended retrieval term, generating a retrieval sentence of the retrieval formula.

[0006] In an embodiment, the splitting of the retrieval formula into at least one retrieval term group based on the logical operator symbol includes: converting the retrieval formula into a syntax analysis tree based on the logical operator symbol; wherein each branch of the syntax analysis tree corresponds to one retrieval term group.

[0007] In an embodiment, the identification of the category of the retrieval term group includes: if the retrieval term group contains a category identifier, determining the category of the retrieval term group based on the category identifier; and if the retrieval term group does not contain a category identifier, interpreting semantics of all retrieval terms in the retrieval term group to obtain retrieval term semantics; and based on the retrieval term semantics, analyzing the category of the retrieval term group.

[0008] In an embodiment, the method further comprises: obtaining a previous search formula within a preset time of the search formula; comparing the previous search formula with the search formula to obtain a difference search term group between the previous search formula and the search formula; wherein the difference search term group represents a search term group existing in the search formula and not existing in the previous search formula; and generating the extended search term of the search term group based on the category of the search term group comprises: generating the extended search term of the difference search term group based on the category of the difference search term group.

[0009] In an embodiment, the generating the extended search term of the search term group based on the category of the search term group comprises: if the category of the search term group is a keyword, generating the synonyms of all search terms in the search term group to obtain the extended search term of the search term group.

[0010] In an embodiment, the generating the extended search term of the search term group based on the category of the search term group comprises: if the category of the search term group is an applicant or a patentee, obtaining all expression terms of the search term in the search term group to obtain the extended search term of the search term group.

[0011] In an embodiment, the generating the search sentence of the search formula based on the category of the search term group, the search term group and the extended search term comprises: adding the extended search term into the corresponding search term group to obtain a new search term group; and obtaining the search sentence based on the new search term group and the category of the search term group.

[0012] According to another aspect of the present application, there is provided a device for designing a patent search sentence, comprising: an operator symbol identification module configured to identify a logical operator symbol in a search formula; a search term group division module configured to divide the search formula into at least one search term group based on the logical operator symbol; wherein the search term group comprises at least one search term; a term group category identification module configured to identify the category of the search term group; an extended search generation module configured to generate an extended search term of the search term group based on the category of the search term group; and a search sentence generation module configured to generate a search sentence of the search formula based on the category of the search term group, the search term group and the extended search term.

[0013] According to another aspect of the present application, there is provided a computer readable storage medium storing a computer program for executing any of the above-mentioned methods.

[0014] According to another aspect of the present application, there is provided an electronic device comprising: a processor; a memory for storing instructions executable by the processor; the processor configured to perform any of the methods described above.

[0015] The application provides a patent retrieval sentence design method, device, medium and equipment. The method comprises the following steps: identifying a logical operator in a retrieval formula; splitting the retrieval formula into at least one retrieval term group based on the logical operator; wherein the retrieval term group comprises at least one retrieval term; identifying the category of the retrieval term group; generating an extended retrieval term of the retrieval term group based on the category of the retrieval term group; and generating a retrieval sentence of the retrieval formula based on the category of the retrieval term group, the retrieval term group and the extended retrieval term. The retrieval sentence is more accurate, and the retrieval personnel can obtain more expected patent files, and the retrieval difficulty is reduced and the retrieval efficiency and effect are improved. BRIEF DESCRIPTION OF DRAWINGS

[0016] The above and other objects, features and advantages of the present application will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which: The accompanying drawings are included to provide a further understanding of the embodiments of the present application and constitute a part of the specification. The embodiments of the present application are explained with reference to the drawings, and are used to explain the present application, and do not constitute a limitation on the present application. In the drawings, the same reference numerals generally represent the same components or steps.

[0017] Figure 1 is a flowchart of a patent retrieval sentence design method provided by an exemplary embodiment of the present application.

[0018] Figure 2 is a structural diagram of a patent retrieval sentence design device provided by an exemplary embodiment of the present application.

[0019] Figure 3 is a structural diagram of an electronic device provided by an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0020] Hereinafter, example embodiments according to the present application will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, and not all embodiments of the present application, and it should be understood that the present application is not limited to the example embodiments described herein.

[0021] Figure 1 is a flowchart of a patent retrieval sentence design method provided by an exemplary embodiment of the present application. As shown in Figure 1 the patent retrieval sentence design method comprises the following steps:

[0022] Step 110: identifying the logical operator in the search formula.

[0023] The patent search statement involved in the present application is applied to a patent search website or a corresponding search system. After a search personnel inputs a self-edited search formula in the search website or the search system, the search website or the search system identifies the logical operator in the search formula, such as "AND", "OR", "NOT", etc., to learn the connection relationship of each part in the search formula.

[0024] Step 120: splitting the search formula into at least one search term group based on the logical operator.

[0025] The search term group includes at least one search term. According to the logical operator, the present application splits the search formula into at least one search term group. For example, the search formula input by the search personnel is: vehicle AND (hybrid OR mix OR pure electric) AND (motor OR electric motor). The present application identifies two logical operators "AND", and thus splits the search formula into three parts (corresponding to three search term groups) at "AND", i.e., the first search term group is "vehicle", the second search term group is "(hybrid OR mix OR pure electric)", and the third search term group is "(motor OR electric motor)". The first search term group contains one search term, the second search term group contains three search terms, and the third search term group contains two search terms.

[0026] Step 130: identifying the category of the search term group.

[0027] The present application identifies the category of the search term group to determine the corresponding search category of the search term group. For example, the category of the search term group in the above search formula is "keyword". It should be understood that the category of the search term group can also include IPC classification number, applicant, patentee, inventor, application number, publication number, application date, publication date, etc. The present application identifies the category of the search term group, and thus can search the corresponding field in the database according to the category of the search term group, which not only improves the search efficiency, but also makes the search more targeted to improve the search accuracy.

[0028] Step 140: generating an extended search term of the search term group based on the category of the search term group.

[0029] After identifying the category of the search term group, the present application generates an extended search term of the search term group according to the category of the search term group, i.e., extends and extends the search term group according to the category of the search term group, to further expand the search based on the search formula, so as to improve the effect of the search.

[0030] Step 150: generating a search sentence of the search formula based on the category of the search group, the search group and the extended search word.

[0031] After the search group is extended, the present application generates a more reasonable and perfect search sentence based on the category of the search group, the search group and the extended search word, so as to make up for the defects of insufficient experience or lack of professionalism of the searcher and provide more accurate search results for the searcher.

[0032] The design method of the patent search sentence provided by the present application comprises the following steps: identifying a logical operator in a search formula; based on the logical operator, splitting the search formula into at least one search group; wherein the search group comprises at least one search word; identifying the category of the search group; based on the category of the search group, generating an extended search word of the search group; and based on the category of the search group, the search group and the extended search word, generating a search sentence of the search formula. That is, the search formula is split into search groups according to the logical operator, the extended search word is generated by identifying the category of the search group, and a more accurate search sentence is generated based on the category of the search group, the search group and the extended search word, so as to provide more expected patent files for the searcher, reduce the search difficulty and improve the search efficiency and effect.

[0033] In an embodiment, the specific implementation of the above-mentioned step 120 can be: based on the logical operator, converting the search formula into a syntax analysis tree; wherein each branch of the syntax analysis tree corresponds to one search group.

[0034] The present application converts the search formula into a syntax analysis tree according to the logical operator. Specifically, two parts in parallel in the syntax analysis tree correspond to two search groups connected by the logical operator "AND" in the search formula, and the parts in series in the syntax analysis tree correspond to multiple search groups connected by the logical operator "OR" in the search formula. The present application can convert a complex search formula into a syntax analysis tree with clear logic through rewriting, so that the syntax analysis tree can be extended according to the demand. Preferably, the present application can extend the search group according to the number of each branch in the syntax analysis tree, for example, extending the search group with more branches than other branches. Since the searcher usually extends the key content or technical point he wants to search for, but does not extend the non-key content (for example, the keyword "vehicle"), however, due to lack of professional skills, the searcher may not extend enough or there may be synonymous expressions not included, therefore, the present application preferentially extends the search group with more series structure (i.e., the search group with more logical operators "OR") according to the number of series structure in the syntax analysis tree, so as to quickly improve the quality of the search sentence.

[0035] Optionally, after obtaining the syntax analysis tree, the application selects the branch with the most nodes (concatenation structure) in the syntax analysis tree as the main branch, and takes the main branch as the main search object to search and display the corresponding search results. Generally, the number of patent documents obtained by searching is large. By selecting the main branch for searching, the patent documents closest to the expected documents of the searcher can be preferentially displayed, thereby improving the search efficiency.

[0036] In an embodiment, the specific implementation of the above step 130 can be: if the search term group contains a category identifier, determining the category of the search term group based on the category identifier; if the search term group does not contain a category identifier, interpreting all search terms in the search term group to obtain search term semantics; based on the search term semantics, analyzing the category of the search term group.

[0037] If the search formula contains a category identifier, such as the English abbreviation of the IPC classification number, the applicant, the patentee, the inventor, the application number, the publication number, the application date, the publication date, etc., after the category identifier is identified, it is determined that the search term group between the category identifier and the next category identifier corresponds to the category identifier. If the search term group does not contain a category identifier, all search terms in the search term group are interpreted to obtain the search term semantics of the search terms, i.e., the semantic information of the search terms, and the category of the search term group is analyzed according to the search term semantics. Preferably, after the application interprets the search term semantics of all search terms in the same search term group, it compares the search term semantics. If the search term semantics of all search terms in the same search term group belong to the same category, the category is identified and determined as the category of the search term group. If the search term semantics of all search terms in the same search term group do not belong to the same category, an error is reported and the search term group is highlighted (e.g., highlighted or displayed in a special color). Preferably, if part of the search term groups in the search formula contain a category identifier and the other part do not contain a category identifier, the application first performs preliminary category division on the search formula according to the contained category identifier, and then determines the category of each category obtained by the preliminary category division (using the above method of determining whether the search terms in the search term group belong to the same category).

[0038] In an embodiment, the design method of the above patent search sentence can further include: obtaining the previous search formula within a preset time of the search formula; comparing the previous search formula and the search formula to obtain the difference search term group between the previous search formula and the search formula; wherein the difference search term group represents a search term group that exists in the search formula and does not exist in the previous search formula; correspondingly, the specific implementation of the above step 140 can be: generating an extended search term for the difference search term group based on the category of the difference search term group.

[0039] Since the same searcher may obtain the desired patent documents by adjusting the search formula during searching, if the search sentence is regenerated every time the search formula is adjusted, not only the computing power will be wasted, but also the difference between the search results will not be great every time, so that the search results are difficult to satisfy. Therefore, the present application performs relevance analysis on multiple search formulas input by the same searcher within a preset time, compares the previous search formula and the current search formula to determine the difference search term group between the previous search formula and the current search formula, and the difference search term group is usually the key search term group expected to be adjusted by the searcher to obtain different search results. The present application expands the difference search term group by obtaining the search term group that does not appear in the previous search formula (which can be one or multiple) in the current search formula, so as to improve the search effect.

[0040] In an embodiment, the specific implementation of the above step 140 can be: if the category of the search term group is a keyword, the synonyms of all search terms in the search term group are generated to obtain the expanded search terms of the search term group.

[0041] If the category of the search term group is a keyword, the synonyms or synonyms of the existing keywords in the search formula can be expanded, so as to expand the search term group and obtain more comprehensive search sentences and more comprehensive search documents.

[0042] In an embodiment, the specific implementation of the above step 140 can be: if the category of the search term group is an applicant or a patentee, all the expression terms of the search term in the search term group are obtained to obtain the expanded search terms of the search term group.

[0043] If the category of the search term group is an applicant or a patentee, or other search categories with multiple expression methods, all the expression terms of the search term in the search term group are obtained to achieve the purpose of expanding the search term group. For example, the category of the search term group is an applicant, and the search term group is BYD. The multiple expression methods of BYD can be expanded, such as the abbreviation BYD, the English name of BYD, etc.

[0044] In an embodiment, the specific implementation of the above step 150 can be: adding the expanded search term to the corresponding search term group to obtain a new search term group; and obtaining the search sentence based on the new search term group and the category of the search term group.

[0045] The present application adds the expanded search term to the corresponding search term group to obtain an updated search term group, and comprehensively obtains a more reasonable and comprehensive search sentence based on the updated search term group and the category of the search term group, so as to improve the search efficiency and effect.

[0046] Figure 2is a structural schematic view of a patent search sentence design device provided by an exemplary embodiment of the present application. As shown in Figure 2 The patent search sentence design device 20 includes an operator symbol identification module 21 configured to identify logical operator symbols in a search formula; a search term group division module 22 configured to divide the search formula into at least one search term group based on the logical operator symbols; wherein the search term group includes at least one search term; a term group category identification module 23 configured to identify a category of the search term group; an extended search generation module 24 configured to generate an extended search term of the search term group based on the category of the search term group; and a search sentence generation module 25 configured to generate a search sentence of the search formula based on the category of the search term group, the search term group, and the extended search term.

[0047] The patent search sentence design device provided by the present application identifies logical operator symbols in a search formula through the operator symbol identification module 21; divides the search formula into at least one search term group based on the logical operator symbols through the search term group division module 22; wherein the search term group includes at least one search term; identifies a category of the search term group through the term group category identification module 23; generates an extended search term of the search term group based on the category of the search term group through the extended search generation module 24; and generates a search sentence of the search formula based on the category of the search term group, the search term group, and the extended search term through the search sentence generation module 25; that is, the search formula is divided into search term groups according to the logical operator symbols, the extended search term is generated by identifying the category of the search term group, and a more accurate search sentence is generated based on the category of the search term group, the search term group, and the extended search term, thereby providing a more expected patent file for search personnel, reducing search difficulty, and improving search efficiency and effectiveness.

[0048] In an embodiment, the search term group division module 22 can be further configured to convert the search formula into a syntax analysis tree based on the logical operator symbols; wherein each branch of the syntax analysis tree corresponds to a search term group.

[0049] In an embodiment, the term group category identification module 23 can be further configured to determine the category of the search term group based on a category identifier if the search term group includes the category identifier; and analyze the category of the search term group based on the semantics of the search terms if the search term group does not include the category identifier.

[0050] In an embodiment, the design device 20 of the patent search sentence can be further configured to: acquire a previous search sentence within a preset time of the search sentence; compare the previous search sentence and the search sentence to obtain a difference search term group between the previous search sentence and the search sentence; wherein the difference search term group represents a search term group existing in the search sentence and not existing in the previous search sentence; and the specific implementation of the step 140 can be: based on the category of the difference search term group, generating an extended search term of the difference search term group.

[0051] In an embodiment, the extended search generation module 24 can be further configured to: if the category of the search term group is a keyword, generating a synonym of all search terms in the search term group to obtain an extended search term of the search term group.

[0052] In an embodiment, the extended search generation module 24 can be further configured to: if the category of the search term group is an applicant or a patentee, acquiring all expression terms of the search terms in the search term group to obtain an extended search term of the search term group.

[0053] In an embodiment, the search sentence generation module 25 can be further configured to: add the extended search term to the corresponding search term group to obtain a new search term group; and based on the new search term group and the category of the search term group, obtain a search sentence.

[0054] Next, the electronic device according to the embodiments of the present application will be described with reference to Figure 3 The electronic device can be either or both of the first device and the second device, or a single device independent of them, which can communicate with the first device and the second device to receive the collected input signals therefrom.

[0055] Figure 3 FIG. 1 illustrates a block diagram of an electronic device according to an embodiment of the present application.

[0056] As Figure 3 shown, the electronic device 10 includes one or more processors 11 and a memory 12.

[0057] The processor 11 can be a central processing unit (CPU) or other form of processing unit having data processing and / or instruction execution capabilities, and can control other components in the electronic device 10 to perform desired functions.

[0058] The memory 12 can include one or more computer program products that can include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory, for example, can include random access memory (RAM), cache memory, and / or the like. The non-volatile memory, for example, can include read only memory (ROM), hard disk drives, solid state drives, and / or the like. The computer-readable storage media can store one or more computer program instructions implementing the methods of the embodiments of the present application described above and / or other desired function. Various contents such as input signals, signal components, noise components, and the like can also be stored in the computer-readable storage media.

[0059] In one example, the electronic device 10 can further include an input device 13 and an output device 14, which are interconnected through a bus system and / or other forms of connection mechanisms (not shown).

[0060] When the electronic device is a stand-alone device, the input device 13 can be a communication network connector for receiving acquired input signals from the first device and the second device.

[0061] In addition, the input device 13 can further include, for example, a keyboard, a mouse, and the like.

[0062] The output device 14 can output various information including determined distance information, direction information, and the like to the outside. The output device 14 can include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto, and the like.

[0063] Of course, in order to simplify, Figure 3 Only some of the components in the electronic device 10 related to the present application are shown in FIG. 1, and components such as buses, input / output interfaces, and the like are omitted. In addition, the electronic device 10 can include any other appropriate components according to the specific application.

[0064] In addition to the above-described methods and devices, embodiments of the present application can be a computer program product including computer program instructions that, when executed by a processor, cause the processor to perform the steps of the methods according to the embodiments of the present application described in the above "Exemplary Methods" section of the specification.

[0065] The computer program product can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computing device, partly on the user's computing device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device or entirely on the remote computing device or server. The embodiments of the present application are not limited by the

[0066] In addition, an embodiment of the present application can also be a computer readable storage medium, which stores computer program instructions, and when the computer program instructions are run on a processor, the processor executes the steps of the methods according to various embodiments of the present application described in the above "Exemplary Methods" section of the specification.

[0067] The computer readable storage medium can be any combination of one or more computer readable media. The computer readable medium can be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or any suitable combination of the above. More specific examples (a non-exhaustive list) of the computer readable storage medium include an electrical connection having one or more wires, a portable disc, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0068] The above describes the basic principles of the present application in combination with specific embodiments, but it should be noted that the advantages, benefits, effects and the like mentioned in the present application are only examples and are not limiting, and these advantages, benefits, effects and the like cannot be considered as the must-have of each embodiment of the present application. In addition, the above specific details are only for the purpose of example and understanding, and the above details do not limit the present application to the must-have of the above specific details.

[0069] The block diagrams of the devices, apparatuses, equipment, systems referred to in this application are only illustrative examples and are not intended to require or imply that the connection, arrangement, configuration must be as shown in the block diagrams. As those skilled in the art will recognize, these devices, apparatuses, equipment, systems can be connected, arranged, configured in any manner. Words such as "include," "contain," "have," and the like are open-ended words that are intended to mean "including but not limited to," and are to be used interchangeably. The words "or" and "and" as used herein are intended to mean "and / or," and are to be used interchangeably. The word "such as" as used herein is intended to mean "such as but not limited to," and is to be used interchangeably.

[0070] It is also important to note that the devices, apparatuses, and methods of the present application can be embodied in a variety of other forms, including devices, apparatuses, and methods that are not specifically disclosed herein. Thus, the above description is not intended to limit the aspects of the present application, but to provide an illustrative example of the aspects of the present application. Numerous modifications, variations, changes, additions, and / or substitutions can be made to the aspects of the present application without departing from the scope of the present application.

[0071] The above description of disclosed aspects is given for illustrative example and does not limit the aspects of the present application in any way. Various modifications to the aspects of the present application will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other aspects without departing from the scope of the present application. Thus, the present application is not intended to be limited to the aspects shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0072] The above description has been given for illustrative example and is not intended to limit the embodiments of the present application to the forms disclosed herein. Although a number of example aspects and embodiments have been discussed above, those of skill in the art will recognize certain variations, modifications, changes, additions, and subcombinations thereof.

Claims

1. A method for designing patent search statements, characterized in that, The method comprises the following steps: identifying a logical operator in a search formula; based on the logical operator, splitting the search formula into at least one search term group; wherein the search term group comprises at least one search term; identifying the category of the search term group; based on the category of the search term group, generating an extended search term of the search term group; based on the category of the search term group, the search term group and the extended search term, generating a search sentence of the search formula; The design method of the patent search sentence further comprises: obtaining the previous search formula within the preset time of the search formula; comparing the previous search formula and the search formula to obtain the difference search term group between the previous search formula and the search formula; wherein the difference search term group represents the search term group existing in the search formula and not existing in the previous search formula; The method based on the category of the search term group, generating an extended search term of the search term group comprises: based on the category of the difference search term group, generating an extended search term of the difference search term group.

2. The method of claim 1, wherein the patent search query is designed by, The method based on the logical operator, splitting the search formula into at least one search term group comprises: based on the logical operator, converting the search formula into a syntax analysis tree; wherein each branch of the syntax analysis tree corresponds to a search term group.

3. The method of claim 1, wherein the patent search query is designed by: The method of identifying the category of the search term group comprises: if the search term group contains a category identifier, determining the category of the search term group based on the category identifier; if the search term group does not contain a category identifier, interpreting all search terms in the search term group to obtain search term semantics; based on the search term semantics, analyzing the category of the search term group.

4. The method of claim 1, wherein the patent search query is designed by, The method based on the category of the search term group, generating an extended search term of the search term group comprises: if the category of the search term group is a keyword, generating the synonyms of all search terms in the search term group to obtain the extended search term of the search term group.

5. The method of claim 1, wherein the patent search query is designed by: The method based on the category of the search term group, generating an extended search term of the search term group comprises: if the category of the search term group is an applicant or a patentee, obtaining all expression terms of the search term in the search term group to obtain the extended search term of the search term group.

6. The method of claim 1, wherein the patent search query is designed by: The method based on the category of the search term group, the search term group and the extended search term, generating a search sentence of the search formula comprises: adding the extended search term to the corresponding search term group to obtain a new search term group; based on the new search term group and the category of the search term group, obtaining the search sentence.

7. A device for designing patent search statements, characterized in that, The method comprises the following steps: an operator identification module for identifying a logical operator in a search formula; a search term group division module for splitting the search formula into at least one search term group based on the logical operator; wherein the search term group comprises at least one search term; a term group category identification module for identifying the category of the search term group; an extended search generation module for generating an extended search term of the search term group based on the category of the search term group; a search sentence generation module for generating a search sentence of the search formula based on the category of the search term group, the search term group and the extended search term; The design device of the patent search sentence is further configured to: acquire a previous search sentence within a preset time of the search formula; compare the previous search sentence and the search formula to obtain a difference search term group between the previous search sentence and the search formula; wherein the difference search term group represents a search term group existing in the search formula and not existing in the previous search formula; the expansion search generation module is further configured to: generate an expansion search term of the difference search term group based on the category of the difference search term group.

8. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and the computer program is used to execute the method in any one of claims 1-6.

9. An electronic device, comprising: comprise: a processor; a memory for storing instructions executable by the processor; the processor is used to execute the method in any one of claims 1-6.

Images