The task of automation of the synthesis of innovative solutions in the field of technical systems and technologies is one of the most priority problems of science. The authors propose to automate the most important, initial stages of the design of new technical systems and technologies based on updated knowledge bases obtained from the world patent database, including the RosPatent patent database. According to the method of morphological analysis and synthesis, it is assumed that the main structural features (functions of technical objects) are extracted from some technical solution (patent). All these features are reduced to a morphological matrix, combined, which gives a lot of new solutions. The paper describes the developing a software for extracting the descriptions of the technical functions from Russian patents. The grammar of the presentation of technical functions descriptions according to the model “Action-Object-Condition” in the Russian-language patents was formed; algorithms for the initial processing of the patent database, the extraction of technical functions through the analysis of dependency trees, the formation of the morphological matrix was developed. The software consisting of a module of patent database processing; a module of text segmentation of the patent formula; a module of semantic text analysis; a module of extracting descriptions of technical functions; a module of presenting the results of patent database processing, was tested to solve practical problems.
The task of automation of the synthesis of innovative solutions [
The new design decision with new properties that did not meet earlier is the result
of the synthesis of an invention. Structural synthesis [
The algorithm of morphological analysis and synthesis contains the following sequential procedures: identification of the main features of the object; preparation of the form for filling the morphological matrix; the matrix fill the alternatives; choice of the best solutions; formation of the technical solution.
The purpose of the work is to carry out the extraction of technical functions from the RosPatent patents and present them in the form of a morphological matrix, which is the basis of the procedure for the synthesis of new design solutions. 2 2.1
According to the results of the research, which consisted of the analysis of the subject area of patenting of inventions, familiarity with the structure of the patent, linguistic analysis of the patent formula, review of existing automated methods for the synthesis of new technical solutions, study of the stages of automatic text processing, the algorithm of the analysis of the patent array was proposed.
The input of the algorithm is a folder with patents granted by the Russian patent department. Technical functions are extracted from the texts of patent formulas, in which verbs determine the main action and which will unambiguously describe the essence of the invention. Then classes of actions of verbs are defined, thus forming generalized technical functions, and the functions themselves are written in the implementation variants (alternatives) of the selected generalized functions.
The output of the algorithm is a morphological matrix, presented visually on a program screen form and visually displaying the versions (alternatives) of the generalized technical function. The obtained morphological matrix can be used for the search of the fundamental idea for the synthesis of the new technical solution.
Extraction of descriptions of technical functions from patents The following information is taken from an XML file of the RosPatent patent: <b110> … </b110> is number of the patent; <b220> <date> … </date> </b220> is date of issue of the patent; <ru-b542> … </ru-b542> is the name of the patent; <ru-b560> … </ru-b560> are references to other patents which are inspiration sources; <b721> <ru-name-text> … </ru-name-text> </b721> list of inventors; <claims> … </claims> is an invention formula.
Directly the text of a patent formula is put into the tags <claim-text></claim-text>. Formulas of patents are under construction on one template other than the usual sentence structure. Most often the formula represents one complex sentence in which several subordinate clauses, each of which supplements properties of an object about which it is told in the main clause. Parsing such a long sentence would be very time consuming and resource consuming. To reduce the number of mistakes in the results of the semantic analysis, this offer is divided into several parts (is segmented), and then each part of the original sentence is parsed separately.
The segmentation algorithm [
For the execution of semantic analysis of a segment of a patent formula the
software of Link Grammar Parser [
To parse the patent formula segments, the following Link Grammar Parser link
types are required [
F=<D, G, H>, where D – a set of the actions made and resulting in the desired result; G – a set of objects to which these actions are directed; H – a set of special conditions and restrictions of the performed operations.
The analysis of the set of sentences showed that the segments of patent formulas have a similar syntactic structure. This observation made it possible to construct a context-sensitive grammar (2) to extract the model components (1) from sentences of the patent formula by analyzing the links: (1) (2)
Gram = (T, N, <W>, R),
where T = {action, object, condition} is a set of terminals; N = {<MV>, <SI>,
<E>, <J>, <I>, <A>, <M>} – set of non-terminals; <W> – initial non-terminal [
R is the set of production rules: <W> → action <MV> <E> | action <MV> | action <E> | action | ε Action <MV> → action <MV> | action <MV> <MV> action → action | <I> action | action <I> <I> action → action action | <I> action action | action <I> action action <I> → action action | action action <I> | action <I> action <MV> → object <MV> | <A> object | <A> object <M> | object <M> | object <A> object → object object | <A> object object | object <A> object object <M> → object object object| object <A> object | object object <M> | object <A> object <M> condition <J> → condition | condition <E> | condition <J> <A> condition → condition condition <M> | condition <A> condition <M> condition <M> → condition condition | condition condition <M> | condition condition <J> | condition <A> condition <MV> → <MV> | <SI> <E> → <E> | <EI> <A> → <A> | <AXP> | <PI>
The output of a sentence using this grammar means that a word in a sentence at the position of a terminal refers, respectively, to an action, object, or condition, depending on the type of terminal.
The links found by the parser are interpreted to represent a technical function according to the model (1). By analyzing certain types of relationships, you can discover words that are objects of action, the action itself, and the condition of the action (i.e., to define syntactic category).
The structuring of the set of possible values of the component D “Action” was
made on the basis of a set of terms, the most common in the description of the
functions of technical objects (for example, in the International patent classification),
as well as selected through the analysis of unstructured information under the heading
“Practical application” [
Action classifier (D) [
Using this classifier allows you to find a common class for cured actions from patent formulas. The general class will be a feature in the morphological matrix, and the actions themselves, with their objects and conditions, will be the implementation variants (alternatives) of this feature. 2.4
The text of the patent: “A signal converter that provides the formation of a code word of digital data according to the method of constructing the code word”.
Fig.1.ExampleofthetreeofanalysisofLinkGrammarParser
From the tree of dependencies shown in Figure 1 according to grammar (2) we receive the following: <W > → → provides <MV> <E> → provides the formation <MV> <E> → provides the formation < a > words <M> <E> → provides the formation of a code word<M> <E> → provides the formation of a code word <a > data <E> → provides the formation of a code word of digital data <E> → provides the formation of a code word of digital data according to <J> → provides the formation of a code word of digital data according to the method <M> → provides the formation of a code word of digital data according to the method of construction <M> → providing the formation of a code word of digital data according to the method of constructing <a> words → provides the formation of a code word of digital data according to the method of constructing the code word.
The components of the technical function according to the developed model (1) recognized in the text of the patent formula will be as follows: Action (D) = “provides the formation”; Object (G) = “of a code word of digital data”; Condition (H) = “according to the method of constructing the code word.
The obtained components of the technical function representation according to the DGH (1) model, recognized in the sentence segments of patent formulas, technical functions are entered in the matrix together with the selected generalized technical function (TF) according to the action classifier (D) (Table 1). 1 provides the of a code word of according to the method of
formation digital data constructing the code word 2 performs sandwiched on the postoperative data Treatment 3 the result of a modulating signal from the IFFT calculator Creation generating 4 forms pressure in an empty cylindrical form Creation
Based on the generalized technical functions, a morphological matrix is
constructed in which technical functions in the form of “object-condition-action”
tuples of DGH (1) are used as alternatives to the execution of generalized technical
functions. When building a morphological matrix (Table 2), all found actions (D) are
viewed and those actions that have the same generalized technical function are
recorded in the same column of the morphological matrix with their object and
conditions.
The extracted technical functions and the morphological table are stored in the RDD
(Resilient Distributed Dataset) scheme, which is used for the most rapid processing of
patent data using MapReduce technology [
The theoretical value of this work is: in the developed grammar of the description of technical functions in the texts of Russian patents; in the algorithms of the primary processing of the patent array, the extraction of technical functions through the analysis of dependency trees, the formation of the morphological matrix.
The functionality of the software has been tested on a set of test tasks.
The reported study was funded by RFBR (research project 18-07-01086), RFBR and Administration of the Volgograd region (projects 19-47-340007, 19-41-340016).