PATENT CLAIM ANALYSIS

Application Number: 16035513
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2018-12
Patent Classification: ["704", "232000"]

Abstract:
Systems and processes for converting speech-to-text are provided. In one example process, speech input can be received. A sequence of states and arcs of a weighted finite state transducer (WFST) can be traversed. A negating finite state transducer (FST) can be traversed. A virtual FST can be composed using a neural network language model and based on the sequence of states and arcs of the WFST. The one or more virtual states of the virtual FST can be traversed to determine a probability of a candidate word given one or more history candidate words. Text corresponding to the speech input can be determined based on the probability of the candidate word given the one or more history candidate words. An output can be provided based on the text corresponding to the speech input.

Claim (Index 12):
The method of  claim 9 , further comprising:\n determining, using the neural network language model, a third probability of the candidate word given the one or more history candidate words, wherein the virtual FST is composed using the third probability of the candidate word given the one or more history candidate words.

Metadata:
- Claim Count in Document: 54.0
- Percentile: 95.0
- Lexical Diversity: 2.35484
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15156161', '15225253', '13964419', '13773880', '14503370']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2763528180547116
- 35 USC 102 Novelty (BERT): 0.5610104174003444
- Combined Prediction Score: 0.3048185779892749
- Mean Citation Score: 281.250006
- Max Citation Score: 494.3377
- Similarity Product: 338.9345662119865

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