PATENT CLAIM ANALYSIS

Application Number: 16022001
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2019-12
Patent Classification: ["704", "009000"]

Abstract:
Systems, methods, and computer-executable instructions for approximating a softmax layer are disclosed. A small world graph that includes a plurality of nodes is constructed for a vocabulary of a natural language model. A context vector is transformed. The small world graph is searched using the transformed context vector to identify a top-K hypothesis. A distance from the context vector for each of the top-K hypothesis is determined. The distance is transformed to an original inner product space. A softmax distribution is computed for the softmax layer over the inner product space of the top-K hypothesis. The softmax layer is useful for determining a next word in a speech recognition or machine translation.

Claim (Index 14):
The system of  claim 9 , wherein the small world graph comprises a number of layers.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 94.0
- Lexical Diversity: 1.96774
- Patent Class: 704.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15421016', '12963161', '15139886', '15829123', '16008367']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2206269863710014
- 35 USC 102 Novelty (BERT): 0.4912767818117518
- Combined Prediction Score: 0.2476919659150765
- Mean Citation Score: 123.8895296
- Max Citation Score: 129.00916
- Similarity Product: 80.22500152900935

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