PATENT CLAIM ANALYSIS

Application Number: 16354076
Application Type: Utility
Filing Date: 2019-03
Publication Date: 2019-08
Patent Classification: ["326", "046000"]

Abstract:
An example finite state machine may include a content-addressable memory. The content-addressable memory may include blocks that respectively store input-terms of the finite state machine. The finite state machine may be configured to, for each received input: select a subset of the blocks of the content addressable memory to enable for searching, the subset being selected based on a current state of the finite state machine, and determine a next state of the finite state machine by searching the currently enabled subset of blocks of the content addressable memory based on the input.

Claim (Index 33):
The non-transitory machine-readable storage medium of  claim 32 , wherein the processor comprises a processing circuit external to and communicatively coupled to the FSM.

Metadata:
- Claim Count in Document: 14.0
- Percentile: 99.0
- Lexical Diversity: 2.22222
- Patent Class: 326.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15885193', '10603253', '13548382', '12105401', '14251423']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6194175650670634
- 35 USC 102 Novelty (BERT): 0.5371877125871265
- Combined Prediction Score: 0.6111945798190697
- Mean Citation Score: 184.219982
- Max Citation Score: 368.1262
- Similarity Product: 232.6245455970526

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