PATENT CLAIM ANALYSIS

Application Number: 15915894
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2019-09
Patent Classification: ["717", "144000"]

Abstract:
According to an aspect of an embodiment, a method may include generating an abstract code graph (ACG). The method may include obtaining an abstract syntax tree (AST). The AST may include a first AST node that may represent a first construct at a first level of abstraction and a second AST node that may represent a second construct. The method may further include generating an ACG, based on the AST. The generating of ACG may include generating a first ACG node based on the first AST node and a second ACG node based on the second AST node. The generating of ACG may also include generating, based on the first ACG node, a third ACG node that represents the first construct at a second level of abstraction. The third ACG node may be connected between the first ACG node and the second ACG node based on the AST.

Claim (Index 18):
A system comprising:\n one or more processors; and one or more computer-readable storage media communicatively coupled to the one or more processors and storing instructions thereon that, in response to execution by the one or more processors, cause the system to perform operations comprising:\n obtaining an abstract syntax tree (AST) that represents constructs of source code and relationships between the constructs in the source code, the abstract syntax tree comprising:\n a first AST node that represents a first construct as located at a first location in the source code, the first AST node representing the first construct at a first level of abstraction; and \n a second AST node that represents a second construct as located at a second location in the source code, the first AST node being connected to the second AST node in the abstract syntax tree in a manner that represents a relationship between the first construct at the first location and the second construct at the second location; and \n \n generating an abstract code graph (ACG), based on the abstract syntax tree, the generating of abstract code graph comprising:\n generating a first ACG node based on the first AST node, the first ACG node representing the first construct at the first level of abstraction; \n generating a second ACG node based on the second AST node; and \n generating, based on the first ACG node, a third ACG node that represents the first construct at a second level of abstraction; the second level of abstraction being more abstract than the first level of abstraction, the third ACG node being connected between the first ACG node and the second ACG node such that the second ACG node is related to the first ACG node through the third ACG node in the abstract code graph, the relation between the first ACG node and the second ACG node being based on the first AST node being connected to the second AST node in the abstract syntax tree.

Metadata:
- Claim Count in Document: 23.0
- Percentile: 90.0
- Lexical Diversity: 3.70455
- Patent Class: 717.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14603259', '12244959', '13874534', '14555044', '13902636']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3903064736649912
- 35 USC 102 Novelty (BERT): 0.4926297302942488
- Combined Prediction Score: 0.400538799327917
- Mean Citation Score: 214.017196
- Max Citation Score: 223.3591
- Similarity Product: 179.98274077587726

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

Dataset: test