US 11,868,716 B2
Knowledge base question answering
Srinivas Ravishankar, White Plains, NY (US); Pavan Kapanipathi Bangalore, White Plains, NY (US); Ibrahim Abdelaziz, Tarrytown, NY (US); Nandana Mihindukulasooriya, Cambridge, MA (US); Dinesh Garg, Beawar (IN); Salim Roukos, Redondo Beach, CA (US); and Alexander Gray, Yonkers, NY (US)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Aug. 31, 2021, as Appl. No. 17/462,327.
Prior Publication US 2023/0060589 A1, Mar. 2, 2023
Int. Cl. G06F 40/20 (2020.01); G06F 16/2452 (2019.01); G06N 3/08 (2023.01); G06F 16/901 (2019.01); G06N 3/042 (2023.01)
CPC G06F 40/20 (2020.01) [G06F 16/24522 (2019.01); G06F 16/9024 (2019.01); G06N 3/042 (2023.01); G06N 3/08 (2013.01)] 20 Claims
OG exemplary drawing
 
15. A computer system comprising:
one or more computer processors;
one or more computer readable storage media; and
program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the stored program instructions comprising:
program instructions to parse a received natural language question into an abstract meaning representation (AMR) graph;
program instructions to enrich the AMR graph into an extended AMR graph;
program instructions to transform the extended AMR graph into a query graph utilizing a path-based approach, wherein the query graph is a directed edge-labeled graph; and
program instructions to generate one or more answers to the received natural language question through one or more queries created utilizing the query graph.