- 专利标题: Automated comprehension of natural language via constraint-based processing
-
申请号: US16783952申请日: 2020-02-06
-
公开(公告)号: US11687722B2公开(公告)日: 2023-06-27
- 发明人: Thomas A. Visel
- 申请人: Thomas A. Visel
- 申请人地址: US TX Austin
- 专利权人: Thomas A. Visel
- 当前专利权人: Thomas A. Visel
- 当前专利权人地址: US TX Austin
- 代理商 Brian F. Russell
- 主分类号: G06F40/30
- IPC分类号: G06F40/30 ; G06F40/211 ; G06N20/00
摘要:
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.
公开/授权文献
信息查询