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 15):
The system according to  claim 13 , wherein the weight determination sub-module comprises:\n a first level weight determination sub-module configured to save characters in a first level of character nodes of the dictionary which match a first character in the initial key code string and characters surrounding the first character as root nodes; an N-th level weight determination sub-module configured to, for characters of nodes based on root nodes, determine the weights of the character combinations according to the following procedure until traversal of characters of all nodes is finished:\n a parent node character combination reading unit configured to, for character nodes in an N-th level, N being an integer greater than 1, read various types of character combinations corresponding to a parent node of a current node and weights corresponding to the character combinations, wherein the various types of character combinations corresponding to the parent node comprise a character combination having no tag, and/or a character combination having a key-missing process tag , and/or a character combination having an extra-input process tag; \n a character match unit configured to match a character of the current node in the dictionary with characters in an N-th level of the key code string weight list; \n a successful match process unit configured to, if the character of the current node in the dictionary matches a character in the N-th level of the key code string weight list, combine the character of the current node with the various types of character combinations corresponding to the parent node into various types of character combinations corresponding to the current node and update weights, and save the various types of character combinations corresponding to the current node and the weights corresponding to the various types of character combinations; and \n a failed match process unit configured to, if the character of the current node does not match the characters in the N-th level of the key code string weight list, process different types of character combinations according to corresponding types of character matching rules.

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.6840632923050785
- 35 USC 102 Novelty (BERT): 0.5009609733493113
- Combined Prediction Score: 0.6657530604095018
- Mean Citation Score: 192.598276
- Max Citation Score: 204.31596
- Similarity Product: 123.86075150058028

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