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 5):
The method according to  claim 4 , wherein the step of processing different types of character combinations according to corresponding types of character matching rules, comprises:\n for a character combination having no tag, combining 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 updating and saving a weight; matching 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, combining 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 updating and saving a weight; and if no successful match occurs, not saving a weight; matching 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, combining 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 updating and saving a weight; if no successful match occurs, not saving a weight; and for a character combination having a tag, matching 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, combining 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 updating and saving a weight; if no successful match occurs, not saving 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.6817926705224209
- 35 USC 102 Novelty (BERT): 0.5114835881883668
- Combined Prediction Score: 0.6647617622890155
- Mean Citation Score: 192.598276
- Max Citation Score: 204.31596
- Similarity Product: 107.34571427823543

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

Dataset: test