PATENT CLAIM ANALYSIS

Application Number: 15945020
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-10
Patent Classification: ["704", "009000"]

Abstract:
A formula system can transform a formula natural language representation (“NLR”) into a representation which shows the formula in traditional mathematical notation. This transformation can include creating a state machine with transition mappings between states that match to initial parts of the NLR. These transition mappings can include global transition mappings that are first attempted to be matched to the beginning of the NLR and then state specific transition mappings can be matched to the NLR. The formula system can consume the NLR, transitioning from state to state as indicated by the transition mappings and removing the matched initial part from the NLR, until the NLR has been fully consumed. In some cases, the formula system can recursively or iteratively create additional state machines to consume portions of the NLR. Some states provide a result (e.g. portion of a formula representation) which are combined to create the final formula representation.

Claim (Index 18):
A computing system for transforming a natural language representation of a formula into a formula representation, the system comprising:\n one or more processors; and a memory storing instructions that, when executed by the one or more processors, cause the computing system to perform operations comprising:\n consuming multiple parts of the natural language representation of the formula, wherein consuming each particular part of the multiple parts is performed by:\n matching at least some of the particular part of the natural language representation of the formula to a transition mapping, wherein the transition mapping includes a mapping destination that specifies a next state; \n in response to the matching, instantiating the next state indicated by the mapping destination of the matched transition mapping; and \n storing any state results of the next state, wherein at least two states are reached, during the consuming of the multiple parts of the natural language representation of the formula, that produce state results; and \n \n combining the stored state results of the at least two states into the formula representation which, when rendered, displays the formula in mathematical notation.

Metadata:
- Claim Count in Document: 4.0
- Percentile: 91.0
- Lexical Diversity: 2.0
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15107237', '11257485', '15107250', '11552751', '15512230']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2542432478883787
- 35 USC 102 Novelty (BERT): 0.4259571340462184
- Combined Prediction Score: 0.2714146365041627
- Mean Citation Score: 111.60150120000002
- Max Citation Score: 117.28988
- Similarity Product: 104.58399180466176

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

Dataset: test