PATENT CLAIM ANALYSIS

Application Number: 15927234
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-08
Patent Classification: ["704", "009000"]

Abstract:
A consistent meaning framework (CMF) graph including a plurality of nodes linked by a plurality of edges is maintained in data storage of a data processing system. Multiple nodes among the plurality of nodes are meaning nodes corresponding to different word meanings for a common word spelling of a natural language. Each of the multiple word meanings has a respective one of a plurality of associated constraints. A natural language communication is processed by reference to the CMF graph. The processing includes selecting, for a word in the natural language communication, a selected word meaning from among the multiple word meanings based on which of the plurality of associated constraints is satisfied by the natural language communication. An indication of the selected word meaning is stored in data storage.

Claim (Index 51):
A data processing system for generating a response to a natural language communication, the data processing system comprising:\n a processor; a storage device coupled to the processor; and program code stored within the storage device, wherein the program code, when executed by the processor, causes the data processing system to perform:\n prior to receipt by the data processing system of a natural language communication for processing, maintaining, in data storage of the data processing system, a consistent meaning framework (CMF) graph providing word meanings for various word spellings of a natural human language, wherein multiple of the word meanings are each associated by the CMF graph with a respective one of a plurality of constraints defining a grammatical class of word meaning and indicating a sense of word meaning; \n in response to receipt by the data processing system of the natural language communication, a processor of the data processing system processing the natural language communication by reference to the CMF graph, wherein the processing includes parsing the natural language communication and selecting, for each of multiple word spellings in the natural language communication, a selected word meaning from among the word meanings provided by the CMF graph based on which of the plurality of associated constraints is satisfied by the natural language communication, wherein the parsing includes applying multiple nested constraints to determine the selected word meaning for at least one word spelling in the natural language communication; and \n based on results of the processing, the processor outputting a natural language response to the natural language communication.

Metadata:
- Claim Count in Document: 71.0
- Percentile: 90.0
- Lexical Diversity: 2.27869
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14675949', '14617305', '14825171', '12910408', '15109044']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2541487949124393
- 35 USC 102 Novelty (BERT): 0.5870189631678853
- Combined Prediction Score: 0.2874358117379839
- Mean Citation Score: 257.18573200000003
- Max Citation Score: 506.55276
- Similarity Product: 448.315008847332

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