PATENT CLAIM ANALYSIS

Application Number: 16183305
Application Type: Utility
Filing Date: 2018-11
Publication Date: 2019-05
Patent Classification: ["704", "009000"]

Abstract:
Examples for efficiently representing, processing and deciding amongst multiple ambiguous interpretations of human natural language text are described. Processing includes creating and augmenting an “interpretation graph” which represents all known ambiguous interpretations of some natural language text. The interpretation graph is made of vertices (junction points which lead to alternative interpretations) and ‘lexical items’ (natural language objects representing data blocks, tokens, word parts, phrases, clauses, parts of speech, entities, or semantic interpretations) that represent alternative ambiguous interpretations of portions of the text. The examples show a set of simple operations for augmenting the interpretation graph to create alternative interpretations. Finally, the method includes a notion of “confidence”, which is computed as the graph is being constructed and can be used by a selector once the graph is complete to choose the most likely interpretation followed by any number of increasingly less likely interpretations. By saving all known ambiguous or alternative interpretations in an interpretation graph, the example system can provide better accuracy, reliability and coverage since possible alternatives are not pruned until the final end-to-end interpretation is selected.

Claim (Index 19):
A non-transitory computer readable medium including machine readable instructions that are executable by a processor to:\n receive an input, wherein the input is indicative of a data stream; read data from the data stream and convert the data stream into one or more data blocks; creating an interpretation graph providing alternative interpretations of the input, an alternative interpretation represented as a path through the interpretation graph, wherein the interpretation graph includes,\n vertices representing junction points in the input, each of the vertices including zero or more arcs directed to zero or more lexical items, an arc being a connection between two vertices passing through the lexical items; and \n the lexical items representing the alternative interpretations of the input covering a range of the input spanned by two vertices; \n wherein creating further comprises augmenting and refining the interpretation graph by performing at least one of,\n creating a new lexical item and adding the new lexical item to the interpretation graph from one existing vertex from the vertices to another vertex in the vertices; \n creating a sequence of new lexical items, each lexical item in the sequence being joined in an order by a vertex, wherein the sequence is added to the interpretation graph from one existing vertex from the vertices to another vertex in the vertices; and \n modifying a confidence score associated with each of the lexical items; and \n select an alternative interpretation from the interpretation graph, wherein selecting comprises,\n computing an overall confidence score for the path in the interpretation graph from one vertex to another; and \n searching through the interpretation graph to identify the path from a first vertex to a last vertex with a highest overall confidence.

Metadata:
- Claim Count in Document: 62.0
- Percentile: 98.0
- Lexical Diversity: 1.80702
- Patent Class: 704.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15994869', '14578843', '13793805', '10943046', '14550218']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2505358221493577
- 35 USC 102 Novelty (BERT): 0.4867443796571741
- Combined Prediction Score: 0.2741566779001393
- Mean Citation Score: 182.169808
- Max Citation Score: 191.67279
- Similarity Product: 141.9254244746661

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