公开(公告)号：US20210191961A1

公开(公告)日：2021-06-24

申请号：US17145813

申请日：2021-01-11

Applicant: Beijing Baidu Netcom Science Technology Co., Ltd.

Inventor： Xinwei FENG ,  Zhixing TIAN ,  Songtai DAI ,  Miao YU ,  Huanyu ZHOU ,  Meng TIAN ,  Xueqian WU ,  Xunchao SONG ,  Pengcheng YUAN

IPC: G06F16/33 ,  G06F16/901 ,  G06N3/04

Abstract: The present application discloses a method, an apparatus, a device, and a computer readable storage medium for determining a target content, the method includes: splitting an article paragraph determined according to search information into multiple sentences, and determining a relationship between the sentences according to attributes of the sentences; determining a sentence representation corresponding to each of the sentences according to the relationship between the sentences; and determining a target sentence according to the sentence representation of the sentence and the search information, and determining a target content according to the target sentence, so that the method, the apparatus, the device, and the computer readable storage medium provided by the present disclosure can analyze each of the sentences in combination with the relationship between the sentences, thereby determining a target content that more closely matches the search information.

公开(公告)号：US20230229665A1

公开(公告)日：2023-07-20

申请号：US18182986

申请日：2023-03-13

Applicant: Beijing Baidu Netcom Science Technology Co., Ltd.

Inventor： Yang WANG ,  Xunchao SONG

IPC: G06F16/2458 ,  G06F16/22

CPC classification number: G06F16/2471 ,  G06F16/2228

Abstract: A method of processing an information, an electronic device, and a storage medium are provided, which relate to a field of an artificial intelligence technology, in particular to a field of a knowledge graph technology. An implementation includes: determining a first information, in response to receiving a first query request; querying an information associated with the first information from a current graph database, so as to obtain a first query result; determining at least one federation node, according to at least one of the first query result and the first information; and sending a second query request to the at least one federation node, so that the at least one federation node queries an information associated with a second information in the second query request from a graph database corresponding to the at least one federation node, so as to obtain at least one second query result.