PATENT CLAIM ANALYSIS

Application Number: 16019943
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2020-01
Patent Classification: ["455", "466000"]

Abstract:
A method for compressing a short message includes receiving a short message that includes a plurality of text strings for compression, dividing the short message into one or more sub-blocks, where a number of text strings in each of the one or more sub-blocks is less than or equal to a predetermined number. The method also includes compressing each of the one or more sub-blocks by identifying a type of a first text string, identifying a code representing the type, determining whether the first text string exists in a library, upon determining that the first text string exists in the library, determining an index corresponding to the first text string, extracting a predetermined number of least significant digits of the index, and replacing the first text string in that sub-block with the code and the extracted predetermined number of least significant digits of the index.

Claim (Index 1):
A method for compressing a short message, comprising, by a processor:\n receiving a short message to be compressed, the short message comprising a plurality of text strings; dividing the short message into a plurality of sub-blocks, wherein a number of text strings in each of the plurality of sub-blocks is less than or equal to a predetermined number; processing each sub-block of the plurality of sub-blocks by:\n (a) identifying a type of a first text string in the sub-block; \n (b) identifying a code representing the type; \n (c) determining whether the first text string exists in a library; \n (d) upon determining that the first text string exists in the library,\n (d-1) determining an index representing an address location of a data entry corresponding to the first text string contained in memory, \n (d-2) extracting a predetermined number of least significant digits of the index, and \n (d-3) replacing the first text string in the sub-block with the code and the extracted predetermined number of least significant digits of the index; and \n \n (e) upon determining that the first text string does not exist in the library,\n (e-1) formatting the first text string for communication to a receiving device, and \n (e-2) appending to the formatted first text string a code indicating that the library was not used to compress the text string; and \n \n (f) repeating (a)-(e) for each second text string in the sub-block; \n wherein at least one of the sub-blocks of the short message comprises a partially compressed sub-block in which at least one text string is compressed using the library and at least one text string is not compressed using the library.

Metadata:
- Claim Count in Document: 92.0
- Percentile: 94.0
- Lexical Diversity: 2.58333
- Patent Class: 455.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14881328', '13413603', '12701311', '12623025', '12757972']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6729715581500714
- 35 USC 102 Novelty (BERT): 0.4856071544403913
- Combined Prediction Score: 0.6542351177791034
- Mean Citation Score: 157.815754
- Max Citation Score: 159.68893
- Similarity Product: 102.57813829520344

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

Dataset: test