PATENT CLAIM ANALYSIS

Application Number: 16175131
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-02
Patent Classification: ["708", "512000"]

Abstract:
Low precision computers can be efficient at finding possible answers to search problems. However, sometimes the task demands finding better answers than a single low precision search. A computer system augments low precision computing with a small amount of high precision computing, to improve search quality with little additional computing.

Claim (Index 1):
A device comprising:\n a plurality of low precision high dynamic range (LPHDR) execution units; at least one high precision execution unit, wherein the precision of computations performed by the at least one high precision execution unit is higher than the precision of computations performed by the plurality of LPHDR execution units; means for controlling the plurality of LPHDR execution units and the at least one high precision execution unit to perform a method, the method comprising:\n (A) receiving, as input, a plurality of example vectors and a test vector; \n (B) storing the plurality of example vectors; \n (C) using the plurality of LPHDR execution units to:\n (C) (1) identifying a first example vector, within the plurality of example vectors, that is nearest to the test vector; \n (C) (2) storing an identifier of the first example vector; \n (C) (3) identifying a second example vector, within the plurality of example vectors, that is second nearest to the test vector; and \n (C) (4) storing an identifier of the second example vector; \n \n (D) using the at least one high precision execution unit to:\n (D) (1) compute a first distance between the test vector and the first example vector; \n (D) (2) compute a second distance between the test vector and the second example vector; \n (D) (3) identify the lessor of the first distance and the second distance; \n (D) (4) identify, from among the first example vector and the second example vector, an example vector associated with the lessor of the first distance and the second distance; and \n (D) (5) output the example vector associated with the lessor of the first distance and the second distance.

Metadata:
- Claim Count in Document: 66.0
- Percentile: 97.0
- Lexical Diversity: 1.41026
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15784359', '12816201', '13849606', '13399884', '14976852']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4453315675320163
- 35 USC 102 Novelty (BERT): 0.4850288996088101
- Combined Prediction Score: 0.4493013007396957
- Mean Citation Score: 219.705934
- Max Citation Score: 261.20682
- Similarity Product: 254.02173986537585

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

Dataset: test