Automated comprehension of natural language via constraint-based processing
US9984067B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 1, 2015 |
| Grant date | May 29, 2018 |
| Priority date | — |
| Expiry date | Jun 15, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F40/30
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.