CPC G06N 5/04 (2013.01) [G06F 40/30 (2020.01); G06N 5/02 (2013.01)] | 9 Claims |
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.
|