Research Article  Open Access
Deguang Chen, Ziping Ma, Lin Wei, Jinlin Ma, Yanbin Zhu, "MTQA: TextBased Multitype Question and Answer Reading Comprehension Model", Computational Intelligence and Neuroscience, vol. 2021, Article ID 8810366, 12 pages, 2021. https://doi.org/10.1155/2021/8810366
MTQA: TextBased Multitype Question and Answer Reading Comprehension Model
Abstract
Textbased multitype question answering is one of the research hotspots in the field of reading comprehension models. Multitype reading comprehension models have the characteristics of shorter time to propose, complex components of relevant corpus, and greater difficulty in model construction. There are relatively few research works in this field. Therefore, it is urgent to improve the model performance. In this paper, a textbased multitype question and answer reading comprehension model (MTQA) is proposed. The model is based on a multilayer transformer encoding and decoding structure. In the decoding structure, the headers of the answer type prediction decoding, fragment decoding, arithmetic decoding, counting decoding, and negation are added for the characteristics of multiple types of corpora. Meanwhile, highperformance ELECTRA checkpoints are employed, and secondary pretraining based on these checkpoints and an absolute loss function are designed to improve the model performance. The experimental results show that the performance of the proposed model on the DROP and QUOREF corpora is better than the best results of the current existing models, which proves that the proposed MTQA model has high feature extraction and relatively strong generalization capabilities.
1. Introduction
With the further research in natural language processing (NLP), lots of advancements have been achieved in many tasks, including the sentiment analysis [1–5], machine translation [6–8], intelligent question answering [9–11], and so on. As an important component of NLP, the function of reading comprehension covers collection information, knowledge storage, logical reasoning, and even a wellintegrated subjective answering strategy. Therefore, the development of reading comprehension will give an enormous impetus in promoting the development of NLP and its commercial application. The accuracy of current deep learning models based on a singlemode reading comprehension corpus has reached or surpassed the average level of humans on corpora such as TriviaQA [12], SQuAD [13, 14], SearchQA [15], NarrativeQA [16], and CNN/DailMail [17] corpora. In order to promote the continuous development and progress in this field, researchers are devoted to proposing new corpora with wider coverage and more difficult questions and answers to meet research and development needs of researchers. In 2019, Dua [18] et al. completed a new corpus called QUOREF, which contains 10% multisegment corpus and expands the complexity of the corpus to a certain extent compared with singlesegment question and answer. In the meantime, Dua et al. proposed the discrete reasoning over the content of paragraph corpus (DROP) [19], which is more difficult and complex to obtain accurate answer and has a wider range of fragment types such as numeric, date, and segment types (singlefragment and multifragment). Hence, it is more challenging to test and evaluate the performance of algorithms on DROP.
The corpus of DROP was proposed in order to promote the development in the NLP field of reading comprehension. However, a limited number of related and published articles implement experiments on the DROP corpus. Accordingly, a few related models have been presented in this field. The wellknown models include NAQANet [19], NumNet [20], MTMSN [21], TbMS [22], and GENBERT [23]. However, in terms of their current performance, the F1 value of these models’ performance is all about 80, which is much lower than that of the human level. Therefore, further research on this corpus is very challenging and necessary.
In this paper, a multitype question and answer reading comprehension model (MTQA) is proposed based on previous work on the DROP corpus. In general, in this paper, multilayer transformer is employed as the basic encoding and decoding structure. In addition, drawing on the multihead mechanism in MTMSN, the answer type prediction, segment, arithmetic operation, counter, and negation headers are added to the decoder. In order to improve the efficiency of cluster search algorithm in MTMSN, an absolute loss function is proposed in our model. Moreover, we modified the multilayer transformer model to adapt to the latest ELECTRA (efficiently learning an encoder that classifies token replacements accurately) model checkpoint. At the same time, inspired by GENBERT and Gururangan [24], part of the pseudocorpus is generated and combined with the existing corpora for the secondary pretraining of the model. In general, the contributions of this paper can be listed as follows:(1)An innovative model (MTQA) is proposed. At the same time, the MTQA model is convenient and efficient in tasks from pretraining to downstream, which effectively combines strong supervised learning and weakly supervised learning. As a result, the performance of the MTQA model has been significantly improved than that of singlesupervised model. It exceeds the highest performance of the existing model by 4.5+% on the DROP corpus.(2)This paper transferred the idea of generative adversarial networks (GANs), which have been used in the image field, into the MTQA model. The proposed MTQA model draws on the idea of GAN, applies GAN to natural language processing, and shares the ELECTRA checkpoints, which can avoid largescale pretraining of the corpus.(3)This paper evaluated that MTAQ model has higher accuracy. Moreover, experimental results on the QUOREF corpus show that our model also achieved the highest accuracy, which proves that MTQA has a relatively strong generalization ability.
2. Related Work
The main work of this paper is implemented on the DROP corpus. According to different classification standards, the models involved in the DROP corpus can be divided into different categories. From the perspective of the label design, due to the complexity of the DROP corpus, the processed labels are not unique, so most models adopted weakly supervised learning methods. On the other hand, from the perspective of the model design, the current stage is mainly divided into two categories: arithmetic operation on external methods and arithmetic operations on the model itself, which is entrusting the arithmetic operations involved in the DROP corpus to external methods, and inferring the arithmetic operations based on the model’s own capabilities. In the following sections, we describe these two methods.
2.1. Arithmetic Operations on External Methods
NAQANet is the first model designed for the DROP corpus. It includes four decoding heads to process the corpus: the paragraph fragment header, question fragment header, counting header, and arithmetic operation header. Among them, fragment headers (paragraph fragments and question fragments) are used to process single and multiple fragments in the DROP corpus, as well as part of the date type question and answer. On the other hand, the count and arithmetic operation headers are used to process the arithmetic operations in the DROP corpus and the arithmetic operations involving question and answer in the data type. In the NABERT + model, the encoding method in NAQANet is mainly substituted for the BERT method. At the same time, standard numbers and template operation are added to the arithmetic operation head, thus further improving the accuracy of the model. MTMSN has made the following improvements based on NABERT+. Firstly, an answer type header is added to predict the type of the answer. Secondly, under the condition of counting a large number of corpora, it is found that many situations are negative, so a negative header is added to deal with numerical calculation problems. Thirdly, a cluster search algorithm is added to the model to process the answers to the fragments. Through the three aforementioned improvements, the model performance has been greatly improved. TbMS improves the limited effect of multisegment processing in the previous model and has achieved better results on multisegment corpus, with an overall effect similar to that of the MTMSN. Similar model structures include TASE [26] model, etc.
2.2. Arithmetic Operations on the Model Itself
Yu et al. used models such as QANet + ELMo [27] and BERT [28] to train DROP corpus. However, the effect of their models was not very satisfactory. Currently, the GENBERT model is the first and only model that uses the internal parameters of the model to train on DROP corpus with ideal results. In addition, in this model, BERT’s codec structure is employed to process the DROP corpus, while a segment decoding header is added to the decoder structure to process the segment corpus that appears in DROP. However, experimental results verified that the accuracy of such a model on DROP corpus is much lower. Therefore, in order to improve the accuracy, the model redesigned the pretraining checkpoint of BERT for a secondary pretraining. Firstly, a large number of pseudonatural language corpora are generated for digital and text computing, and then BERT’s masked language model (MLM) mechanism is combined to obtain its checkpoints for the secondary pretraining. Secondly, the DROP corpus is sent to the model with the secondary checkpoints for the downstream fitting training. The experimental results show that the performance of the model is equivalent to that of the MTMSN base downstream task. The main innovations and optimal results of the models are shown in Table 1.

The arithmetic operation of DROP is externally performed, which reduces the internal pressure of the model and improves its accuracy to a certain extent. However, the internal parameters of the model may result in overfitting, i.e., the model itself is not sufficiently trained and not convenient for model expansion. The arithmetic operation of DROP relies on the model itself to calculate and is not good at dealing with numerical reasoning problems, which leads to a much low performance of the model, while the model is more flexible. In this paper, we propose the MTQA model to achieve better generalization ability and higher performance.
3. MTQA Model
3.1. Problem Description
Given a questionandanswer pair of text (corresponding words in and are marked as and respectively, where i, j are the subscripts of the corresponding order words), reason about the text based on the proposed question and get the answer , i.e., . The inference process involves adding and subtracting the numbers in the text, finding the maximum and minimum values, counting, selecting, and comparing. The flowchart of our model proposed in this paper is shown in Figure 1.
Firstly, we pretrain the model of MTQA. In the pretraining process, initial pretraining and secondary pretraining are involved. The pretrained results are saved as checkpoints for downstream tasks. Secondly, in the downstream tasks, the corpus and corresponding pretraining checkpoints are added to the model for fitting training, and thus the final results are obtained.
3.2. Pretraining
3.2.1. First Pretraining
ELECTRA has designed a pretraining mechanism, which is structured like a GAN, as shown in Figure 2. Under the condition of relatively fewer parameters and corpora, the performance of ELECTRA surpasses that of BERT. Generally speaking, the main contribution of ELECTRA is to propose a new pretraining mechanism, i.e., to change the BERT’s MLM to a discriminative replacement detection mechanism (replaced token detection, RTD).
Specifically, an MLM generator is used to transform the input sentence, by covering some words, and then throw them to the discriminator, which can determine whether the words have been changed. In order to overcome the problem of gradient fragmentation caused by words discretization, the generator and discriminator are simultaneously trained. But the discriminator gradient is not passed to the generator. Furthermore, their joint loss function is minimized, and the formula is as follows:where is the loss function of the generator, indicates the loss function of the discriminator, means the optimization objective, and represents all text corpora. Since the task of the discriminator is relatively easy, the RTD loss is much smaller than that of MLM; hence, a larger coefficient λ is added to the discriminator. The pretraining checkpoint in this paper originates from ELECTRA since the ELECTRA model has certain advantages over the BERT pretraining model. More methods related to ELECTRA can be found in [29].
3.2.2. Secondary Pretraining
Due to a wide range of sources of pretraining corpus of the ELECTRA, it has generality but not pertinence. It was inspired by the conclusion, proposed by Gururangan [24], that we can get a better effect if we can get more taskrelated data and continue pretraining. In addition, ELECTRA pretraining relatively lacks for the numerical reasoning and continuous word fragments of the DROP corpus, which can affect the model performance in the downstream fitting training to a certain extent. At the same time, the checkpoint of the ELECTRA pretraining model is slightly smaller than that of BERT under the same circumstances. Hence, in order to achieve a fair comparison and a higher accuracy of our model, we propose to carry out the secondary pretraining for the number type and the continuous word segment type in the DROP corpus.
We mainly utilize a new mixture corpus of programgenerated pseudonatural language corpus and a small amount of corpora produced artificially for the secondary pretraining as a result of the limited human and financial resources. The process of the secondary pretraining is as follows.
Firstly, we design programs to create a numerical corpus (numerical data, ND), produced by 6 standard templates, and a textual corpus (textual data, TD), produced by numbers (NUM), entities (ENT), containers (CONT), and attributes (ATTR). The ND and TD corpora are used to solve the numerical reasoning problems. For a detailed production process of ND and TD, refer to [23].
Secondly, in order to overcome the lack of a continuous word segment corpus (spans data), we make a new corpus by adopting the existing SQuAD, QUOREF, and part of multisegment corpus made by ourselves manually. This new corpus is mainly to extract the task of questions and answering. Then, features extracted from the three types of corpora are made into a suitable form for the model and saved as pkl files format for subsequent reading. Finally, the corresponding pkl files are sent into the network for secondary pretraining (the network structure is described later). In view of the characteristics of our model, we mainly use weakly supervised learning to improve correctness of decision making to the most extent.
Furthermore, three types of corpora are trained simultaneously, and three sets values of EM and F1 will be produced in this process. These three sets of F1 values are averaged. If the average value is greater than the current best F1 value (the initial F1 value is 0), the checkpoint is saved; otherwise, the current checkpoint is discarded and we proceed to the next round of pretraining.
3.3. Model Structure
3.3.1. Basic Codec Structure
In the upstream task, ELECTRA is employed, so the encoding structure of our model adopts the corresponding structure based on ELECTRA which is essentially an improvement on the pretraining model of BERT even if their encoding structures are very similar.
(1) Basic Encoding Structure. Firstly, the words in each question and answer corpus are segmented according to the vocabulary and divided into corresponding subwords. Secondly, the words are embedded (subwords, positions, and labels are correspondingly added), and then the processed sentences are sent to the model’s multilayer transformer encoder for feature extraction (assuming that there is an Llayer transformer). Finally, the last four features (HL − 3, HL − 2, HL − 1, HL) of the Transformer encoding are retained, and after transformation, they are recorded as (FI0, FI1, FI2, FI3) to prepare for decoding.
(2) Basic Encoding and Decoding Structure. Based on the transformer encoder, an Llayer transformer decoder is added to construct the basic decoding structure of the model.
In order to make the weight of ELECTRA, which is used to initialize the encoder, applicable for decode, we combine the weights of the encoder and decoder so that the weight of ELECTRA is completely used to initialize the model. Meanwhile, we add an H_{enc} layer above the encoding layer to transform the context semantics, such that they can learn different representations. The basic encoder and decoder structure is shown in Figure 3, and the formula form is as follows:where W is the weight matrix, gule denotes the activation function, and layernorm is the layer regularization operation. In the same way, we use the same method to process the decoded answer H_{dec} and obtain the decoded answer FO; the formula is as follows:
3.3.2. Additional Decoding Structure
Our model refers to MTMSN. One head is the answer type prediction header, used to predict the type of the answer (addition and subtraction, text segment, question segment, count or negative). The second one is the segment header, used to process extractive answer segments. The remaining three heads are used to process numeric operations: an arithmetic head, a counting head, and a negation head. The fivehead mechanism is briefly introduced as follows.
(1) Answer Type Prediction Head. For the sake of predicting the output type of the answer, FI_{2} is divided into the question feature Q_{2} and text segment feature P_{2} at the corresponding position where [SEP] first appears; the form is shown in Figure 4. Then, the problem feature vector and the text segment feature vector are calculated as follows:where W^{Q} and W^{P} are parameter matrices. By using and , different prediction types can be calculated by the following formula:where is the vector corresponding to CLS in FI_{2}, which contains the semantic information of the entire question and answer pair, FFN represents a feedforward neural network with twolayer linear mapping using the GELU activation function, and is the type of the predicted answer.
(2) Segment Prediction Head. To extract the answer segment from the text corpus or question corpus, it is necessary to find the start and end position marks of the answer in the input “[CLS] question sequence [SEP] text sequence [SEP].” In order to reflect the difference between the start position and the end position, different vector representations are used, respectively, and the corresponding formulas are as follows:where , , and are similar to the calculation method. After that, we can calculate the start and end vectors in the problem; the corresponding formula iswhere represents the outer product of the vectors and FI. The vectors and are the probability of each subword as the starting position and ending position in the question, respectively. In the same way, the calculation in the text is performed.
(3) Arithmetic Expression Header. In order to perform arithmetic operations, all the numbers in the question and the text are extracted and recorded as , where M is the largest subscript of the number. Each number may be added, subtracted, or set to zero. The probability that the i^{th} subscript is recorded as addition, subtraction, or zero can be calculated as follows:
The corresponding symbolization processing is performed on the corresponding position of the number of (i.e., the corresponding position is added, subtracted, or set to zero), and the result of the i^{th} digital position can be obtained. Adding all the digital positions together can achieve the final result of the arithmetic expression.
(4) Counting Head. Considering the actual counting ability, the calculation range set in this paper is set from 0 to 9. Firstly, a standard vector is created by the following formula:where is the onehot code from 0 to 9 and the number of counts can be calculated as follows:
(5) Negation Head. As one of the characteristics of the corpus, many data items appear in the negative form. Therefore, negation head is set. The negative form is to use 100 minus the current number to obtain the current position number. N in this header is the same as N in the arithmetic header, and its negation probability formula is as follows:
3.4. Loss Function
3.4.1. Weak Supervision Loss Function
Six decoding headers are involved in this work, among which the answer type, segment prediction, arithmetic expression, counting, and negation headers are all trained in a weakly supervised way. Taking an arithmetic expression as an example, assuming there are n candidate answers as , the logarithm of the softmax of the candidate answer x can be calculated according to following formula:where is the loss function of the arithmetic expression. In a similar way, the corresponding loss functions of the other four headers: , , , and , can be obtained. Then, these five sets of loss functions can be added to obtain the weakly supervised loss function , as in the following formula:
Since these loss functions drop quickly, it is easy to cause the gradient to disappear and diffuse; we utilize the logsumexp function for processing, according to the following formulas:where is the loss rate of the i^{th} corpus in a batch. In this way, the weakly supervised loss function can be obtained.
3.4.2. Basic Decoding Loss Function
The basic decoding head adopts strong supervised learning to adjust the internal parameters of the model. Since the answer types include numbers, the composition of the numbers is variable, which is impossible to be listed in the vocabulary. To obtain better fitting the answer, we segment the number type labels, for example: 12345 is divided into 1, ##2, ##3, ##4, ##5. Then, the loss rate is calculated according to the crossentropy, and the corresponding formula is as follows:where is the i^{th} label of the real answer labels and is the i^{th} number of the predicted answer labels. The function of the basic decoding is to add a strong supervised learning mechanism to assist the weakly supervised learning.
3.5. Absolute Loss Function
Due to digital labels of the weakly supervised learning in the process, the labels themselves are partially incorrect, which results in incorrect training, thereby affecting the overall performance of the model. To overcome this problem, in MTMSN, a cluster search algorithm is used for auxiliary training and prediction [21]. More concretely, the most likely first three answers are selected as the correct answer during training. However, in recurring experiments, we found that the accuracy of the model during the training process cannot be effectively improved by the cluster search algorithm, since it still uses weakly supervised learning. For this reason, we add an absolute loss function in the training process of the cluster search. The added absolute loss function uses strong supervision learning, thus improving the performance of the model to a certain extent.
Specially, the steps are as follows. Firstly, a complete answer and answer type are extracted from the triples (i.e., text, question, answer) as the standard answer. Secondly, for answers with a number or date type, predictions are made after training. According to the characteristics of the model, the predicted answers form a vector group. Then, the cluster search algorithm is employed to search the most likely answer vector as the predicted answer. Finally, compared with the predicted answer and the answer type, respectively, the real answer and the answer type are defined and calculated by the formulas as follows:where P represents the predicted answer and T denotes the real one. Furthermore, calculated by this strong supervision method is
At this point, we have all the loss functions: , and , and the total loss function loss can be expressed as
On account of a certain degree of difference between the loss function numbers calculated by different methods, the two parameters of are set to balance and eliminate the difference.
4. Experiment
This section introduces the corresponding experimental design and results, aiming to prove that the proposed model of MTQA can achieve high accuracy and has a certain scalability.
4.1. Experimental Platform and Environment
All the experiments in this work are carried out on two platforms. One is a Win10 platform with 2 Intel (R) Xeon (R) Gold 6154 processors, 256GB memory, 2 Nvidia TITAN V graphics cards, Python version 3.6.8, and torch version 1.1.0. The system mainly performs base and related basic tasks. The other platform is a CentOS 7.5.1804 platform with Intel (R) Xeon (R) Gold 6140, 360GB memory, 2 Tesla V100 graphics cards, Python version 3.6.8, and torch version 1.4.0. The large and related basic tasks are mainly completed on this system.
4.2. Introduction to Corpora
The corpora used in this work are DROP and QUOREF. The DROP corpus is constructed by more than 96,000 questionanswer (QA) pairs from more than 6,700 text fragments from Wikipedia. It is divided into three sets: training, development, and test. The training set contains about 77,000 QA pairs, and the development and test sets contain approximately 9,500 QA pairs each. Each text fragment contains about 200 words, and each question contains about 11 words. The corpus includes addition and subtraction, comparison, selection, counting, multiple fragments, etc. The QUOREF corpus constructs over 24,000 QA pairs from more than 4,700 text fragments from Wikipedia. It is divided into three sets: training, development, and test. The training set contains about 19,000 questions, and the development and test sets contain about 2,500 questions each. Each text fragment contains about 384 words, and each question contains about 17 words. This corpus contains singlesegment and multisegment QAs, of which multisegment QAs account for about 10% of the total number of QAs. Table 2 shows the relevant statistics of the two corpora.

4.3. Secondary Pretraining
This section describes the secondary pretraining performed on the ELECTRA checkpoint on the ND, TD, and SD corpora. The purpose of the secondary pretraining is to make the pretraining targeted so as to better fit the downstream tasks. We perform secondary pretraining at the base and large checkpoints of ELECTRA, respectively. Similar to the two trends, we choose large checkpoint to give explanation.
Firstly, we developed a largescale corresponding corpus. For the ND corpus, 510,000 pieces of corpus (500,000 training and 10,000 test) are programgenerated. For the TD corpus, 110,000 corresponding text fragments are programgenerated, and each text fragment contains 3 to 8 QAs of the corpus, which produces about 550,000 training corpus pieces and 55,000 test corpus pieces. The SD corpus includes 330,000 (300,000 training and 30,000 test) from SQuAD, QUOREF, and our handmade multisegment corpus. Figure 5 shows the corpus styles of ND, TD, and SD, and Table 3 shows the situation of each corpus.
(a)
(b)
(c)

Experiment 1. Secondary pretraining. In order to verify the precision of secondary pretraining, secondary pretraining is performed based on the large checkpoints. The batch size of ND, TD, and SD is set to 12, and the learning rate is set to 2e − 6. The corresponding F1 and EM values are recorded from step 4000, once every 2000 steps. The F1 and EM values of the three corpora are shown in Figure 5.
From Figure 6, the following can be observed. (1) After the curves tend to be stable, the accuracies of ND and TD of the F1 and EM values in Figures 6(a) and 6(b) reach up to more than 97%, which indicates that the programgenerated pseudocorpus is relatively simple and the training is easier. (2) Compared with ND and TD in Figures 6(a) and 6(b), the accuracy of SD is relatively lower (F1 accuracy is only about 80% and EM value is only about 65%), demonstrating that the artificially constructed corpus has a certain degree of difficulty and is more challenging to be trained than the pseudocorpus. (3) The difference of SD curves between F1 and EM is about 15%, whereas those of ND and TD are relatively smaller, which may be due to a large number of multisegment corpus pieces in SD, indicating that the training on the SD corpus is more difficult from a side view.
(a)
(b)
4.4. Model Building
This section mainly focuses on describing the key steps in the construction and validating the efficiency of the proposed model through horizontal and vertical comparison. In addition, we compare our model, i.e., MTQA, with the existing models to verify its effectiveness.
Experiment 2. Model building experiment. Firstly, we use the ELECTRA checkpoint to verify its validity by replacing BERT pretraining checkpoint of the MTMSN with the ELECTRA checkpoint, modifying the corresponding code to make it effective and recording it as MTMSN_{Electra}. Then, we carry out the corresponding experiments on the base and large checkpoints. Secondly, we add the five decoding heads of MTMSN to the basic decoding structure of multilayer transformer. Meanwhile, the absolute loss function is added. And the model is marked as MTQA, which performs related experiments on the model at the BERT and ELECTRA checkpoints, respectively, marking as MTQA_{Bert} and MTQA_{Electra}, respectively. Thirdly, the ELECTRA checkpoint is pretrained for the second time, and then the secondary pretraining checkpoint is put into MTQA for corresponding training and test, i.e., recorded as MTQA_{pre_Electra}. Each model is run 10 batches, and the corresponding results are shown in Table 4.
The following conclusions can be drawn from Table 4. (1) On the pretraining model, the batch size and learning rate fluctuate to a certain extent because we choose batch quantity and learning rate with the highest precision, so setting them within the appropriate range will have a certain impact on the accuracy. (2) Throughout the first and second rows in base or large, the ELECTRA checkpoint is indeed more effective than the BERT checkpoint. (3) The results at the first and third rows in base or large show that the MTQA model is more effective than the MTMSN model. (4) The results at the second, third, and fourth rows in base or large verify that the ELECTRA checkpoint and MTQA represent a mutually reinforcing process. (5) The results at the fourth and fifth rows of base or large demonstrate that purposefully secondary pretraining can effectively improve the performance of the model, thereby improving the recognition performance accuracy (since the corpora used in the secondary pretraining is relatively small, we imagine that with the corpora increasing, it is very likely that the performance of the model can continue to improve). (6) Under the same model conditions of base and large, adding a new module will increase the accuracy. Especially the accuracy of base is significantly greater than that of large, which is due to the low relative accuracy of the base corpus. Moreover, when the new module is added, the feature extraction ability is correspondingly strengthened.
After the model is successfully constructed, we further validate by comparing our model with other existing models horizontally. The results are shown in Table 5.
In Table 5, it is demonstrated clearly that our model (MTQA) can achieve higher accuracy than the compared models based on either base or large, while MTMSN and TbMS can achieve higher accuracy. On the base pretraining models, our model exceeds the MTMSN model EM value by 7.50 percentage points and the F1 value by 7.18 percentage points. On the large pretraining models, our model exceeds the TbMS model EM value by 4.34 percentage points and the MTMSN model F1 value by 4.72 percentage points. In short, compared with MTMSN, TbMS, and other models, our model has obvious advantages, which proves its effectiveness, whereas there is still a certain gap compared with human level.


4.5. Decoding Head Performance and Model Generalization Capabilities
In this section, we design the third decoding head performance experiment, i.e., in each subexperiment, we remove a decoding head to observe the performance of the model, aiming to explore how much influence each decoding method has on the performance of our model, which can make it convenient for subsequent optimization of our model.
From Experiment 2 above, it can be seen that accuracy variation degree of pre_Electra_Base is greater than pre_Electra_Large. Although different secondary pretraining models will have different accuracies, owing to decoding head comparative experiments, they will have the same trends of the accuracy changes. In consideration of computing power, related decoding head comparative experiments are conducted only on pre_Electra_Base.
Experiment 3. Decoding head comparative experiments are conducted when the batch size is set to 8, the learning rate is 3e − 5, and 10 batches of training are performed. The experimental results are shown in Table 6.
The following aspects can be observed from Table 6. (1) The five types of decoding headers (segment, arithmetic operation, counting, negation, and basic decoding headers) have a positive influence on the model. (2) The fragment and arithmetic operation headers have greater impact degree on our model. The possible reasons could be the following two points: these headers are more capable of extraction features compared with other headers and their corpora occupy a larger proportion in the DROP corpus. (3) The poor performance of the basic decoding head in this experiment may be caused by the negative impact of the other four heads and the absolute loss function of the model. (4) The learning rate is in accordance with the batch size, which may result in a slight unfairness to the contrast head, because the learning rate of each head may be slightly different.
Generally, a multihead mechanism may result in the generalization ability of the model being not strong enough. For this purpose, we select the QUOREF corpus to conduct related experiments to verify strong generalization ability of our model. QUOREF corpus has stronger diversity, which can be more difficult to be trained compared with SQuAD and can be evaluated by stable performance metric of our model.

Experiment 4. QUOREF experiment. Since the SD corpus in the secondary pretraining contains SQuAD, QUOREF, and other corpora, it is unfair and reasonable to choose the pre_Electra_Base or pre_Electra_Large pretraining model only for the QUOREF corpus experiment. Thus, we only directly use MTQA_{Electra_Base} and MTQA_{Electra_Large} without pretraining for the corresponding experiments. In practical terms, we set the fragment header and the basic decoding header to be true, the other headers are set to be false (because they are not used), the batch size is set to 10, and we perform the relevant experiments. The experimental results are shown in Table 7.
The following aspects can be noticed from Table 7. (1) BERT QA and XLNet QA are the base experiments of the QUOREF corpus. Their EM and F1 values are 64.52% and 71.49%, respectively. TASE_{IO} has the highest performance among existing works on the QUOREF corpus. (2) Our model achieved an EM value of 72.56 and an F1 value of 78.23 on the basis of Electra_base pretraining respectively, which indicates the performance of our model on the base exceeded that on the QUOREF corpus. (3) Our model achieved an EM value of 81.34% based on the Electra_Large pretraining and the F1 value of 86.84%, which surpasses the TASE_{IO}’s EM value by 1.94% and F1 value by 1.94%, achieving the best value of the current QUOREF corpus. In a word, it is verified that our model has strong generalization ability and superior performance.
5. Conclusion
In this article, we proposed the model MTQA and evaluated it by performing corresponding experiments on multiple pretraining checkpoints of BERT and ELECTRA. Moreover, we mixed some pseudocorpus and real corpus based on the ELECTRA checkpoint for secondary pretraining of our own checkpoint. The DROP and QUOREF corpora are used for the experiments. Compared with the existing models, the proposed model can achieve higher accuracy while also having stronger generalization ability. In addition, the accuracy of the DROP and QUOREF corpora is improved to a certain extent, which remains to be further improved in the textbased multitype question and answer reading comprehension model.
However, there is still a big gap between the performance of our model and the average level of human beings. In the next stage of work, we will proceed to merge the decoding head and improve the internal computer system of the transformer to reduce the amount of model parameters while improving the performance.
Data Availability
The data used to support the findings of this study have been deposited in https://s3uswest2.amazonaws.com/allennlp/datasets/drop/drop_dataset.zip and https://allennlp.org/quoref.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This study was supported by the National Natural Science Foundation of China (grant nos. 61462002, 61762003, and 61862001), Major Projects of Educational and Teaching Reform in North Minzu University (no. 2018ZHJY01), Innovation Team of “Computer Vision and Virtual Reality” of North Minzu University, and Major Projects of North Minzu University (no. ZDZX201801).
References
 W. Xue and T. Li, “Aspect based sentiment analysis with gated convolutional networks,” in Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, Melbourne, Australia, July 2018. View at: Google Scholar
 M. Hu and B. Liu, “Mining and summarizing customer reviews,” in Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining—KDD‘04, pp. 168–177, Seattle, WA, USA, August 2004. View at: Publisher Site  Google Scholar
 M. H. Phan and P. O. Ogunbona, “Modelling context and syntactical features for aspectbased sentiment analysis,” Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, SIG Publisher, New York, NY, USA, 2020. View at: Publisher Site  Google Scholar
 Z. Gao, A. Feng, X. Song, and X. Wu, “Targetdependent sentiment classification with BERT,” IEEE Access, vol. 7, pp. 154290–154299, 2019. View at: Publisher Site  Google Scholar
 Z. Liu, C. Lu, H. Huang, S. Lyu, and Z. Tao, “Hierarchical multigranularity attention based hybrid neural network for text classification,” IEEE Access, vol. 8, pp. 149362–149371, 2020. View at: Publisher Site  Google Scholar
 N. Mathur, T. Baldwin, and T. Cohn, “Tangled up in BLEU: reevaluating the evaluation of automatic machine translation evaluation metrics,” in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, SIG Publisher, New York, NY, USA, 2020. View at: Google Scholar
 S. Ren, Y. Wu, S. Liu, M. Zhou, and S. Ma, “A retrieveandrewrite initialization method for unsupervised machine translation,” Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, SIG Publisher, New York, NY, USA, 2020. View at: Publisher Site  Google Scholar
 X. Niu, P. Mathur, G. Dinu, and Y. A. Onaizan, “Evaluating robustness to input perturbations for neural machine translation,” 2020, https://arxiv.org/abs/2005.00580. View at: Google Scholar
 A. Saxena, A. Tripathi, and P. Talukdar, “Improving multihop question answering over knowledge graphs using knowledge base embeddings,” Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, SIG Publisher, New York, NY, USA, 2020. View at: Publisher Site  Google Scholar
 B. Zheng, H. Wen, Y. Liang et al., “Document modeling with graph attention networks for multigrained machine reading comprehension,” 2020, https://arxiv.org/abs/2005.05806. View at: Google Scholar
 M. Jayaratne and B. Jayatilleke, “Predicting personality using answers to openended interview questions,” IEEE Access, vol. 8, pp. 115345–115355, 2020. View at: Publisher Site  Google Scholar
 M. Joshi, E. Choi, D. S. Weld, and L. Zettlemoyer, “TriviaQA: a large scale distantly supervised challenge dataset for reading comprehension,” in association for computational linguistics (acl) vancouver, Canada,” 2017, https://arxiv.org/abs/1705.03551. View at: Google Scholar
 P. Rajpurkar, J. Zhang, K. Lopyrev, and P. Liang, “SQuAD: 100,000+ questions for machine comprehension of text,” in Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing 2016, Austin, TX, USA, November 2016. View at: Google Scholar
 P. Rajpurkar, R. Jia, and P. Liang, “Know what you don't know: unanswerable questions for SQuAD,” Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, vol. 2, pp. 784–789, 2018. View at: Publisher Site  Google Scholar
 M. Dunn, L. Sagun, M. Higgins et al., “A new Q&A dataset augmented with context from a search engine,” 2017, https://arxiv.org/abs/1704.05179. View at: Google Scholar
 T. Kočiský, J. Schwarz, P. Blunsom et al., “The NarrativeQA reading comprehension challenge,” Transactions of the Association for Computational Linguistics, vol. 6, pp. 317–328, 2018. View at: Publisher Site  Google Scholar
 K. M. Hermann, T. Kočiský, E. Grefenstette et al., “Teaching machines to read and comprehend,” 2015, https://arxiv.org/abs/1506.03340. View at: Google Scholar
 D. Dua, Y. Wang, P. Dasigi, G. Stanovsky, S. Singh, and M. Gardner, “Quoref: a reading comprehension dataset with questions requiring coreferential reasoning,” in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLPIJCNLP), Hong Kong, China, December 2019. View at: Publisher Site  Google Scholar
 The Association for Computational Linguistics, “DROP: A reading comprehension benchmark requiring Discrete reasoning over paragraphs,” in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics, pp. 2368–2378, Minneapolis, MN, USA, 2019. View at: Publisher Site  Google Scholar
 Q. Ran, Y. Lin, P. Li, J. Zhou, and Z. Liu, “NumNet: machine reading comprehension with numerical reasoning,” 2019, https://arxiv.org/abs/1910.06701. View at: Google Scholar
 M. Hu, Y. Peng, Z. Huang, and D. Li, “A multitype multispan network for reading comprehension that requires discrete reasoning,” 2019, https://arxiv.org/abs/1908.05514. View at: Google Scholar
 A. Efrat, E. Segal, and M. Shoham, “Tagbased multispan extraction in reading comprehension,” 2019, https://arxiv.org/abs/1909.13375. View at: Google Scholar
 M. Geva, A. Gupta, and J. Berant, “Injecting numerical reasoning skills into language models,” 2020, https://arxiv.org/abs/2004.04487. View at: Google Scholar
 S. Gururangan, A. Marasović, S. Swayamdipta et al., “Don’t stop pretraining: adapt language models to domains and tasks,” in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, SIG Publisher, New York, NY, USA, 2020. View at: Google Scholar
 I. J. Goodfellow, J. P. Abadie, M. Mirza et al., “Generative adversarial nets,” in Proceedings of the Advances in Neural Information Processing Systems, pp. 2672–2680, London, UK, 2014. View at: Google Scholar
 E. Segal, A. Efrat, M. Shoham, A. Globerson, and J. Berant, “A simple and effective model for answering multispan questions,” 2019, https://arxiv.org/abs/1909.13375. View at: Google Scholar
 A. W. Yu, D. Dohan, M. T. Luong et al., “Fast and accurate reading comprehension by combining selfattention and convolution,” in Proceedings of the 12th International Conference on Artificial Neural Networks, 2018. View at: Google Scholar
 J. Devlin, M. W. Chang, K. Lee, and K. Toutanova, “BERT: pretraining of deep bidirectional transformers for language understanding,” 2018, https://arxiv.org/abs/1810.04805. View at: Google Scholar
 K. Clark, M. T. Luong, Q. V. Le, and C. D. Manning, “ELECTRA: Pretraining text encoders as discriminators rather than generators,” in Proceedings of the International Conference on Learning Representations, Scottsdale, AZ, USA, May 2020. View at: Google Scholar
 A. W. Yu, D. Dohan, M. T. Luong et al., “QANet: combining local convolution with global selfattention for reading comprehension,” in Proceedings of the International Conference on Learning Representations, Vancouver, Canada, May 2018. View at: Google Scholar
 D. Ye, Y. Lin, J. Du, Z. Liu, M. Sun, and Z. Liu, “Coreferential reasoning learning for language representation,” 2020, https://arxiv.org/abs/2004.%2006870. View at: Google Scholar
Copyright
Copyright © 2021 Deguang Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.