PATENT CLAIM ANALYSIS

Application Number: 15891651
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-12
Patent Classification: ["345", "168000"]

Abstract:
In a method and a system for recommending candidates in an input method, an initial key code and/or an initial key code string inputted by a user using an input method is received; according to the initial key code, a recommended input character is determined; and a weight of the recommended input character is increased.

Claim (Index 16):
The system according to  claim 15 , wherein the failed match process unit comprises:\n a no-tagged character combination process sub-unit configured to, for a character combination having no tag, combine the character of the current node with a character combination having no tag of the parent node into a character combination corresponding to the character combination having no tag of the current node, and update and save a weight; an upper level match sub-unit configured to match characters of sub-nodes of the current node with the characters in the N-th level of the key code string weight list; if a successful match occurs, combine the character of the current node with the character combination having no tag of the parent node into a character combination corresponding to a character combination of the current node which has a key-missing process tag, and update and save a weight; and if no successful match occurs, not save a weight; a lower level match sub-unit configured to match the character of the current node with characters in a (N+1)-th level of the key code string weight list; if a successful match occurs, combine the character of the current node with the character combination having no tag of the parent node into a character combination corresponding to a character combination of the current node which has an extra-input process tag, and update and save a weight; if no successful match occurs, not save a weight; and a tagged character combination process sub-unit configured to, for a character combination having a tag, match the characters of sub-nodes of the current node with the characters in the N-th level of the key code string weight list; if a successful match occurs, combine the character of the current node and a character combination having a tag of the parent node into a character combination having a tag corresponding to the current node, and update and save a weight; if no successful match occurs, not save a weight.

Metadata:
- Claim Count in Document: 38.0
- Percentile: 88.0
- Lexical Diversity: 1.76471
- Patent Class: 345.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14762355', '11887023', '11871887', '12488375', '11019517']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6845570522012858
- 35 USC 102 Novelty (BERT): 0.4986671710427697
- Combined Prediction Score: 0.6659680640854342
- Mean Citation Score: 192.598276
- Max Citation Score: 204.31596
- Similarity Product: 127.46017098027706

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

Dataset: test