计算机科学
答疑
成对比较
匹配(统计)
情报检索
集合(抽象数据类型)
查询扩展
模棱两可
相关性(法律)
方案(数学)
相似性(几何)
自然语言处理
人工智能
统计
图像(数学)
数学分析
数学
程序设计语言
法学
政治学
作者
Jinlu Zhang,Jiarong He,Yiyi Zhou,Xiaoshuai Sun,Xiao Yu
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2023-01-01
卷期号:11: 77826-77839
标识
DOI:10.1109/access.2023.3296850
摘要
In recent years, Question Answering (QA) systems have gained popularity as a means of acquiring knowledge. However, the prevalent approach of matching question-answer pairs still suffers from low precision and efficiency due to the inherent ambiguity of natural language descriptions. To address these issues, we propose a novel QA approach based on hierarchical semantic matching, termed HSM-QA. Specifically, HSM-QA is decomposed into two main steps, i.e., query-question and query-answer matchings, respectively. For query-question matching, a Siamese network is applied to calculate the similarity between query-question pairs, which recalls the most similar questions and their corresponding answers as candidates. In terms of query-answer matching, we adopt the idea of the pairwise algorithm and propose a single-stream structure to calculate the relevance between query and answer, based on which the best-matching candidates are ranked and returned. After training, these two steps are combined as an efficient QA scheme for different languages, e.g ., English and Chinese. Furthermore, to address the lack of Chinese QA datasets, we collect a massive amount of text data from Chinese social media and generate a new dataset via a pre-trained language model. Extensive experiments are conducted on six QA datasets to validate our HSM-QA. The experimental results demonstrate the superior performance and efficiency of our method than a set of compared methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI