Automated comprehension of natural language via constraint-based processing
OwnerThomas A. Viselinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerThomas A. Viselinventor
Estimating the term…
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 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. The selected word meaning for each of the multiple word spellings in the natural language communication is recorded in data storage.
A program product for processing a natural language communication, the program product comprising:
A program product for processing a natural language communication, the program product comprising:
A data processing system for processing a natural language communication, the data processing system comprising:
A method for processing a natural language communication in a data processing system including a processor, the method comprising:
Dependencies are inferred from the claim text.