US 11,727,059 B2
Retrieval sentence utilization device and retrieval sentence utilization method
Jun Nishioka, Tokyo (JP); Yoshiaki Sakae, Tokyo (JP); Kazuhiko Isoyama, Tokyo (JP); Etsuko Ichihara, Tokyo (JP); and Kosuke Yoshida, Tokyo (JP)
Assigned to NEC CORPORATION, Tokyo (JP)
Appl. No. 16/980,234
Filed by NEC Corporation, Tokyo (JP)
PCT Filed Mar. 14, 2018, PCT No. PCT/JP2018/009960
§ 371(c)(1), (2) Date Sep. 11, 2020,
PCT Pub. No. WO2019/176011, PCT Pub. Date Sep. 19, 2019.
Prior Publication US 2021/0342396 A1, Nov. 4, 2021
Int. Cl. G06F 16/901 (2019.01); G06F 16/31 (2019.01); G06F 16/33 (2019.01); G06F 16/28 (2019.01); G06F 3/04842 (2022.01)
CPC G06F 16/9024 (2019.01) [G06F 3/04842 (2013.01); G06F 16/288 (2019.01); G06F 16/322 (2019.01); G06F 16/3334 (2019.01)] 14 Claims
OG exemplary drawing
 
1. A retrieval sentence utilization device comprising:
a memory storing instructions; and
one or more processors configured to execute the instructions to:
divide a retrieval sentence into a plurality of retrieval contents each of which includes an event; and
generate, from respective retrieval contents, subtrees each of which includes an edge as the event and includes nodes as a source of the event and an object of the event, and integrate the subtrees into a directed graph,
wherein when generating the subtrees, the one or more processors place the subtrees in the directed graph according to occurrence order of events corresponding to the subtrees,
wherein the one or more processors are further configured to execute the instructions to:
unify a plurality of directed graphs;
segment each of the plurality of directed graphs into subtrees;
compare events corresponding to subtrees obtained by segmenting one of the plurality of directed graphs and events corresponding to subtrees obtained by segmenting an other one of the plurality of directed graphs; and
generate a new directed graph by integrating at least common subtrees in corresponding event.