IP Library › Granted Patent US 12,236,361
Granted Patent B2
US 12,236,361 · App. 17/037,612 · Granted Feb 25, 2025

Question analysis method, device, knowledge base question answering system and electronic equipment

Inventors: Wenbin Jiang (Beijing, CN); Huanyu Zhou (Beijing, CN); Meng Tian (Beijing, CN); Ying Li (Beijing, CN); Xinwei Feng (Beijing, CN); Xunchao Song (Beijing, CN); Pengcheng Yuan (Beijing, CN); Yajuan Lyu (Beijing, CN); Yong Zhu (Beijing, CN)
Assignee: Beijing Baidu Netcom Science and Technology Co., Ltd
G06N5/04G06F40/30G06N5/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,236,361
App. No.
17/037,612
Granted
Feb 25, 2025
Kind
B2
Abstract

The present disclosure discloses a question analysis method, a device, a knowledge base question answering system and an electronic equipment. The method includes: analyzing a question to obtain N linearized sequences, N being an integer greater than 1; converting the N linearized sequences into N network topology maps; separately calculating a semantic matching degree of each of the N network topology maps to the question; and selecting a network topology map having a highest semantic matching degree to the question as a query graph of the question from the N network topology maps. According to the technology of the present disclosure, the query graph of the question can be obtained more accurately, and the accuracy of the question to the query graph is improved, thereby improving the accuracy of question analysis.

Claims (42)

1. A question analysis method, comprising:

analyzing a question to obtain N linearized sequences, N being an integer greater than 1;

converting the N linearized sequences into N network topology maps;

separately calculating a semantic matching degree of each of the N network topology maps to the question; and

selecting a network topology map having a highest semantic matching degree to the question as a query graph of the question from the N network topology maps;

wherein the separately calculating the semantic matching degree of each of the N network topology maps to the question comprises:

acquiring a semantic representation vector of the question;

acquiring a semantic representation vector of each of the N network topology maps; and

separately calculating the semantic matching degree of each of the N network topology maps to the question according to the semantic representation vector of the question and the semantic representation vector of each of the N network topology maps;

wherein the method further comprises:

in the acquiring the semantic representation vector of the question and the semantic representation vector of the network topology map, exchanging information between the question and the network topology map based on an attention mechanism, to generate the semantic representation vector of the question and the semantic representation vector of the network topology map.

2. The method of claim 1 , wherein the acquiring the semantic representation vector of the question comprises:

acquiring a semantic representation vector corresponding to a word sequence of the question; or

converting the word sequence of the question into a graph structure, and acquiring a semantic representation vector of the graph structure.

3. The method of claim 2 , wherein the graph structure is a fully connected graph, where any word in the word sequence of the question is regarded as a node, and any two nodes are connected.

4. A question analysis device, comprising:

an analysis module, configured to analyze a question to obtain N linearized sequences, N being an integer greater than 1;

a conversion module, configured to convert the N linearized sequences into N network topology maps;

a calculation module, configured to separately calculate a semantic matching degree of each of the N network topology maps to the question; and

a selection module, configured to select a network topology map having a highest semantic matching degree to the question as a query graph of the question from the N network topology maps;

wherein the calculation module includes:

a first acquisition sub-module configured to acquire the semantic representation vector of the question;

a second acquisition sub-module configured to acquire the semantic representation vector of each of the N network topology maps; and

a calculation sub-module configured to separately calculate a semantic matching degree of each of the N network topology maps to the question according to the semantic representation vector of the question and the semantic representation vector of each of the N network topology maps;

the question analysis device further includes: an interaction module, configured to, in the acquiring the semantic representation vector of the question and the semantic representation vector of the network topology map, exchange information between the question and the network topology map based on an attention mechanism, to generate the semantic representation vector of the question and the semantic representation vector of the network topology map.

5. A question analysis device, comprising:

a translation model, configured to acquire a question and analyze the question to obtain N linearized sequences, N being an integer greater than 1;

a sequence-to-graph conversion model, wherein an input end of the sequence-to-graph conversion model is connected to an output end of the translation model, and the sequence-to-graph conversion model acquires the N linearized sequences and converts the N linearized sequences into N network topology maps respectively;

an encoding network, wherein an input end of the encoding network is connected to an output end of the sequence-to-graph conversion model, and the encoding network acquires the question and the N network topology maps; the encoding network performs a first coding on the question, to obtain a semantic representation vector of the question; and the encoding network also performs a second encoding on each of the N network topology maps, to obtain a semantic representation vector of each of the N network topology maps; and

a matching network, wherein an input end of the matching network is connected to an output end of the encoding network, and the matching network acquires the semantic representation vector of the question and the semantic representation vector of each of the N network topology maps, and calculates a semantic matching degree of each of the N network topology maps to the question according to the semantic representation vector of the question and the semantic representation vector of each of the N network topology maps;

wherein the coding network comprises:

a first encoder acquiring and encoding the question, to obtain the semantic representation vector of the question; and

a second encoder, wherein an input end of the second encoder is connected to an output end of the sequence-to-graph conversion model, and the second encoder acquires the N network topology maps and encodes each of the N network topology maps, to obtain the semantic representation vector of each of the N network topology maps;

wherein both an output end of the first encoder and an output end of the second encoder are connected to the input end of the matching network;

wherein the first encoder is a serialization encoder, and the second encoder is a first graph neural network encoder, or, the first encoder is a second graph neural network encoder, and the second encoder is a third graph neural network encoder; or, the first encoder and the second encoder exchange information based on an attention mechanism.

6. A knowledge base question answering system, wherein the knowledge base question answering system comprises the question analysis device of claim 4 .

7. A knowledge base question answering system, wherein the knowledge base question answering system comprises the question analysis device of claim 5 .

8. An electronic device, comprising:

at least one processor; and

a memory communicatively connected with the at least one processor,

wherein the memory stores an instruction executable by the at least one processor, and the instruction are executed by the at least one processor so that the at least one processor is capable of executing the method of claim 1 .

9. A non-transitory computer-readable storage medium storing computer instruction, wherein the computer instruction is configured to allow the computer execute the method of claim 1 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2020
From: JIANG, WENBIN; ZHOU, HUANYU; TIAN, MENG; LI, YING; FENG, XINWEI; SONG, XUNCHAO; YUAN, PENGCHENG; LYU, YAJUAN; ZHU, YONG
To: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY CO., LTD.
Reel/Frame 053925/0434 →
Priority Claims (1)
CN 202010267909.9 · Apr 8, 2020 · national
Continuity (1)
Related Publication 20210319335A1 · Oct 14, 2021
References Cited (32)
US 20140180999A1 · Chun et al. · 2014 [cited by applicant]
US 20160328467A1 · Zou · 2016 [cited by examiner]
US 20180314729A9 · Reschke · 2018 [cited by examiner]
US 20180373702A1 · Wang et al. · 2018 [cited by applicant]
US 20190279104A1 · Brake et al. · 2019 [cited by applicant]
CN 101201818A · 2008 [cited by applicant]
CN 101655783A · 2010 [cited by applicant]
CN 103885969A · 2014 [cited by applicant]
CN 104657439A · 2015 [cited by applicant]
CN 106815071A · 2017 [cited by applicant]
CN 107038262A · 2017 [cited by applicant]
CN 108491381A · 2018 [cited by applicant]
CN 108804521A · 2018 [cited by applicant]
CN 108804633A · 2018 [cited by applicant]
CN 109033374A · 2018 [cited by applicant]
CN 110188176A · 2019 [cited by applicant]
CN 110457431A · 2019 [cited by applicant]
CN 110555153A · 2019 [cited by applicant]
CN 110704600A · 2020 [cited by applicant]
CN 108399163B · 2021 [cited by examiner]
CN 107885760B · 2021 [cited by applicant]
EP 0525470A2 · 1993 [cited by applicant]
JP 2003533827A · 2003 [cited by applicant]
JP 2013080476A · 2013 [cited by applicant]
Zhao, et al. “Interactive Attention Networks for Semantic Text Matching,” 2020 IEEE ICDM. (Year: 2020). [cited by examiner]
Berant, et al. “Semantic Parsing on Freebase from Question-Answer Pairs,” Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing. (Year: 2013). [cited by examiner]
Japanese Office Action, issued from the Japan Patent Office to JP Application No. 2020-191447 on Dec. 16, 2021, 5 pages. [cited by applicant]
Journal of Beijing University of Technology, Expert System for the Syntax Analysis Of Chinese Based on Man's Cognition Behavior, vol. 29 No. 1, Mar. 2023. [cited by applicant]
China National Intellectual Property Administration, First office action, CN application No. 202010267909.9 on Feb. 9, 2023, 8 pages. [cited by applicant]
Zhao, S., et al., “Interactive Attention for Semantic Text Matching,” Cornell University Library, Nov. 11, 2019, 9 pages. [cited by applicant]
Abolghasemi, A., et al., “Neural Relation Prediction for Simple Question Answering over Knowledge Graph, Cornell University Library,” Feb. 18, 2020, 17 pages. [cited by applicant]
Extended European Search Report issued from the European Patent Office to EP Application No. 20201853.7 on Mar. 31, 2021, 10 pages. [cited by applicant]