PATENT CLAIM ANALYSIS

Application Number: 15907251
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-08
Patent Classification: ["704", "009000"]

Abstract:
Systems and methods for analyzing a large number of textual passages are described. A computing device receives the textual passages as input and generates a Raw Pair Distance (RPD) table. The device then determines a Node table and an Node-Node Distance (NND) matrix from the RPD table. An energy reduction process is used to generate an NSPACE matrix from the NND matrix. Finally, a 3D visualizer displays aspects of the Nodes table and the NSPACE matrix to a user. The systems and methods may enable a user to quickly search and understand the text relationships within the large number of textual passages.

Claim (Index 14):
A method for creating an optimized node coordinate matrix in a predetermined number of dimensions n from a node-node distance matrix, wherein the node-node distance matrix includes a plurality node pairs and a distance associated with each node pair, using a text analysis system comprising a CPU and at least one software module operatively coupled to the CPU and configured to perform the text analysis method, comprising the steps of:\n assigning a coordinate location in n-space to each node; setting a stress value; creating an offset array based on the number of dimensions; for each node, performing the steps of:\n for each row of the offset array, setting the row equal to a current offset array row and performing the steps of: \n offsetting the coordinate location of the node based on the current offset array row; \n determining, based on the offset coordinate location for each node pair including the selected node, a trial distance between the nodes in the node pair based on the offset coordinate location of the node and the coordinate location of the other node; \n comparing the trial distance for each node pair with the corresponding node pair distance from the node-node distance matrix; \n assigning a stress value to each node pair wherein the larger the difference between the compared distances, the larger the stress value; \n summing the node pair stresses; and \n setting, if the sum of the node pair stresses is lower than the stress value, the stress value equal to the sum of the node pair stresses and setting the node coordinate location equal to the offset coordinate location, thereby determining an optimized coordinate location for each node.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 88.0
- Lexical Diversity: 1.76562
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14533058', '14931697', '11364038', '12775539', '10501397']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.249284279665022
- 35 USC 102 Novelty (BERT): 0.4832028933319411
- Combined Prediction Score: 0.2726761410317139
- Mean Citation Score: 148.37738199999995
- Max Citation Score: 165.91658
- Similarity Product: 109.26885753346684

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 0
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test