PATENT CLAIM ANALYSIS

Application Number: 15957764
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-09
Patent Classification: ["704", "010000"]

Abstract:
A dictionary data structure is described. The data structure is made up of first, second, and third tables. The first table is comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term. The second table is comprised of entries each representing a definition, each entry of the second containing a definition ID identifying its definition. The third table is comprised of entries each representing correspondence between a terminate definition defining the term, each entry of the third table containing term ID identifying the defined term and a definition ID identifying the defining definition. The contents of the data structure are usable to identify any definitions corresponding to a term.

Claim (Index 14):
A computer-readable storage medium, that is not a signal, storing data accessible by a program executable by a computing system, the computer-readable storage medium comprising:\n a dictionary data structure, wherein the dictionary data structure includes information usable by the program to identify one or more definitions for a distinguished natural language term, the dictionary data structure comprising:\n a first table comprising term entries, wherein each term entry represents a natural language term, and wherein a first entry of the term entries of the first table comprises a representation of the distinguished natural language term; \n a second table comprising correspondence entries, wherein each correspondence entry represents a correspondence between a term and a definition defining the term, and wherein one or more second entries of the correspondence entries are related to the first entry; and \n a third table comprising definition entries, wherein each definition entry represents a definition of a term, and wherein, for each particular second entry of the one or more second entries, the definition entries include a third entry related to the particular second entry, \n wherein the second entries are useable by the program to identify the third entries, and each particular third entry of the identified third entries is useable by the program to attribute a representation of the definition represented by the particular third entry to the distinguished natural language term.

Metadata:
- Claim Count in Document: 29.0
- Percentile: 91.0
- Lexical Diversity: 2.86957
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15404916', '14963063', '11343251', '10302151', '13776594']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2220841329224245
- 35 USC 102 Novelty (BERT): 0.5153457745331625
- Combined Prediction Score: 0.2514102970834984
- Mean Citation Score: 194.389429
- Max Citation Score: 310.8903
- Similarity Product: 266.04843996623754

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

Dataset: test