Vol.34, No.3, 2022, pp.2023-2034, doi:10.32604/iasc.2022.029447
OPEN ACCESS
ARTICLE
SSAG-Net: Syntactic and Semantic Attention-Guided Machine Reading Comprehension
  • Chenxi Yu, Xin Li*
Department of Information Technology and Cyber Security People’s Public Security University of China, Beijing, 102623, China
* Corresponding Author: Xin Li. Email:
Received 04 March 2022; Accepted 19 April 2022; Issue published 25 May 2022
Abstract
Machine reading comprehension (MRC) is a task in natural language comprehension. It assesses machine reading comprehension based on text reading and answering questions. Traditional attention methods typically focus on one of syntax or semantics, or integrate syntax and semantics through a manual method, leaving the model unable to fully utilize syntax and semantics for MRC tasks. In order to better understand syntactic and semantic information and improve machine reading comprehension, our study uses syntactic and semantic attention to conduct text modeling for tasks. Based on the BERT model of Transformer encoder, we separate a text into two branches: syntax part and semantics part. In syntactic component, an attention model with explicit syntactic constraints is linked with a self-attention model of context. In semantics component, after the framework semantic parsing, the lexical unit attention model is utilized to process the text in the semantic part. Finally, the vectors of the two branches converge into a new vector. And it can make answer predictions based on different types of data. Thus, a syntactic and semantic attention-guided machine reading comprehension (SSAG-Net) is formed. To test the model’s validity, we ran it through two MRC tasks on SQuAD 2.0 and MCTest, and the SSAG-Net model outperformed the baseline model in both.
Keywords
Machine reading comprehension; syntax dependency; frame semantics
Cite This Article
C. Yu and X. Li, "Ssag-net: syntactic and semantic attention-guided machine reading comprehension," Intelligent Automation & Soft Computing, vol. 34, no.3, pp. 2023–2034, 2022.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.