Patent Application
20180285995
The present invention relates to an information processing device, an information processing method, and a program-recording medium.
A document for a patent application includes a description, a scope of claim for patent, drawings, or an abstract attached to an application request. The description is a document in which a patent applicant describes a patent sufficiently to an extent that an expert of a technical field thereof can carry out the patent. The scope of claim for patent is a description of a matter for defining an invention intended to be patented or a document that describes the matter. In the scope of claim for patent, one or a plurality of claims are described.
A plurality of claims included in the scope of claim for patent have a relationship, specifically a subordinate relationship with one another. The subordinate relationship between claims is displayed generally using a claim tree.
PTL 1 discloses an automation tool for supporting a user by processing and analyzing patent related information and non-patent related information. PTL 1 discloses an example in which a claim structure is displayed by a hyperbolic tree including a root node and a plurality of additional nodes directly or indirectly connected to the root node.
PTL 1: Japanese Laid-open Patent Publication No. 2011-154696
As described above, when a method for displaying a subordinate relationship between claims using a hierarchical structure, in which, for example, the depth of hierarchy from an independent claim is expressed in arrangement in a transverse direction or a vertical direction, is employed, as the number of claims included in the scope of claim for patent increases, an area for displaying a claim tree increases. Therefore, there is an issue that it is difficult to confirm a claim structure.
In view of the above-described issue, the present invention has been made, and a main object of the present invention is to provide an information processing device and the like capable of facilitating confirmation of a claim structure even when the number of claims included in the scope of claim for patent is large.
An information processing device according to one aspect of the present invention includes:
subordinate relationship extraction means for extracting a claim number and a subordinate relationship between claims from claim data including a plurality of claims; and
relationship diagram generation means for generating, based on the subordinate relationship between claims, a relationship diagram in which the claim number is disposed on or in a periphery of circularly-arranged points or a circling line.
An information processing method according to one aspect of the present invention includes:
extracting a claim number and a subordinate relationship between claims from claim data including a plurality of claims; and
generating, based on the subordinate relationship between claims, a relationship diagram in which the claim number is disposed on or in a periphery of circularly-arranged points or a circling line.
A storage medium according to one aspect of the present invention stores an information processing program that causes a computer to execute:
a process of extracting a claim number and a subordinate relationship between claims from claim data including a plurality of claims; and
a process of generating, based on the subordinate relationship between claims, a relationship diagram in which the claim number is disposed on or in a periphery of circularly-arranged points or a circling line.
The present invention has an advantageous effect that, even when the number of claims included in the scope of claim for patent is large, it is possible to facilitate confirmation of a claim structure thereof, is obtained.
Hereinafter, example embodiments of the present invention will be described in detail with reference to the accompanying drawings.
As illustrated in
The claim structure extraction unit 140 includes a subordinate relationship extraction unit 141, a symmetric matrix generation unit 142, a subordinate relationship storage unit 143, and a symmetric matrix storage unit 144.
The claim tree generation unit 150 includes a disposition control unit 151, a disposition data generation unit 152, a disposition data adjustment unit 153, a disposition data output unit 154, and a disposition data storage unit 155.
An outline of each component will be described.
The input acceptance unit 110 accepts a selection instruction for claim data to be analyzed that are data indicating the scope of claim for patent including one or a plurality of claims, a display instruction for a claim tree, and the like. The input acceptance unit 110 is realized by an input means such as a mouse or a keyboard, a driver software for the input means, and the like.
The control unit 120 executes processing in accordance with an instruction accepted by the input acceptance unit 110. The control unit 120, for example, reads claim data to be analyzed from the claim data storage unit 130, and notifies the claim structure extraction unit 140 of the read data and also instructs the claim structure extraction unit 140 to extract a claim structure.
The claim data storage unit 130 stores one or a plurality of pieces of claim data in advance. One piece of claim data includes all claims included in the scope of claim for patent attached to one application but is not limited thereto. One piece of claim data may include a part of claims included in the scope of claim for patent attached to one application. Claim data may be, for example, Excel (a registered trademark) data in which all claims described in the scope of claim for patent attached to one application are described in one cell. Further, claim data may be Excel data in which claims included in scopes of claim for patent attached to a plurality of application are described in respective cells (each cell corresponding to each scope of claim for patent).
A user may select one piece of claim data as an analysis target via the input acceptance unit 110 or may select a plurality of pieces of claim data. When a plurality of pieces of claim data have been selected, for each piece of claim data, data for displaying a claim tree are generated.
The claim data storage unit 130 may be disposed inside the information processing device 100 or may be disposed in the outside and communicably connected to the information processing device 100.
The claim structure extraction unit 140 extracts a claim structure from one or a plurality of pieces of claim data received from the control unit 120. The subordinate relationship extraction unit 141 of the claim structure extraction unit 140 extracts a subordinate relationship between claims included in the received claim data. The subordinate relationship extraction unit 141 extracts, when receiving a plurality of pieces of claim data, a subordinate relationship between claims for each piece of claim data. The subordinate relationship storage unit 143 stores information (subordinate relationship information) indicating the subordinate relationship extracted by the subordinate relationship extraction unit 141.
The symmetric matrix generation unit 142 generates a symmetric matrix indicating presence or absence of a subordinate relationship between claims, based on the subordinate relationship extracted by the subordinate relationship extraction unit 141. The symmetric matrix storage unit 144 stores the symmetric matrix generated by the symmetric matrix generation unit 142.
The claim tree generation unit 150 generates data for displaying a claim tree, based on the subordinate relationship between claims and the symmetric matrix extracted by the claim structure extraction unit 140, and outputs the data to the display unit 160. The display unit 160 may be, for example, a display means such as a screen included in the information processing device 100 or an external display means communicably connected to the information processing device 100.
The disposition control unit 151 of the claim tree generation unit 150 reads, from the subordinate relationship storage unit 143 and the symmetric matrix storage unit 144, a subordinate relationship and a symmetric matrix, respectively and executes control for claim tree display.
The disposition data generation unit 152 calculates, based on the subordinate relationship and the symmetric matrix, a disposition location (coordinate value) and the like on a display screen of each claim in a claim tree to be displayed and generates disposition data for disposition based on the coordinate value. The disposition data storage unit 155 stores the disposition data generated by the disposition data generation unit 152.
The disposition data adjustment unit 153 adjusts, as described later, the disposition data generated by the disposition data generation unit 152 and stores disposition data after the adjustment on the disposition data storage unit 155. The disposition data output unit 154 outputs, to the display unit 160, data for displaying a claim tree formed based on the disposition data adjusted by the disposition data adjustment unit 153. The disposition data output unit 154 may output disposition data to an application or the like for executing screen output.
The input acceptance unit 110 notifies, upon receipt of a selection instruction for claim data to be analyzed by an input operation of a user, the control unit 120 of the instruction (S10). The control unit 120 reads the selected claim data from the claim data storage unit 130 and notifies the claim structure extraction unit 140 of the read claim data (S11).
The claim structure extraction unit 140 receives the claim data in the subordinate relationship extraction unit 141. The subordinate relationship extraction unit 141 extracts claim numbers and a subordinate relationship between claims from the received claim data (S12). The subordinate relationship extraction unit 141 extracts, for example, claims 1, 2, and 3 as claim numbers from claim data No. 1 illustrated in
The subordinate relationship extraction unit 141 extracts, when there are a plurality of pieces of claim data received from the control unit 120, a subordinate relationship for each piece of claim data and stores subordinate relationship information (referred to also as an inter-claim subordinate relationship) indicating each subordinate relationship on the subordinate relationship storage unit 143.
Next, the subordinate relationship extraction unit 141 transfers claim numbers and an inter-claim subordinate relationship extracted as described above to the symmetric matrix generation unit 142. The symmetric matrix generation unit 142 generates a symmetric matrix from the acquired claim numbers and inter-claim subordinate relationship (S13).
As illustrated in
The symmetric matrix generation unit 142 stores a symmetric matrix generated as described above on the symmetric matrix storage unit 144. The symmetric matrix generation unit 142 generates, when receiving information indicating a plurality of subordinate relationships from the subordinate relationship extraction unit 141, a symmetric matrix for each subordinate relationship and stores the generated symmetric matrix on the symmetric matrix storage unit 144. The symmetric matrix generation unit 142 notifies, when storing a symmetric matrix on the symmetric matrix storage unit 144, the control unit 120 of the fact.
After storing a symmetric matrix on the symmetric matrix storage unit 144, the control unit 120 instructs the claim tree generation unit 150 to generate disposition data for drawing a claim tree.
The claim tree generation unit 150 generates disposition data of a claim tree in accordance with the instruction (S14).
Further, in the present example embodiment, the claim tree generation unit 150 disposes a claim graphic including a node corresponding to an independent claim number along a circle (a basic circle to be described later). Further, the claim tree generation unit 150 connects, using a line, node circles forming claim graphics corresponding to claim numbers having a subordinate relationship and thereby generates a claim tree indicating the subordinate relationship between claims. The claim tree generation unit 150 generates a claim tree, specifically, by the following steps.
First, the disposition control unit 151 of the claim tree generation unit 150 reads, from the symmetric matrix storage unit 144, a symmetric matrix of claim data for generating disposition data in accordance with a generation instruction for disposition data for drawing a claim tree (S20).
The disposition control unit 151 notifies the disposition data generation unit 152 of the read symmetric matrix and instructs the disposition data generation unit 152 to generate disposition data. The disposition data generation unit 152 first extracts the number of nodes that is the number of node circles to be disposed, based on the received symmetric matrix (S21). The number of nodes is equal to the number of claims. Description will be made with reference to
In the example illustrated in
On the other hand,
Next, the disposition data generation unit 152 determines a radius of a node circle and a radius of a circle where the node circle is disposed (hereinafter, referred to as a “basic circle”) (S22). In other words, when the number of nodes extracted as describe above is designated as “N”, a radius of a node circle is designated as “r”, and a radius of a basic circle is designated as “R”, the disposition data generation unit 152 determines a radius of each of a basic circle and a node circle in such a way that a size of the basic circle and a size of the node circle satisfy, for example, a relation of following equation (1).
((2r×N)/(2πR))<1 Equation (1)
Preferably, the disposition data generation unit 152 may determine a radius of each of a basic circle and a node circle in such a way that a size of the basic circle and a size of the node circle satisfy a relation of following equation (2) or equation (3).
((2r×N)/(2πR))<0.8 Equation (2)
((2r×N)/(2πR))<0.5 Equation (3)
When a basic circle and a node circle are displayed with sizes calculated in such a way as to satisfy, for example, the relation indicated in equation (3), visibility can be improved.
Further, the disposition data generation unit 152 may set an upper limit for a radius r of a node circle when the number of nodes is small (e.g. the number of nodes is equal to or less than 10) and may set a value satisfying, for example, equation (4) as an upper limit.
r=2R/10 Equation (4)
Next, the disposition data generation unit 152 calculates an angle θ between node circles (S23). The angle between node circles refers to an angle θ formed by lines connecting a central point of a basic circle and central points of node circles, respectively. An angle θ between node circles can be calculated by equation (5).
0=2πr/N Equation (5)
Next, the disposition data generation unit 152 calculates, based on a radius of a node circle, a radius of a basic circle, and an angle between node circles calculated as described above, a coordinate value for disposing node circles and a link (S24). A line (connecting line) for connecting node circles is referred to also as a “link”. Node circles connected by a link are node circles indicating claims in which in a symmetric matrix read from the symmetric matrix storage unit 144, “1” is set, i.e. claims having a subordinate relationship.
The disposition data generation unit 152 further calculates coordinate values of a start point and an end point of each link in order to dispose, as illustrated in
The disposition data generation unit 152 stores disposition data generated as described above on the disposition data storage unit 155.
After the disposition data generation unit 152 generating disposition data as described above, the disposition control unit 151 instructs the disposition data adjustment unit 153 to adjust the disposition data. The disposition data adjustment unit 153 adjusts a coordinate value included in the disposition data in accordance with the instruction (S25). In other words, the disposition data adjustment unit 153 modifies a coordinate value in order to shift a node circle location in such a way as to eliminate overlapping at a location where node circles are overlapped or at a location where a node circle and a link are overlapped. In
In
As illustrated in
Further, the disposition data adjustment unit 153 modifies also a coordinate value of an end point 342 of the link 341 between the node circle 2 (332) and the node circle 3 (331) in the same direction as the movement of the node circle 3 (331), as illustrated as an end point 342′. Thereby, the link 341 is also moved, as illustrated as a link 341′. The movement of the end point 342 is not limited to the same direction as the movement of the node circle 3 (331). Further, at that time, the disposition data adjustment unit 153 changes also a coordinate value of a start point of a link on a circumference of the node circle 3 (331′) in such a way that connection between the node circle 3 (331′) and a node circle 6 (335) is not cut.
When the node circle 3 (331′) is moved as described above, a link 351 between the node circle 3 (331′) and the node circle 6 (335) is overlapped with the node circle 4 (333) and a node circle 5 (334). Therefore, the disposition data adjustment unit 153 moves the node circle 6 (335) to the outside (as illustrated as a node circle 6 (335′)) in order to eliminate overlapping between the link 351 and the node circle 4 (333) and the node circle 5 (334). At that time, the disposition data adjustment unit 153 moves the node circle 6 (335) while an angle between nodes, i.e. an angle θ between the node circle 5 (334) and the node circle 6 (335) is maintained. However, the present example embodiment is not limited thereto.
The disposition data adjustment unit 153 may modify a start point 343 of the link 351 with the node circle 6 (335) on a circumference of the node circle 3 (331′) after the movement, as illustrated as a start point 352. Further, the disposition data adjustment unit 153 may move an end point 336 of the link 351 together with the movement of the node circle 6, as illustrated as an end point 362. In other words, a start point or an end point of a link on a circumference of a node in association with movement of a node circle thereof can be freely moved in a range where a moved link is not overlapped with another node circle and a node number order is not changed.
On the other hand, the disposition data adjustment unit 153 may modify disposition data in such a way as to move the node circle 6 (335) to the inside, i.e. a central point of the node circle 6 (335) in a direction where a distance from the central point 350 of the basic circle 330 decreases, in such a way that the link 351 is not overlapped with the node circles 4 and 5. The disposition data adjustment unit 153 moves also the link 351, as illustrated as a link 351″, in such a way as to connect a node circle 6 (335″) after movement and the node circle 3 (331′). At that time, a start point of the link 351″ may be the same as the start point 343 before movement or may be changed. During movement of a node circle, a node circle is preferably moved in a direction where a length of a link decreases, but is not limited thereto. For modification of disposition data as described above, calculation may be repeatedly made in such a way as to move a node circle or a link in which overlapping between node circles or overlapping between a node circle and a link exists until the overlapping is eliminated, for example, in order of a claim number.
As illustrated as the end point 342′, the start point 352, and the like of
In this case, the link 351′ after movement may be disposed in such a way as to be in contact with the node circle 4 (i.e. even when the link 351′ and the node circle 4 are disposed in such a way as to be in contact with each other, it is clear that there is no subordinate relationship when a connection point thereof is not displayed by a black circle or the like).
As described above, the disposition data adjustment unit 153 modifies disposition data generated by the disposition data generation unit 152 and stores the modified disposition data on the disposition data storage unit 155.
Through the above steps, disposition data are generated. When disposition data are generated, the disposition control unit 151 instructs the disposition data output unit 154 to display a claim tree by using an adjusted coordinate value stored on the disposition data storage unit 155. The disposition data output unit 154 reads corresponding disposition data from the disposition data storage unit 155 in accordance with the instruction, outputs the read data to the display unit 160, and thereby displays a claim tree (S15 of
Further, the information processing device 100 may generate, when a plurality of pieces of claim data are selected as analysis targets, pieces of disposition data for all pieces of claim data, respectively, store the generated disposition data on the disposition data storage unit 155, thereafter, read, in response to designation of any piece of claim data from a user, a corresponding piece of disposition data from the disposition data storage unit 155, and thereby display a claim tree.
As described above, according to the present first example embodiment, the information processing device 100 extracts a subordinate relationship for claims from claim data including one or a plurality of claims, disposes a node circle assigned with a number of each claim along a circle in ascending order, and generates, as a relationship diagram, a claim tree in which a link is formed between node circles having a subordinate relationship. The information processing device 100 displays the generated relationship diagram on the display unit 160.
When this configuration is employed, according to the present first example embodiment, even when the number of claims included in one piece of claim data increases, by adjusting a radius of a circle where a node circle is disposed and a radius of a node circle assigned with a claim number and the like, a claim tree can be displayed without increasing a display area. Further, even when the number of claims included in one piece of claim data is relatively large or small, a claim tree can be displayed with substantially the same size. Therefore, a user can easily view the entire structure of claims, and therefore even when the number of claims is large, the present example embodiment has an advantageous effect that a claim structure can be easily confirmed. Further, as described above, a claim tree can be displayed without increasing a display area, and therefore display of only a part of a claim structure due to a display area insufficiency of a screen and the like is avoidable, whereby the present example embodiment has an advantageous effect that the entire structure of a claim tree can be correctly displayed in a predetermined display area.
In the present example embodiment and the following example embodiments, a claim tree may be displayed as follows. In other words, in the above description, it has been described that a node circle is disposed along a circle, but without limitation thereto, a node circle may be disposed along an ellipse or may be disposed along another graphic. Further, a graphic along which a node circle is disposed may be a graphic that is closed or may be a graphic that is not closed. A node circle may be disposed, for example, on or in a periphery of circularly-arranged points or a circling line. A node circle may be evenly disposed in a graphic along which the node circle is located or may not be evenly disposed. When the number of claims included in claim data is 1, a node circle assigned with a claim number thereof may be disposed in any location, i.e. on or in a periphery of, for example, a circle, an ellipse, or a polygon.
Further, in the above description, a claim graphic has been represented by a circle that surrounds an area where a claim number in a claim tree is disposed, but without limitation to a circle, may be an ellipse, a polygon, or the like, and at least the area needs to be surrounded by points or a line. Alternatively, a claim graphic is represented by a graphic such as a circle and the like but is not limited thereto, and at least an area where a claim number is disposed in a claim tree needs to be displayed. Further, a type of a line that connects claim graphics is not specifically limited and may be a solid line, a dashed line, a wavy line, or the like.
Next, a second example embodiment based on the above-described first example embodiment will be described. In the following description, a component similar to the component of the first example embodiment is assigned with the same reference sign, and thereby overlapping description will be omitted.
The claim structure extraction unit 410 includes a subordinate relationship storage unit 412 instead of the subordinate relationship storage unit 143 of the claim structure extraction unit 140 included in the information processing device 100 and further incudes a hierarchical information extraction unit 411.
The claim tree generation unit 420 includes a disposition control unit 421, a disposition data generation unit 422, and a disposition data storage unit 423, instead of the disposition control unit 151, the disposition data generation unit 152, and the disposition data storage unit 155 of the claim tree generation unit 150 included in the information processing device 100, respectively.
The information processing device 400 according to the present second example embodiment includes a function of displaying the depth of hierarchy in a subordinate relationship between claims in an identifiable manner, in addition to the function of the information processing device 100 described in the first example embodiment.
It is assumed that a symmetric matrix 202 described by referring to
It is assumed that an input acceptance unit 110 has accepted a selection instruction for claim data to be analyzed and has accepted an instruction (hereafter, referred to as a “hierarchical display instruction”) for displaying the depth of hierarchy in an identifiable manner. The input acceptance unit 110 notifies a control unit 120 of the accepted instruction. Similarly to the first example embodiment, the control unit 120 reads claim data from a claim data storage unit 130 and notifies the claim structure extraction unit 410 of the read claim data. Similarly to the first example embodiment, a subordinate relationship extraction unit 141 extracts a subordinate relationship, a symmetric matrix generation unit 142 generates a symmetric matrix, and the units store these on the subordinate relationship storage unit 412 and the symmetric matrix storage unit 144, respectively.
Upon storing the symmetric matrix 202 on the symmetric matrix storage unit 144, the symmetric matrix generation unit 142 instructs the hierarchical information extraction unit 411 to extract the depth of hierarchy (hierarchical information). The hierarchical information extraction unit 411 extracts, in accordance with the instruction, the depth of hierarchy of each claim from the symmetric matrix 202 stored on the symmetric matrix storage unit 144. The depth of hierarchy refers to the number of hierarchy levels that needs to go up to reach an independent claim from a designated dependent claim by tracing each claim to be depended on (a claim cited by a dependent claim) assuming the hierarchy level of the independent claim is “1”.
Extraction of the depth of hierarchy of, for example, the claim 4 illustrated in
The hierarchical information extraction unit 411 extracts the depth of hierarchy in a similar manner for all claims and adds the results to subordinate relationship information stored in the subordinate relationship storage unit 412.
The control unit 120 instructs the disposition control unit 421 to output a claim tree when hierarchical information is stored by the hierarchical information extraction unit 411. Similarly to the first example embodiment, the disposition control unit 421 reads, in accordance with the instruction, subordinate relationship information and a symmetric matrix from the subordinate relationship storage unit 412 and the symmetric matrix storage unit 144, respectively, and instructs the disposition data generation unit 422 to generate disposition data, based on the read information.
The disposition data generation unit 422 generates display form data for performing display by a display form different for each depth of hierarchy of a claim, in addition to disposition data described in the first example embodiment.
In the present second example embodiment, a timing of extracting hierarchical information by the claim structure extraction unit 410 and generating display form data by the claim tree display unit 420 is not limited to a timing at which a hierarchical display instruction is accepted from a user. In other words, the claim structure extraction unit 410 may extract, in response to reception of claim data from the control unit 120, hierarchical information in the hierarchical information extraction unit 411 and store the extracted information on the subordinate relationship storage unit 412, regardless of presence or absence of a hierarchical display instruction. The claim tree generation unit 420 may generate display form data for display different for each depth of hierarchy and store the generated data on the disposition data storage unit 423, when hierarchical information is being stored on the subordinate relationship storage unit 412.
In this case, upon accepting a hierarchical display instruction from a user when, for example, a claim tree in which all node circles have the same display form is being displayed on the display unit 160, the control unit 120 may instruct the disposition control unit 421 to perform display for each depth of hierarchy in accordance with the instruction, and read display form data from the disposition data storage unit 423 and output the read data to the display unit 160 by using the display data output unit 154. In this manner, the display form data are generated and stored in response to reception of claim data, and thereby presence or absence of display for each hierarchy level can be switched according to presence or absence of a hierarchical display instruction from a user.
As described above, according to the present second example embodiment, the claim structure extraction unit 410 extracts the depth of hierarchy of each claim, and the claim tree generation unit 420 displays a node circle by a form different for each depth of hierarchy of a claim in a claim tree. Thereby, the present example embodiment has an advantageous effect that a user can easily confirm the depth of hierarchy, and therefore a visibility of a claim structure can be improved.
Next, a third example embodiment based on the above-described first example embodiment will be described. In the following description, a component similar to the component of the first example embodiment is assigned with the same reference sign, and thereby overlapping description will be omitted.
The claim structure extraction unit 440 includes a subordinate relationship storage unit 442 instead of the subordinate relationship storage unit 143 of the claim structure extraction unit 140 included in the information processing device 100 and further incudes a category information extraction unit 441.
The claim tree generation unit 450 includes a disposition control unit 451, a disposition data generation unit 452, and a disposition data storage unit 453, instead of the disposition control unit 151, the disposition data generation unit 152, and the disposition data storage unit 155 of the claim tree generation unit 150 included in the information processing device 100, respectively.
The information processing device 430 according to the present third example embodiment includes a function of performing display in a form different for each category of a claim, in addition to the function of the information processing device 100 described in the first example embodiment.
It is assumed that an input acceptance unit 110 has accepted a selection instruction for claim data to be analyzed and has accepted a display instruction for each category. The input acceptance unit 110 notifies a control unit 120 of the accepted instruction. Similarly to the first example embodiment, the control unit 120 reads claim data from a claim data storage unit 130 and notifies the claim structure extraction unit 440 of the read claim data. Similarly to the first example embodiment, a subordinate relationship extraction unit 141 extracts a subordinate relationship, a symmetric matrix generation unit 142 generates a symmetric matrix, and the units store these on the subordinate relationship storage unit 442 and the symmetric matrix storage unit 144, respectively.
After storing a symmetric matrix 202 on the symmetric matrix storage unit 144, the symmetric matrix generation unit 142 instructs the category information extraction unit 441 to extract category information. The category information extraction unit 441 extracts, in accordance with the instruction, category information of each claim from the claim data received from the control unit 120.
The category information refers to a classification of a subject being claimed by each claim included in claim data and includes, for example, a device, a method, a system, a program, a recording medium, and the like. The category information extraction unit 441 may extract category information of each claim from claim data by an ordinary text analysis process.
The category information extraction unit 441 extracts, when, for example, a claim ends with wording of “device” or starts with “A device” or “The device”, “device” as category information of the claim. The category information extraction unit 441 further extracts, when, for example, a claim ends with wording of “method” or starts with “A method” or “The method”, “method” as category information of the claim. The category information extraction unit 441 adds the extracted category information to subordinate relationship information stored on the subordinate relationship storage unit 442. The category information extraction unit 441 stores the category information on the subordinate relationship storage unit 442 and then notifies the control unit 120 of this fact.
The control unit 120 instructs the disposition control unit 451 to output a claim tree when category information is stored by the category information extraction unit 441. Similarly to the first example embodiment, the disposition control unit 451 reads, in accordance with the instruction, subordinate relationship information and a symmetric matrix from the subordinate relationship storage unit 442 and the symmetric matrix storage unit 144, respectively, and instructs the disposition data generation unit 452 to generate disposition data, based on the read information.
The disposition data generation unit 452 generates display form data for performing display in a display form different for each piece of category information of a claim, in addition to disposition data described in the first example embodiment.
Further, as illustrated in
In this manner, a node circle assigned with a claim number thereof for each category in which the claim number is included is displayed by a different display form, and thereby visibility can be improved.
The disposition data generation unit 452 may generate disposition data in such a way that each node circle is disposed to form a graphic other than a circle and thereby display for each category is performed. Node circles of claim numbers included in the same category may be disposed for each side of a polygon, for example, in such a way that the polygon is formed from sides whose number is equal to a category number. Specific description is made below.
The disposition data generation unit 452 extracts a category number from category information read from the subordinate relationship storage unit 442. For example, in the case of claim data including the category information illustrated in
The disposition data generation unit 452 calculates coordinate values of node circles and links for disposing node circles of claims in the same category for each side of a polygon in such a way that the polygon is formed from sides whose number equal to the extracted category number.
When the number of nodes is designated as “N”, the number of nodes included in a category having the maximum number of nodes is designated as “Nn”, a radius of a node circle is designated as “r”, and a length of each side of a polygon is designated as “m”, the disposition data generation unit 452 determines a length of a side of a polygon and a radius of a node circle in such a way as to satisfy, for example, a relation of following equation (6).
2r×Nn<m Equation (6)
Alternatively, the disposition data generation unit 452 may determine a length of a side of a polygon and a radius of a node circle in such a way as to satisfy a relation of following equation (7) or equation (8).
2r×Nn<0.8×m Equation (7)
2r×Nn<0.5×m Equation (8)
The disposition data generation unit 452 calculates a coordinate value of a central point of each node circle in such a way that the number of node circles included in each category are evenly disposed on each side, based on the radius of the node circle and the length of the side of the polygon calculated as described above.
The disposition data generation unit 452 further calculates coordinate values of a start point and an end point of a link in such a way as to set a link between node circles indicating claims having a subordinate relationship. The disposition data generation unit 452 stores disposition data including the calculated coordinate values on the disposition data storage unit 453.
Similarly to the first example embodiment, a disposition data adjustment unit 153 adjusts a coordinate value for disposition data stored on the disposition data storage unit 453 in such a way as to eliminate overlapping between node circles or overlapping between a node circle and a link.
The number of sides of a polygon may not be always equal to a category number. In other words, a node circle may be disposed in such a way as to from a polygon including sides of a number equal to the number of independent claims for claim data including a plurality of independent claims (and dependent claims thereof) in a same category.
Further, a polygon formed with node circles is not limited to a regular polygon.
Further, a size of a node circle disposed on each side of a polygon may be uniform or may not be uniform. The disposition data generation unit 452 may specify, for example, a size of a node circle disposed along a side corresponding to a category having a large number of nodes included therein as being relatively small and a size of a node circle disposed along a side corresponding to a category having a small number of nodes included therein as being relatively large. Further, the polygon is not limited to a closed polygon.
Further, in the present third example embodiment, similarly to the second example embodiment, the claim structure extraction unit 440 may extract, in response to reception of claim data from the control unit 120, category information in the category information extraction unit 441 and store the extracted information on the subordinate relationship storage unit 442, regardless of presence or absence of a display instruction for each category. The claim tree generation unit 450 may generate display form data for performing display different for each category and store the generated data on the disposition data storage unit 453, when category information is being stored on the subordinate relationship storage unit 442.
As described above, according to the present third example embodiment, the claim structure extraction unit 440 extracts category information of each claim, and the claim tree generation unit 450 displays a node circle by a form different for each category of a claim in a claim tree. Thereby, the present example embodiment has an advantageous effect that a user can easily confirm category classification, and therefore visibility of a claim structure can be further improved.
Further, the claim tree generation unit 450 displays a claim tree in which a node circle is disposed to form a polygon including a category number as the number of sides, and thereby the present example embodiment has an advantageous effect that visibility of a claim structure can be further improved.
Display for each depth of hierarchy described in the second example embodiment and display for each category described in the present third example embodiment may be displayed in a claim tree at the same time. For example, the depth of hierarchy and a category may be displayed by a tone of a color and a difference in color, respectively.
Next, a fourth example embodiment based on the above-described first to third example embodiments will be described. In the following description, a component similar to the component of the first to third example embodiments is assigned with the same reference sign, and thereby overlapping description will be omitted.
The claim structure extraction unit 470 includes a subordinate relationship storage unit 472 instead of the subordinate relationship storage unit 442 of the claim structure extraction unit 440 according to the third example embodiment, and further includes a similarity analysis unit 471.
The similarity information generation unit 480 includes a similarity display control unit 481, a similarity data generation unit 482, a similarity data output unit 483, and a similarity data storage unit 484.
The information processing device 460 according to the present fourth example embodiment includes a function of displaying similarity between claims in an identifiable manner, in addition to the function of the information processing device 430 described in the third example embodiment.
As described above, a claim is classified into a category such as a device, a method, a system, and the like. For example, a claim classified into a category of a method (hereinafter, referred to as a “method claim”) includes a step of solving an object described in the specification. Further, a claim classified into a category of a device (hereinafter, referred to as a “device claim”) includes a component of a device for solving the object.
One piece of claim data may include claims (e.g., a method claim and a device claim) in which components forming the claims are substantially similar but categories are different. For example, a device claim that is “a device including means configured to execute A1, means configured to execute A2, and means configured to execute A3” and a method claim that is “a method including a step of executing A1, a step of executing A2, and a step of executing A3” may be included in one piece of claim data. A claim in which components are substantially similar to components of a certain claim but a category is different in this manner will be hereinafter referred to as a “similar claim”.
When a similar claim included in one piece of claim data in this manner can be easily confirmed, claim structure analysis is made easier. In the present fourth example embodiment, processing of extracting a similar claim and displaying the similar claim in an identifiable manner will be described.
It is assumed that subordinate relationship information including the category information illustrated in
A control unit 120 according to the present fourth example embodiment notifies a subordinate relationship extraction unit 141 of claim data read from a claim data storage unit 130 and notifies of the similarity analysis unit 471 of the data.
The similarity analysis unit 471 acquires, when receiving the claim data, category information extracted by a category information extraction unit 441 as described in the third example embodiment. The similarity analysis unit 471 extracts a similarity degree between claims included in different categories.
In the similarity analysis unit 471, a similarity degree is defined in advance. For example, a ratio of matching between wordings included in two claims, respectively, is defined as a “similarity degree”. The similarity analysis unit 471 may determine, as a result of text analysis, claims in which a similarity degree is equal to or more than a threshold, e.g., “70%” (or larger than the threshold) as similar claims. For the determination of a similarity degree, an ordinary text analysis technique is usable.
With regard to, for example, the claim data illustrated in
The similarity analysis unit 471 similarly text-analyzes a claim 9, calculates a ratio of matching with wording included in the claim 1, compares the ratio with the threshold, and thereby determines whether the claim 9 is a similar claim of the claim 1.
As described above, the similarity analysis unit 471 analyzes a similarity degree between claims included in different categories and adds the result to the subordinate relationship information stored on the subordinate relationship storage unit 472. It is assumed that the similarity analysis unit 471 has determined that the wordings included in the claim 5 and the claim 9 are matched with the wording included in the claim 1 at a ratio equal to or more than the threshold. In this case, similarity information indicating that the claim 5 and the claim 9 are similar claims of the claim 1 is added to the subordinate relationship storage unit 472.
It is assumed that as described in the third example embodiment, a claim tree is being displayed on a display unit 160 in an identifiable manner by a claim tree generation unit 150 for each category as in
The input acceptance unit 110 notifies, when detecting the instruction from the user, the control unit 120 of the fact. The control unit 120 instructs, in response to the notification, the similarity information generation unit 480 to display similarity information. The similarity information generation unit 480 reads, when receiving the display instruction for similarity information, subordinate relationship information including similarity information by the similarity display control unit 481 from the similarity relationship storage unit 472 and reads disposition data from a disposition data storage unit 155. The similarity display control unit 481 notifies the similarity data generation unit 482 of the read subordinate relationship information and disposition data.
The similarity data generation unit 482 generates similarity data for displaying similar claims in an identifiable manner, based on the received similarity information and disposition data. The similarity data generation unit 482 generates, for example, similarity data for displaying a line (hereinafter, referred to as a “similar link” in some cases) that connects similar claims. In this case, the similarity data generation unit 482 calculates coordinate values of a start point and an end point of a similar link. It is assumed that the received disposition data include a coordinate value in such a way that a node circle is disposed along a basic circle.
In the example illustrated in
The similarity data generation unit 482 stores the calculated coordinate values on the similarity data storage unit 484 as similarity data.
When similarity data is generated by the similarity data generation unit 482, the similarity display control unit 481 instructs the similarity data output unit 483 to output the similarity data. The similarity data output unit 483 reads, based on the instruction, the similarity data from the similarity data storage unit 484 and outputs the read data to the display unit 160.
A similar link generated by the similarity data generation unit 482 may be displayed in an identifiable manner from a link between node circles having a subordinate relationship described in the third example embodiment and the like. Display may be performed using, for example, a different color or a different thickness. Here, a similar claim is displayed in an identifiable manner by a similar link but the way to display the similar claim is not limited thereto. A node circle indicating a similar claim may be displayed, for example, by the same color, pattern, shape, and the like. Alternatively, a node circle indicating a similar claim may be displayed in a blinking manner or the like.
As described above, according to the present fourth example embodiment, the claim structure extraction unit 470 extracts a similarity degree between claims, and the similarity information generation unit 480 displays claims that are similar in an identifiable manner The present example embodiment has an advantageous effect that a user can easily confirm a similar claim, and therefore visibility of a claim structure can be further improved.
Next, a fifth example embodiment based on the above-described first to fourth example embodiments will be described.
In the present fifth example embodiment, an operation for facilitating a structure comparison between two or more pieces of claim data will be described.
The display operation will be described with reference to
A user issues a selection instruction for a plurality of pieces of claim data to be compared to an input acceptance unit 110, and the input acceptance unit 110 notifies a control unit 120 of the fact. The control unit 120 reads a plurality of pieces of selected claim data from a claim data storage unit 130 and notifies a claim structure extraction unit 470 of the read data.
The claim structure extraction unit 470 extracts, as described in the first example embodiment, a subordinate relationship, a symmetric matrix, and category information regarding the plurality of pieces of selected claim data, respectively, and stores the extracted information on the subordinate relationship storage unit 472 and the symmetric matrix storage unit 144.
The control unit 120 instructs a claim tree generation unit 150 to concentrically display a plurality of claim trees regarding the read claim data. A disposition data generation unit 152 generates disposition data regarding the plurality of pieces of selected claim data, as described in the first example embodiment. At that time, the disposition data generation unit 152 matches coordinate values of central points of respective basic circles where node circles are disposed in order to concentrically display each claim tree and generates disposition data in such a way as to make radii of the basic circles different.
The disposition data output unit 154 concentrically displays, as illustrated in
It is conceivable that, for example, claim trees based on the scope of claim for patent attached to an application (at the time of filing) and the scope of claim for patent for which registration of establishment has been made, respectively, are concentrically displayed. In
Further, as described in the fourth example embodiment, the similarity analysis unit 471 may analyze a similarity degree between claims (e.g., claims 1) included in a plurality of pieces of selected claim data, respectively, and store similar claims on the subordinate relationship storage unit 472. The similarity information generation unit 480 may displayed similar claims in an identifiable manner on the display unit 160 by connecting, by a similar link, for example, a claim 1 in a claim tree A and a claim 2 in a claim tree B or the like.
As described above, according to the fifth example embodiment, the claim tree generation unit 150 concentrically displays claim trees regarding two or more pieces of claim data. The present example embodiment has an advantageous effect that a user easily compares two or more claim structures.
Here, a plurality of claim trees is concentrically disposed. However, the present example embodiment is not limited thereto, and a plurality claim trees may alternatively be disposed in a concentrically ellipsoidal manner, or may be disposed in such a way that a plurality of polygons in which central points are matched are overlapped. Alternatively, without limitation to overlapped disposition, a plurality of claim trees may be disposed side by side.
Next, a sixth example embodiment based on the above-described first example embodiment will be described. In the following description, a component similar to the component of the first example embodiment is assigned with the same reference sign, and thereby overlapping description will be omitted.
In the present sixth example embodiment, an operation for facilitating a structure comparison between two or more pieces of claim data by using an indicator will be described.
The graph generation unit 510 includes a graph display control unit 511, a link number calculation unit 512, a network density calculation unit 513, an average inter-vertex distance calculation unit 514, a cluster number calculation unit 515, a graph data generation unit 516, a graph output unit 517, and a graph data storage unit 518.
In the first example embodiment to the fifth example embodiment, it has been described that of pieces of claim data analyzed as described above, a claim tree regarding one or a plurality of pieces of claim data is displayed on the display unit 160. Description will be made on a matter that the information processing device 500 according to the present sixth example embodiment displays a structure of each of a plurality of pieces of claim data analyzed as described above on one graph by using an indicator and thereby easily compares the structures of the plurality of pieces of claim data.
In the present sixth example embodiment, examples using, as the indicator, a link number, a network density, an average inter-vertex distance, and a cluster number will be described without limitation thereto.
Further, it is assumed that subordinate relationship information, a symmetric matrix, and disposition data regarding a plurality of pieces of claim data are being stored on a subordinate relationship storage unit 143, a symmetric matrix storage unit 144, and a disposition data storage unit 155, respectively.
An outline of the components of the graph generation unit 510 will be described.
The graph display control unit 511 reads, when receiving an instruction for graph display from a control unit 120, subordinate relationship information, a symmetric matrix, and disposition data from the subordinate relationship storage unit 143, the symmetric matrix storage unit 144, and the disposition data storage unit 155, respectively, and controls generation of a graph.
The link number calculation unit 512 calculates a link number, based on the information read by the graph display control unit 511, and stores the result on the graph data storage unit 518. The link number refers to the number of links between claims having a subordinate relationship included in one piece of claim data, as described in the first example embodiment.
The network density calculation unit 513 calculates a network density, based on the information read by the graph display control unit 511, and stores the result on the graph data storage unit 518. The network density refers to a ratio of a link number actually connecting among node circles to a total number of links in which all node circles are connected.
The average inter-vertex distance calculation unit 514 calculates an average inter-vertex distance a definition of which will be described later, based on the information read by the graph display control unit 511, and stores the result on the graph data storage unit 518.
The cluster number calculation unit 515 calculates a cluster number a definition of which will be described later, based on the information read by the graph display control unit 511, and stores the result on the graph data storage unit 518.
The graph data generation unit 516 generates graph data for displaying a graph in which, for example, the horizontal axis is designated as a node number and the vertical axis is designated as an indicator using each calculated value described above, and stores the generated graph data on the graph data storage unit 518.
The graph output unit 517 outputs a graph to a display unit 160, based on the graph data stored on the graph data storage unit 518.
Next, an operation for outputting a graph by the graph generation unit 510 will be described.
It is assumed that a user has made an instruction for graph display regarding claim data. An input acceptance unit 110 notifies the control unit 120 of the instruction.
The control unit 120 instructs, when receiving the graph display instruction from the input acceptance unit 110, the graph display control unit 511 to perform graph display. The graph display control unit 511 reads, in accordance with the instruction, subordinate relationship information, a symmetric matrix, and disposition data from the subordinate relationship storage unit 143, the symmetric matrix storage unit 144, and the disposition data storage unit 155, respectively.
The graph display instruction includes an indicator for graph display. When the graph display instruction includes “a link number”, the graph display control unit 511 notifies the link number calculation unit 512 of the read information.
The link number calculation unit 512 calculates the number of nodes and a link number included in respective pieces of claim data, based on the received information. The number of nodes is equal to the number of claims. The link number is determined as a total number of “1”/2 in a symmetric matrix. The link number calculation unit 512 stores the calculated link number and the number of nodes on the graph data storage unit 518 in association with each piece of claim data.
The graph display control unit 511 instructs, when the link number and the number of nodes are stored on the graph data storage unit 518, the graph data generation unit 516 to generate graph data regarding the link number and the number of nodes. The graph data generation unit 516 reads the link number and the number of nodes from the graph data storage unit 518 in accordance with the instruction and generates, based on these numbers, graph data such as a scale for displaying a graph of values in which, for example, the number of nodes is set as the horizontal axis and a link number is set as the vertical axis. The graph data generation unit 516 stores the generated graph data on the graph data storage unit 518.
When the graph data are stored on the graph data storage unit 518, the graph display control unit 511 instructs the graph output unit 517 to output a graph in which a link number is an indicator. The graph data output unit 517 displays, in accordance with the instruction, a graph in which a link number is an indicator on the display unit 160, based on the graph data stored in the graph data storage unit 518.
The network density calculation unit 513, the average inter-vertex distance calculation unit 514, and the cluster number calculation unit 515 are considered in a similar manner.
When a graph display instruction includes “a network density”, the network density calculation unit 513 calculates a network density, based on information received from the graph display control unit 511. A network density D is calculated based on following equation (9).
Herein, H is a link number and N is the number of nodes.
The graph data generation unit 516 generates graph data, based on the network density calculated as described above.
When the graph display instruction includes “an average inter-vertex distance”, the average inter-vertex distance calculation unit 514 calculates an average inter-vertex distance in which node circles are vertexes in a claim tree, based on information received from the graph display control unit 511. An average inter-vertex distance L can be calculated based on following equation (10).
Herein, N is the number of nodes and dij is a component (i,j) of a symmetric matrix.
The graph data generation unit 516 generates graph data, based on the average inter-vertex distance calculated as described above.
When the graph display instruction includes “a cluster number”, the cluster number calculation unit 515 extracts a number of clusters, based on information received from the graph display control unit 511. The number of clusters refers to a total number of clusters (an independent claim being not linked, i.e. having no dependent claim is also counted as one cluster) in which a set of nodes linked to each other is one unit (one cluster) in a claim tree. In other words, the cluster number is equivalent to the number of independent claims, and the number of claims in which, for example, the depth of hierarchy described in the second example embodiment is “1” may be set as a cluster number.
The graph data generation unit 516 generates graph data, based on the cluster number calculated as described above.
Further, in the present sixth example embodiment, similarly to the third example embodiment, the graph display control unit 511 may generate, regardless of presence or absence of a graph display instruction, graph data for each indicator described above in response to generation of subordinate relationship information, a symmetric matrix, and disposition data and store the generated data on the graph data storage unit 518.
At the timing of designating, for example, claim data to be analyzed in the field 610 and pressing the determination button 630, the information processing device 500 may generate subordinate relationship information, a symmetric matrix, and disposition data as well as graph data and store these items on the graph data storage unit 518. When receiving, from a user, a graph display instruction and designation of an indicator through a click and the like of the tab 640 indicating an indicator, the control unit 120 instructs the graph display control unit 511 to perform graph display. The graph display control unit 511 may instruct the graph output unit 517 to perform graph display in accordance with the instruction, and the graph output unit 517 may output a graph to the display unit 160, based on graph data being stored on the graph data storage unit 518 and relating to the designated indicator.
As described above, according to the sixth example embodiment, the graph generation unit 510 displays a graph based on various types of indicators, based on information generated from a plurality of pieces of claim data. Therefore, the present example embodiment has an advantageous effect that a user can easily compare a plurality of claim structures and can more deeply study the scope of claim for patent or a description, for example, from a result of the comparison, whereby quality thereof can be improved.
As illustrated in
The subordinate relationship extraction unit 710 extracts a claim number and a subordinate relationship between claims from claim data including a plurality of claims.
The relationship diagram generation unit 720 generates, based on the subordinate relationship between claims, a relationship diagram in which the claim number is disposed on or in a periphery of circularly-arranged points or a circling line.
The relationship diagram generation unit 720 includes the claim tree generation unit 150 in the first example embodiment, and a relationship diagram includes a claim tree in the first example embodiment.
As described above, the present seventh example embodiment has an advantageous effect that even when the number of claims is large, a claim structure thereof can be easily confirmed.
The present invention can be also carried out by combining the example embodiments. In other words, various combinations such as display of both hierarchical information and category information in a claim tree, display of similarity information in a claim tree together with hierarchical information and category information, and the like are possible.
Each unit of the information processing device illustrated in
A function indicated in each block in the information processing device illustrated in
Further, the present invention described using each example embodiment as an example is achieved by supplying a computer program capable of realizing the above-described function to the information processing device and executing the computer program by being read onto the RAM 51 by the processor 50.
The supplied computer program may be stored on a readable and writable memory (transitory storage medium) or a computer-readable storage device such as a hard disk device. In such a case, it is conceivable that the present invention includes codes representing the computer program or a storage medium storing the computer program.
As described above, the present invention has been described using the above-described example embodiments as typical examples. However, the present invention is not limited to the above-described example embodiments. In other words, the present invention can be applied with various forms understood by those skilled in the art without departing from the scope of the present invention.
This application is based upon and claims the benefit of priority from Japanese patent application No. 2015-188696, filed on Sep. 25, 2015, the disclosure of which is incorporated herein in its entirety by reference.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2015-188696 | Sep 2015 | JP | national |
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/JP2016/004317 | 9/23/2016 | WO | 00 |
