| { |
| "paper_id": "2021", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T15:35:43.022691Z" |
| }, |
| "title": "QMUL-SDS at SCIVER: Step-by-Step Binary Classification for Scientific Claim Verification", |
| "authors": [ |
| { |
| "first": "Xia", |
| "middle": [], |
| "last": "Zeng", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Queen Mary University of London", |
| "location": {} |
| }, |
| "email": "x.zeng@qmul.ac.uk" |
| }, |
| { |
| "first": "Arkaitz", |
| "middle": [], |
| "last": "Zubiaga", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Queen Mary University of London", |
| "location": {} |
| }, |
| "email": "a.zubiaga@qmul.ac.uk" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Scientific claim verification is a unique challenge that is attracting increasing interest. The SCIVER shared task offers a benchmark scenario to test and compare claim verification approaches by participating teams and consists in three steps: relevant abstract selection, rationale selection and label prediction. In this paper, we present team QMUL-SDS's participation in the shared task. We propose an approach that performs scientific claim verification by doing binary classifications stepby-step. We trained a BioBERT-large classifier to select abstracts based on pairwise relevance assessments for each <claim, title of the abstract> and continued to train it to select rationales out of each retrieved abstract based on <claim, sentence>. We then propose a two-step setting for label prediction, i.e. first predicting \"NOT_ENOUGH_INFO\" or \"ENOUGH_INFO\", then label those marked as \"ENOUGH_INFO\" as either \"SUPPORT\" or \"CONTRADICT\". Compared to the baseline system, we achieve substantial improvements on the dev set. As a result, our team is the No. 4 team on the leaderboard.", |
| "pdf_parse": { |
| "paper_id": "2021", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Scientific claim verification is a unique challenge that is attracting increasing interest. The SCIVER shared task offers a benchmark scenario to test and compare claim verification approaches by participating teams and consists in three steps: relevant abstract selection, rationale selection and label prediction. In this paper, we present team QMUL-SDS's participation in the shared task. We propose an approach that performs scientific claim verification by doing binary classifications stepby-step. We trained a BioBERT-large classifier to select abstracts based on pairwise relevance assessments for each <claim, title of the abstract> and continued to train it to select rationales out of each retrieved abstract based on <claim, sentence>. We then propose a two-step setting for label prediction, i.e. first predicting \"NOT_ENOUGH_INFO\" or \"ENOUGH_INFO\", then label those marked as \"ENOUGH_INFO\" as either \"SUPPORT\" or \"CONTRADICT\". Compared to the baseline system, we achieve substantial improvements on the dev set. As a result, our team is the No. 4 team on the leaderboard.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "As online content continues to grow at an unprecedented rate, the spread of false information online increases the potential of misleading people and causing harm. Where the volume of information shared online is difficult to be managed by human fact-checkers, this leads to an increasing demand on automated fact-checking, which is formulated by researchers as 'the assignment of a truth value to a claim made in a particular context' (Vlachos and Riedel, 2014) .", |
| "cite_spans": [ |
| { |
| "start": 436, |
| "end": 462, |
| "text": "(Vlachos and Riedel, 2014)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Though a body of research focuses on conducting fact-checking in the politics domain, scientific claim verification has also gained increasing interest in the context of the ongoing COVID-19 pandemic. The SCIVER shared task provides a Overview of our step-by-step binary classification system. N EI stands for \"NOT_ENOUGH_INFO\", C stands for \"CON-TRADICT\" and S stands for \"SUPPORT\". Given claim c, our system first retrieves top K TF-IDF similarity abstracts out of the corpus, then uses a BioBERT binary classifier to further identify desired abstracts on top of that. With retrieved abstracts, our system then uses another BioBERT binary classifier to select rationales. We finally do label prediction in a two-step fashion, i.e. first make verdicts on \"ENOUGH_INFO\" or not and, if positive, then make verdicts on \"SUPPORT\" or not. valuable benchmark to build and evaluate systems performing scientific claim verification. Given a scientific claim and a corpus of over 5000 abstracts, the task consists in (i) identifying abstracts relevant to the claim, (ii) delving into the abstracts to select evidence sentences relevant to the claim, and (iii) subsequently predicting claim veracity.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "This paper presents and analyses team QMUL-SDS's participation in the SCIVER shared task. In particular, we explore creative approaches of solving the challenge with limited resources. Figure 1 provides an overview of our system. While many other systems make use of external datasets, e.g. FEVER (Thorne et al., 2018) , our system focuses on efficient use of the SCIFACT dataset (Wadden et al., 2020) . Furthermore, in the interest of keeping the efficiency of our system, we limit our model choices to the size of RoBERTa-large (Liu et al., 2019) , ruling out for example GPT-3 (Brown et al., 2020) and T5 (Raffel et al., 2020) , which were used in other participating systems. More specifically, our system mainly uses RoBERTa (Liu et al., 2019) and BioBERT . The latter is pretrained on biomedical text and therefore is very close to our target domain. With improved pipeline design, our system shows competitive performance with limited computing resources, achieving the 6th position in the task and ranked 4th when distinct teams are considered. 1", |
| "cite_spans": [ |
| { |
| "start": 297, |
| "end": 318, |
| "text": "(Thorne et al., 2018)", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 380, |
| "end": 401, |
| "text": "(Wadden et al., 2020)", |
| "ref_id": null |
| }, |
| { |
| "start": 530, |
| "end": 548, |
| "text": "(Liu et al., 2019)", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 574, |
| "end": 600, |
| "text": "GPT-3 (Brown et al., 2020)", |
| "ref_id": null |
| }, |
| { |
| "start": 608, |
| "end": 629, |
| "text": "(Raffel et al., 2020)", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 730, |
| "end": 748, |
| "text": "(Liu et al., 2019)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 185, |
| "end": 193, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Several approaches have been proposed to perform scientific claim verification in the three-step settings proposed in SCIVER.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Upon publication of the SCIFACT dataset (Wadden et al., 2020), the authors introduced VERISCI as a baseline system. It is a pipeline with three modules: abstract retrieval, rationale selection and label prediction. The abstract retrieval module returns the top K highest-ranked abstracts determined by the TF-IDF similarity between each abstract and the claim at hand. The rationale selection module trains a RoBERTa-large model to compute relevance scores with a sigmoid function and then selects sentences whose relevance scores are higher than the threshold T . The label prediction module trains a RoBERTa-large model to do three-way classification regarding sentence-pairs, where the candidate labels are \"SUPPORT\", \"CONTRADICT\" and \"NOT_ENOUGH_INFO\". Empirically the system set the K value to 3 and the T value to 0.5. Due to its inspiring design, reasonable performance and good efficiency, in this paper we take VERISCI system as our baseline.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "2" |
| }, |
| { |
| "text": "After the publication of the SCIFACT dataset, 1 Code is available here.", |
| "cite_spans": [ |
| { |
| "start": 46, |
| "end": 47, |
| "text": "1", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "2" |
| }, |
| { |
| "text": "several approaches have been published, some of which chose to participate in the SCIVER shared task. We next discuss the top 3 ranked entries. The VERT5ERINI system (Pradeep et al., 2020) ranked 1st on the leaderboard. This system first retrieves a shortlist of top 20 abstracts by using the BM25 ranking score (Robertson et al., 1994) , which is then fed into a T5 model to rerank and retrieve the top 3 abstracts; it then trains a T5 model to calculate relevance scores for each sentence, on which a threshold of 0.999 is applied to select rationales; it finally trains a T5 model to do three-way classification for predicting labels. This system has demonstrated the performance advantages of using T5, a model that is substantially bigger than other language models. The ParagraphJoint system (Li et al., 2021 ) ranked 2nd on the leaderboard. It first uses BioSentVec to retrieve the top K abstracts and then jointly trains a RoBERTalarge model to do rationale selection and label prediction in a multi-task learning setting. The system is first trained on the FEVER dataset and then trained on SCIFACT dataset. Its application of multi-task learning techniques proved to be very successful and inspires further research in this direction.", |
| "cite_spans": [ |
| { |
| "start": 166, |
| "end": 188, |
| "text": "(Pradeep et al., 2020)", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 312, |
| "end": 336, |
| "text": "(Robertson et al., 1994)", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 798, |
| "end": 814, |
| "text": "(Li et al., 2021", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The team who ranked 3rd on the leaderboard, Law & Econ (Stammbach and Ash) , fine-tuned their e-FEVER system on SCIFACT dataset, which requires usage of GPT-3 and training on FEVER dataset. Despite the big difference on model sizes, our system achieves close performance to the e-FEVER system on the leaderboard.", |
| "cite_spans": [ |
| { |
| "start": 55, |
| "end": 74, |
| "text": "(Stammbach and Ash)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related Work", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Following the convention of automated factchecking systems (Thorne et al., 2018) and the VERISCI baseline system, we explore novel ways of tackling the challenge by handling the three subtasks: abstract retrieval, rationale selection and label prediction.", |
| "cite_spans": [ |
| { |
| "start": 59, |
| "end": 80, |
| "text": "(Thorne et al., 2018)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Approach", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Abstract retrieval is the task of retrieving relevant abstracts that can support the prediction of a claim's veracity. Inspired by the baseline system, which retrieves the top K (K = 3) abstracts with the highest TF-IDF similarity to the claim, initially we attempted a similar method with a state-of-the-art similarity metric, i.e., BERTscore (Zhang et al., 2020) . It computes token similarity using BERTbased contextual embeddings. However, the results we achieved were not satisfactory 2 and was ruled out in subsequent experiments.", |
| "cite_spans": [ |
| { |
| "start": 334, |
| "end": 364, |
| "text": "BERTscore (Zhang et al., 2020)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract Retrieval", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Instead of completely relying on available metrics, we investigated performing abstract retrieval in a supervised manner. In contrast to previous work (Pradeep et al., 2020) which performed reranking, we formulate it as a binary classification problem. We first empirically limit the corpus to the top 30 abstracts with highest TF-IDF similarity to the claim. We fine-tuned a BioBERT model with a linear classification head, which we name as the BioBERT classifier thereafter, to do binary classification on the top 30 TF-IDF abstracts, i.e. predicting whether the abstract at hand is correctly identified for the claim at hand given the pairwise input <claim c, title t of the abstract>. Due to the input length limits of BERT models, we only use the title of the abstract at this stage, assuming that the title represents a good summary of the abstract.", |
| "cite_spans": [ |
| { |
| "start": 151, |
| "end": 173, |
| "text": "(Pradeep et al., 2020)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract Retrieval", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Rationale Selection is the task of selecting rationale sentences out of the retrieved abstracts. To avoid manually tuning the threshold on various settings like the baseline system, we address the problem as a binary classification task in a very similar manner to the last step. We continued training the BioBERT classifier inherited from the abstract retrieval step to do rationale selection, i.e. making binary predictions on whether the sentence at hand is correctly identified for the claim at hand given sentence pair <claim c, sentence s>. As our classifier model only outputs binary predictions with its linear head on individual sentence pair cases, there is no need to apply various ranking thresholds. Aiming to achieve better overall pipeline performance, our models are trained on abstracts retrieved in the first step, rather than oracle abstracts.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Rationale Selection", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Label prediction is the task of predicting the veracity label given the target claim and rationale sentences selected in the preceding step of the pipeline. A good selection of relevant abstracts and rationales therefore is vital in the capacity of the veracity label prediction system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Label Prediction", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "The baseline system we initially implemented 2 See detailed results in appendix A trained a RoBERTa-large model to do three-way classification into one of \"NOT_ENOUGH_INFO\", \"SUPPORT\" and \"CONTRADICT\". We observed that, while the model was in general fairly accurate, it performed poorly in predicting the \"CONTRA-DICT\" class due to the scarcity of training data pertaining to this class. However, it is known that claims belonging to the \"CONTRADICT\" class are particularly difficult to collect, and that automated fact-checking datasets tend to create them synthetically by manually mutating naturally occurring claims originally pertaining to the \"SUP-PORT\" class (Thorne et al., 2018; Wadden et al., 2020; Sathe et al., 2020) . With the aim of improving model performance on this class without using extra data, we try to decrease wrong predictions accumulated by wrong predictions on the other labels. For instance, the model may predict a claim to be \"NOT_ENOUGH_INFO\" while it should be \"CONTRADICT\", which makes it a false positive for the \"NOT_ENOUGH_INFO\" class and a true negative for the \"CONTRADICT\" class. If the model has better performance on the \"NOT_ENOUGH_INFO\" predictions, it would in turn help the performance on the \"CONTRADICT\" class. Hence, we explore label prediction within a two-step setting. First, we merge claims from the \"SUPPORT\" and \"CONTRADICT\" classes as \"ENOUGH_INFO\". With this altered dataset, we train a RoBERTa-large model as a neutral detector to do binary classification into \"ENOUGH_INFO\" or \"NOT_ENOUGH_INFO\". Second, we merge data from \"NOT_ENOUGH_INFO\" and \"CON-TRADICT\" to be \"NOT_SUPPORT\" and train another RoBERTa-large model as a support detector to do binary classification on \"SUPPORT\" or \"NOT_SUPPORT\". Finally, when doing predictions, we first use the neutral detector to predict \"ENOUGH_INFO\" or \"NOT_ENOUGH_INFO\" and only if the first prediction is \"ENOUGH_INFO\" we use the support detector to predict \"SUPPORT\" or \"NOT_SUPPORT\". We take \"NOT_SUPPORT\" instances as equivalent to \"CONTRADICT\" instances in the three-way classification.", |
| "cite_spans": [ |
| { |
| "start": 667, |
| "end": 688, |
| "text": "(Thorne et al., 2018;", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 689, |
| "end": 709, |
| "text": "Wadden et al., 2020;", |
| "ref_id": null |
| }, |
| { |
| "start": 710, |
| "end": 729, |
| "text": "Sathe et al., 2020)", |
| "ref_id": "BIBREF9" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Label Prediction", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "We perform various experiments on the SCIFACT dataset to identify the best models and techniques to be submitted to the task. Unless explicitly specified, models are trained on the SCIFACT's train set and evaluated on the SCIFACT's dev set.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Results", |
| "sec_num": "4" |
| }, |
| { |
| "text": "We limit the candidate abstracts to the top 30 with the highest TF-IDF similarity scores, as this setting achieves a high recall of 91.39%. With our binary classification method, we experimented with BioBERT models that are pre-trained on close domain texts . To explore the potentials of adapting pre-trained language models to the current settings, we also conducted task adaptive pre-training (Gururangan et al., 2020) on the SCI-FACT corpus with BioBERT-base for 50 epochs with batch size 1, which leads to a final perplexity of 2.68. This parameter choice is made primarily based on our limited time and computational resources for the SCIVER shared task participation. Further extensive exploration may lead to interesting results. This model is denoted as BioBERTbase*. Table 1 reports performance of the baseline, BioBERT-base, BioBERT-base* and BioBERTlarge models on abstract retrieval. The baseline directly retrieves the top 3 abstracts with highest TF-IDF similarity, which is also the method used in the VERISCI system (Wadden et al., 2020). We also report abstract level pipeline performance with baseline rationale selector and baseline label predictor to demonstrate its substantial impact on pipeline performance.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 777, |
| "end": 784, |
| "text": "Table 1", |
| "ref_id": "TABREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Abstract Retrieval", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "Our method achieves noticeable improvements over the baseline by largely decreasing the false positive rate. More specifically, BioBERT-base has the highest precision score, BioBERT-base* has highest F1 score and BioBERT-large has the highest recall score. With increased model size, BioBERT-large has gained significant improvements on recall but suffers with a precision drop compared to BioBERT-base and BioBERT-base*, which may suggest model underfitting. Overall our approach leads to an approximate 10% increase over the baseline approach on abstract level downstream performance.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract Retrieval", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "In order to improve the overall design of the system, we trained our rationale selection models with abstracts retrieved by our abstract retrieval module rather than oracle abstracts. We use abstracts retrieved by BioBERT-large due to its highest recall score. In this step, we experiment with our binary classification approach to identify rationale sentences from retrieved abstracts for the claim at hand. Given a sentence-pair <claim c, sentence s>, the model, which was trained to do abstract selection in last step, is now trained to predict whether the sentence at hand is correctly identified for the claim at hand. Table 2 reports results of the baseline, BioBERTbase, BioBERT-base* and BioBERT-large models on rationale selection. We also present sentence level pipeline performance with oracle cited abstracts 3 and baseline label predictor.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 624, |
| "end": 631, |
| "text": "Table 2", |
| "ref_id": "TABREF3" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Rationale Selection", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Our method leads to an increase in precision score, a small decrease in recall score and a small increase in F1 score. Interestingly, the three BioBERT variants don't show clear performance differences, despite substantial differences in model sizes. A small improvement on downstream sentence-level performance is achieved overall.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Rationale Selection", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "For label prediction, we use the two-step approach that leverages RoBERTa-large as described in \u00a73.3. This approach is denoted as TWO-STEP thereafter. cle rationales. The baseline is the RoBERTa-large three-way classifier used on VERISCI. Our TWO-STEP method leads to a 4% increase in accuracy, macro-F1 and weighted-F1 over the baseline. We further present confusion matrices for each system for analysis, where C stands for \"CONTRA-DICT\", N stands for \"NOT_ENOUGH_INFO\" and S stands for \"SUPPORT\". As the confusion matrix shows, our method successfully improves the overall predictions on the \"CONTRADICT\" class without leveraging extra data. Furthermore, Table 4 reports results on the abstract-level label prediction with various settings of upstream modules. Interestingly, both methods show noticeably decreased performance when given an evidence of lower quality. From the oracle evidence to the evidence retrieved by our system, the baseline module's F1 performance dropped by 19.70% and the TWO-STEP module dropped by 20.26% in absolute values; from the oracle evidence to the evidence retrieved by the baseline system, the baseline module's F1 score dropped by 30.14% and the TWO-STEP module dropped by 37.26% in absolute values.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 658, |
| "end": 665, |
| "text": "Table 4", |
| "ref_id": "TABREF6" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Label Prediction", |
| "sec_num": "4.3" |
| }, |
| { |
| "text": "Despite that, our TWO-STEP method always outperforms the baseline method when given improved evidence. Its F1 score is 2.02% -2.58% higher than the baseline on improved evidence retrieval settings. When given oracle cited abstracts and oracle rationales, our method achieves 84.78% F1 score. Table 5 reports full pipeline performance on the SCIFACT dev set. The baseline is the VERISCI system. We compare pipeline systems with different evidence retrieval models, i.e., BioBERT-base, BioBERT-base* and BioBERT-large, combined with the two-step label predictor using RoBERTalarge.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 292, |
| "end": 299, |
| "text": "Table 5", |
| "ref_id": "TABREF8" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Label Prediction", |
| "sec_num": "4.3" |
| }, |
| { |
| "text": "Overall our system achieves substantial improvements over the baseline. Across the evaluation metrics, our precision scores are 15.75%-23.37% higher than the baseline system, recall scores are 3.82%-14.21% higher and F1 scores are 10.11%-16.08% higher than the baseline in terms of absolute values. Interestingly, BioBERT-base obtains the highest precision score, BioBERT-base* the highest recall score and BioBERT-large the highest F1 for most of metrics. Table 6 compares full pipeline performance on SCIFACT test set with models trained on the combination of SCIFACT train set and dev set. We used BioBERT-large evidence selector and two-step label predictor as our system due to its overall best performance. This submission ranked No. 6 on the leaderboard.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 457, |
| "end": 464, |
| "text": "Table 6", |
| "ref_id": "TABREF10" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Full Pipeline", |
| "sec_num": "4.4" |
| }, |
| { |
| "text": "Our intuitive step-by-step binary classification system achieves substantial improvements over the baseline without demanding additional data or extra large models.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion and Future Work", |
| "sec_num": "5" |
| }, |
| { |
| "text": "An improved evidence retrieval module has made the main contributions to the performance boost. Our system makes an effort to improve the abstract retrieval module after applying a scalable traditional information retrieval weighting scheme, TF-IDF. Instead of handling it as a re-ranking task and manually selecting thresholds (Pradeep et al., 2020) , we formulate it as a binary classification task, which makes better use of the available training data and decreases the false positive rate effectively. When applying a similar approach to ratio- nale selection, our model, which is only trained on the SCIFACT dataset, still achieves improvements over the baseline model, which makes use of the FEVER dataset first. Furthermore, our model is less dependent on parameters than other systems, which is ideal in practical settings where one would like to apply the model on new datasets without having to find the best parameters for the dataset at hand. In addition, our TWO-STEP label prediction module also makes positive contributions to overall improvements. The difference on the label prediction performance is very noticeable on different upstream settings. Unsurprisingly, both methods have the best performance with F1 scores higher than 80% on the oracle setting, which is the closest to their training data. Interestingly, this performance fluctuation leads to the following observation: a label prediction module that has better performance on the oracle evidence doesn't necessarily have better performance when given the incorrect evidence. Regarding our TWO-STEP label prediction method, it shows that our neutral detector is not robust enough on the pipeline setting. One possible solution is to train it on evidence retrieved by previous modules rather than on the oracle evidence so that it learns to optimise for the pipeline setting.", |
| "cite_spans": [ |
| { |
| "start": 328, |
| "end": 350, |
| "text": "(Pradeep et al., 2020)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion and Future Work", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Nevertheless, this problem is inevitable for a pipeline system that has multiple machine learning modules, as errors in each of the modules will accumulate throughout the pipeline. A better system design is desired such that it tackles the challenge in a more systematic way. A promising approach is to train a model to learn three subtasks in a multitask learning manner so that it may optimise for better overall performance.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion and Future Work", |
| "sec_num": "5" |
| }, |
| { |
| "text": "In this paper, we proposed a novel step-by-step binary classification approach for the SCIVER shared task. Our submission achieved an F1 score of 55.35% on the test set, ranking 6th among all the submissions and 4th among all the teams. We show that (1) concerning evidence retrieval, a classification based approach is better than a ranking based approach with manual thresholds; (2) two-step binary label prediction has better performance than three-way label prediction with limited training data;", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusions", |
| "sec_num": "6" |
| }, |
| { |
| "text": "(3) a more systematic design of automated fact-checking system is desired. Table 7 reports performance of using BERTscore as a metric to do abstract retrieval. We chose Dis-tilBERT as the BERT model for global ranking for efficiency reasons, which was ran on a simgle GPU for approximately 36 hours and it turned out to be worse than TF-IDF.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 75, |
| "end": 82, |
| "text": "Table 7", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Conclusions", |
| "sec_num": "6" |
| }, |
| { |
| "text": "We then tried various relevant BERT variants to do reranking out of the top 30 abstracts with the highest TF-IDF similarity. In general, with reasonable large models that are trained on relevant tasks, results are better than TOP 3 TF-IDF. However, the improvements remain trivial and it is not comparable to our classification approach. Table 7 : BERTscore abstract retrieval performance on the dev set of SCIFACT.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 338, |
| "end": 345, |
| "text": "Table 7", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "A Appendix", |
| "sec_num": null |
| }, |
| { |
| "text": "It includes abstracts that are of \"SUPPORT\", \"CON-TRADICT\" and \"NOT_ENOUGH_INFO\" relations to the claims' veracity. It is also referred as oracle abstracts with NOT_ENOUGH_INFO (NEI) setting in SCIFACT dataset paper.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "This work was supported by the Engineering and Physical Sciences Research Council (grant EP/V048597/1). Xia Zeng is funded by China Scholarship Council (CSC). This research utilised Queen Mary's Apocrita HPC facility, supported by QMUL Research-IT. http://doi.org/10. 5281/zenodo.438045", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgements", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Ilya Sutskever, and Dario Amodei. 2020. Language Models are Few-Shot Learners", |
| "authors": [ |
| { |
| "first": "Tom", |
| "middle": [ |
| "B" |
| ], |
| "last": "Brown", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Mann", |
| "suffix": "" |
| }, |
| { |
| "first": "Nick", |
| "middle": [], |
| "last": "Ryder", |
| "suffix": "" |
| }, |
| { |
| "first": "Melanie", |
| "middle": [], |
| "last": "Subbiah", |
| "suffix": "" |
| }, |
| { |
| "first": "Jared", |
| "middle": [], |
| "last": "Kaplan", |
| "suffix": "" |
| }, |
| { |
| "first": "Prafulla", |
| "middle": [], |
| "last": "Dhariwal", |
| "suffix": "" |
| }, |
| { |
| "first": "Arvind", |
| "middle": [], |
| "last": "Neelakantan", |
| "suffix": "" |
| }, |
| { |
| "first": "Pranav", |
| "middle": [], |
| "last": "Shyam", |
| "suffix": "" |
| }, |
| { |
| "first": "Girish", |
| "middle": [], |
| "last": "Sastry", |
| "suffix": "" |
| }, |
| { |
| "first": "Amanda", |
| "middle": [], |
| "last": "Askell", |
| "suffix": "" |
| }, |
| { |
| "first": "Sandhini", |
| "middle": [], |
| "last": "Agarwal", |
| "suffix": "" |
| }, |
| { |
| "first": "Ariel", |
| "middle": [], |
| "last": "Herbert-Voss", |
| "suffix": "" |
| }, |
| { |
| "first": "Gretchen", |
| "middle": [], |
| "last": "Krueger", |
| "suffix": "" |
| }, |
| { |
| "first": "Tom", |
| "middle": [], |
| "last": "Henighan", |
| "suffix": "" |
| }, |
| { |
| "first": "Rewon", |
| "middle": [], |
| "last": "Child", |
| "suffix": "" |
| }, |
| { |
| "first": "Aditya", |
| "middle": [], |
| "last": "Ramesh", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [ |
| "M" |
| ], |
| "last": "Ziegler", |
| "suffix": "" |
| }, |
| { |
| "first": "Jeffrey", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Clemens", |
| "middle": [], |
| "last": "Winter", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher", |
| "middle": [], |
| "last": "Hesse", |
| "suffix": "" |
| }, |
| { |
| "first": "Mark", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Eric", |
| "middle": [], |
| "last": "Sigler", |
| "suffix": "" |
| }, |
| { |
| "first": "Mateusz", |
| "middle": [], |
| "last": "Litwin", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:2005.14165[cs].ArXiv:2005.14165" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Ben- jamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford, Ilya Sutskever, and Dario Amodei. 2020. Language Models are Few- Shot Learners. arXiv:2005.14165 [cs]. ArXiv: 2005.14165.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "BioSentVec: creating sentence embeddings for biomedical texts", |
| "authors": [ |
| { |
| "first": "Qingyu", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Yifan", |
| "middle": [], |
| "last": "Peng", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhiyong", |
| "middle": [], |
| "last": "Lu", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "IEEE International Conference on Healthcare Informatics (ICHI)", |
| "volume": "", |
| "issue": "", |
| "pages": "1--5", |
| "other_ids": { |
| "DOI": [ |
| "10.1109/ICHI.2019.8904728" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Qingyu Chen, Yifan Peng, and Zhiyong Lu. 2019. BioSentVec: creating sentence embeddings for biomedical texts. 2019 IEEE International Confer- ence on Healthcare Informatics (ICHI), pages 1-5. ArXiv: 1810.09302.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "2020. Don't Stop Pretraining: Adapt Language Models to Domains and Tasks", |
| "authors": [ |
| { |
| "first": "Ana", |
| "middle": [], |
| "last": "Suchin Gururangan", |
| "suffix": "" |
| }, |
| { |
| "first": "Swabha", |
| "middle": [], |
| "last": "Marasovi\u0107", |
| "suffix": "" |
| }, |
| { |
| "first": "Kyle", |
| "middle": [], |
| "last": "Swayamdipta", |
| "suffix": "" |
| }, |
| { |
| "first": "Iz", |
| "middle": [], |
| "last": "Lo", |
| "suffix": "" |
| }, |
| { |
| "first": "Doug", |
| "middle": [], |
| "last": "Beltagy", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah", |
| "middle": [ |
| "A" |
| ], |
| "last": "Downey", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:2004.10964[cs].ArXiv:2004.10964" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Suchin Gururangan, Ana Marasovi\u0107, Swabha Swayamdipta, Kyle Lo, Iz Beltagy, Doug Downey, and Noah A. Smith. 2020. Don't Stop Pretraining: Adapt Language Models to Domains and Tasks. arXiv:2004.10964 [cs]. ArXiv: 2004.10964.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "BioBERT: a pretrained biomedical language representation model for biomedical text mining", |
| "authors": [ |
| { |
| "first": "Jinhyuk", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Wonjin", |
| "middle": [], |
| "last": "Yoon", |
| "suffix": "" |
| }, |
| { |
| "first": "Sungdong", |
| "middle": [], |
| "last": "Kim", |
| "suffix": "" |
| }, |
| { |
| "first": "Donghyeon", |
| "middle": [], |
| "last": "Kim", |
| "suffix": "" |
| }, |
| { |
| "first": "Sunkyu", |
| "middle": [], |
| "last": "Kim", |
| "suffix": "" |
| }, |
| { |
| "first": "Chan", |
| "middle": [], |
| "last": "Ho So", |
| "suffix": "" |
| }, |
| { |
| "first": "Jaewoo", |
| "middle": [], |
| "last": "Kang", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Bioinformatics", |
| "volume": "36", |
| "issue": "4", |
| "pages": "1234--1240", |
| "other_ids": { |
| "DOI": [ |
| "10.1093/bioinformatics/btz682" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jinhyuk Lee, Wonjin Yoon, Sungdong Kim, Donghyeon Kim, Sunkyu Kim, Chan Ho So, and Jaewoo Kang. 2020. BioBERT: a pre- trained biomedical language representation model for biomedical text mining. Bioinformatics, 36(4):1234-1240. Publisher: Oxford Academic.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Gully Burns, and Nanyun Peng. 2021. A Paragraph-level Multi-task Learning Model for Scientific Fact-Verification", |
| "authors": [ |
| { |
| "first": "Xiangci", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:2012.14500" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Xiangci Li, Gully Burns, and Nanyun Peng. 2021. A Paragraph-level Multi-task Learning Model for Scientific Fact-Verification. arXiv:2012.14500 [cs].", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "RoBERTa: A Robustly Optimized BERT Pretraining Approach", |
| "authors": [ |
| { |
| "first": "Yinhan", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Myle", |
| "middle": [], |
| "last": "Ott", |
| "suffix": "" |
| }, |
| { |
| "first": "Naman", |
| "middle": [], |
| "last": "Goyal", |
| "suffix": "" |
| }, |
| { |
| "first": "Jingfei", |
| "middle": [], |
| "last": "Du", |
| "suffix": "" |
| }, |
| { |
| "first": "Mandar", |
| "middle": [], |
| "last": "Joshi", |
| "suffix": "" |
| }, |
| { |
| "first": "Danqi", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Omer", |
| "middle": [], |
| "last": "Levy", |
| "suffix": "" |
| }, |
| { |
| "first": "Mike", |
| "middle": [], |
| "last": "Lewis", |
| "suffix": "" |
| }, |
| { |
| "first": "Luke", |
| "middle": [], |
| "last": "Zettlemoyer", |
| "suffix": "" |
| }, |
| { |
| "first": "Veselin", |
| "middle": [], |
| "last": "Stoyanov", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1907.11692[cs].ArXiv:1907.11692" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Man- dar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. RoBERTa: A Robustly Optimized BERT Pretrain- ing Approach. arXiv:1907.11692 [cs]. ArXiv: 1907.11692.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Scientific Claim Verification with VERT5ERINI", |
| "authors": [ |
| { |
| "first": "Ronak", |
| "middle": [], |
| "last": "Pradeep", |
| "suffix": "" |
| }, |
| { |
| "first": "Xueguang", |
| "middle": [], |
| "last": "Ma", |
| "suffix": "" |
| }, |
| { |
| "first": "Rodrigo", |
| "middle": [], |
| "last": "Nogueira", |
| "suffix": "" |
| }, |
| { |
| "first": "Jimmy", |
| "middle": [], |
| "last": "Lin", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:2010.11930[cs].ArXiv:2010.11930" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ronak Pradeep, Xueguang Ma, Rodrigo Nogueira, and Jimmy Lin. 2020. Scientific Claim Verification with VERT5ERINI. arXiv:2010.11930 [cs]. ArXiv: 2010.11930.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer", |
| "authors": [ |
| { |
| "first": "Colin", |
| "middle": [], |
| "last": "Raffel", |
| "suffix": "" |
| }, |
| { |
| "first": "Noam", |
| "middle": [], |
| "last": "Shazeer", |
| "suffix": "" |
| }, |
| { |
| "first": "Adam", |
| "middle": [], |
| "last": "Roberts", |
| "suffix": "" |
| }, |
| { |
| "first": "Katherine", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Sharan", |
| "middle": [], |
| "last": "Narang", |
| "suffix": "" |
| }, |
| { |
| "first": "Michael", |
| "middle": [], |
| "last": "Matena", |
| "suffix": "" |
| }, |
| { |
| "first": "Yanqi", |
| "middle": [], |
| "last": "Zhou", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Peter", |
| "middle": [ |
| "J" |
| ], |
| "last": "Liu", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1910.10683" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J. Liu. 2020. Exploring the Lim- its of Transfer Learning with a Unified Text-to-Text Transformer. arXiv:1910.10683 [cs, stat]. ArXiv: 1910.10683 version: 3.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Okapi at TREC-3", |
| "authors": [ |
| { |
| "first": "Stephen", |
| "middle": [ |
| "E" |
| ], |
| "last": "Robertson", |
| "suffix": "" |
| }, |
| { |
| "first": "Steve", |
| "middle": [], |
| "last": "Walker", |
| "suffix": "" |
| }, |
| { |
| "first": "Susan", |
| "middle": [], |
| "last": "Jones", |
| "suffix": "" |
| }, |
| { |
| "first": "Micheline", |
| "middle": [], |
| "last": "Hancock-Beaulieu", |
| "suffix": "" |
| }, |
| { |
| "first": "Mike", |
| "middle": [], |
| "last": "Gatford", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "Proceedings of the third text REtrieval conference", |
| "volume": "500", |
| "issue": "", |
| "pages": "109--126", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford. 1994. Okapi at TREC-3. In Proceedings of the third text REtrieval conference, volume 500-225 of NIST special publication, pages 109-126. National Insti- tute of Standards and Technology (NIST).", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Automated Fact-Checking of Claims from Wikipedia", |
| "authors": [ |
| { |
| "first": "Aalok", |
| "middle": [], |
| "last": "Sathe", |
| "suffix": "" |
| }, |
| { |
| "first": "Salar", |
| "middle": [], |
| "last": "Ather", |
| "suffix": "" |
| }, |
| { |
| "first": "Tuan", |
| "middle": [ |
| "Manh" |
| ], |
| "last": "Le", |
| "suffix": "" |
| }, |
| { |
| "first": "Nathan", |
| "middle": [], |
| "last": "Perry", |
| "suffix": "" |
| }, |
| { |
| "first": "Joonsuk", |
| "middle": [], |
| "last": "Park", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 12th Language Resources and Evaluation Conference", |
| "volume": "", |
| "issue": "", |
| "pages": "6874--6882", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Aalok Sathe, Salar Ather, Tuan Manh Le, Nathan Perry, and Joonsuk Park. 2020. Automated Fact-Checking of Claims from Wikipedia. In Proceedings of the 12th Language Resources and Evaluation Confer- ence, pages 6874-6882, Marseille, France. Euro- pean Language Resources Association.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "e-FEVER: Explanations and Summaries for Automated Fact Checking", |
| "authors": [ |
| { |
| "first": "Dominik", |
| "middle": [], |
| "last": "Stammbach", |
| "suffix": "" |
| }, |
| { |
| "first": "Elliott", |
| "middle": [], |
| "last": "Ash", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dominik Stammbach and Elliott Ash. e-FEVER: Explanations and Summaries for Automated Fact Checking. page 12.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "FEVER: a large-scale dataset for Fact Extraction and VERification", |
| "authors": [ |
| { |
| "first": "James", |
| "middle": [], |
| "last": "Thorne", |
| "suffix": "" |
| }, |
| { |
| "first": "Andreas", |
| "middle": [], |
| "last": "Vlachos", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1803.05355[cs].ArXiv:1803.05355" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "James Thorne, Andreas Vlachos, Christos Christodoulopoulos, and Arpit Mittal. 2018. FEVER: a large-scale dataset for Fact Extraction and VERification. arXiv:1803.05355 [cs]. ArXiv: 1803.05355.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Fact Checking: Task definition and dataset construction", |
| "authors": [ |
| { |
| "first": "Andreas", |
| "middle": [], |
| "last": "Vlachos", |
| "suffix": "" |
| }, |
| { |
| "first": "Sebastian", |
| "middle": [], |
| "last": "Riedel", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the ACL 2014 Workshop on Language Technologies and Computational Social Science", |
| "volume": "", |
| "issue": "", |
| "pages": "18--22", |
| "other_ids": { |
| "DOI": [ |
| "10.3115/v1/W14-2508" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Andreas Vlachos and Sebastian Riedel. 2014. Fact Checking: Task definition and dataset construction. In Proceedings of the ACL 2014 Workshop on Lan- guage Technologies and Computational Social Sci- ence, pages 18-22, Baltimore, MD, USA. Associa- tion for Computational Linguistics.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "text": "Figure 1: Overview of our step-by-step binary classification system. N EI stands for \"NOT_ENOUGH_INFO\", C stands for \"CON-TRADICT\" and S stands for \"SUPPORT\". Given claim c, our system first retrieves top K TF-IDF similarity abstracts out of the corpus, then uses a BioBERT binary classifier to further identify desired abstracts on top of that. With retrieved abstracts, our system then uses another BioBERT binary classifier to select rationales. We finally do label prediction in a two-step fashion, i.e. first make verdicts on \"ENOUGH_INFO\" or not and, if positive, then make verdicts on \"SUPPORT\" or not.", |
| "uris": null, |
| "type_str": "figure", |
| "num": null |
| }, |
| "TABREF1": { |
| "text": "", |
| "content": "<table/>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF2": { |
| "text": "reports performance results for the label prediction task with oracle cited abstracts and ora-", |
| "content": "<table><tr><td colspan=\"3\">Sentence Selection</td><td/></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">64.99 70.49 67.63</td></tr><tr><td>BioBERT-base</td><td colspan=\"3\">77.97 62.84 69.59</td></tr><tr><td colspan=\"4\">BioBERT-base* 74.38 65.03 69.39</td></tr><tr><td>BioBERT-large</td><td colspan=\"3\">77.08 63.39 69.57</td></tr><tr><td colspan=\"3\">Downstream Performance</td><td/></tr><tr><td colspan=\"3\">Sentence Level Selection Only</td><td/></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">74.48 59.02 65.85</td></tr><tr><td>BioBERT-base</td><td colspan=\"3\">83.81 56.56 67.54</td></tr><tr><td colspan=\"4\">BioBERT-base* 80.84 57.65 67.30</td></tr><tr><td>BioBERT-large</td><td colspan=\"3\">80.75 58.47 67.83</td></tr><tr><td colspan=\"4\">Sentence Level Selection + Label</td></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">66.90 53.01 59.15</td></tr><tr><td>BioBERT-base</td><td colspan=\"3\">74.90 50.55 60.36</td></tr><tr><td colspan=\"4\">BioBERT-base* 72.41 51.64 60.29</td></tr><tr><td>BioBERT-large</td><td colspan=\"3\">72.08 52.19 60.54</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF3": { |
| "text": "Comparison of rationale selection methods on the dev set of SCIFACT.", |
| "content": "<table/>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF5": { |
| "text": "Comparison of label prediction methods with oracle cited abstracts and oracle rationales.", |
| "content": "<table><tr><td colspan=\"4\">Oracle Abstract + Oracle Rationale</td></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">90.75 75.12 82.20</td></tr><tr><td colspan=\"4\">TWO-STEP 88.54 81.33 84.78</td></tr><tr><td colspan=\"4\">OurSystem Abstract + OurSystem Rationale</td></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">76.92 52.63 62.50</td></tr><tr><td colspan=\"4\">TWO-STEP 73.62 57.42 64.52</td></tr><tr><td colspan=\"4\">Baseline Abstract + Baseline Rationale</td></tr><tr><td>Method</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">56.42 48.32 52.06</td></tr><tr><td colspan=\"4\">TWO-STEP 43.31 52.63 47.52</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF6": { |
| "text": "Comparison of label prediction methods with various upstream modules.", |
| "content": "<table/>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF7": { |
| "text": "TWO-STEP 79.56 52.15 63.00 BioBERT-base* + TWO-STEP 78.91 55.50 65.17 BioBERT-large + TWO-STEP 73.62 57.42 64.52", |
| "content": "<table><tr><td colspan=\"2\">Label Only</td><td/><td/></tr><tr><td>System</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">56.42 48.33 52.06</td></tr><tr><td colspan=\"2\">BioBERT-base + Label+Rationale</td><td/><td/></tr><tr><td>System</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">54.19 46.41 50.00</td></tr><tr><td>BioBERT-base + TWO-STEP</td><td colspan=\"3\">75.91 49.76 60.11</td></tr><tr><td colspan=\"4\">BioBERT-base* + TWO-STEP 73.47 51.67 60.67</td></tr><tr><td>BioBERT-large + TWO-STEP</td><td colspan=\"3\">69.94 54.55 61.29</td></tr><tr><td colspan=\"2\">Selection Only</td><td/><td/></tr><tr><td>System</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">54.27 43.44 48.25</td></tr><tr><td>BioBERT-base + TWO-STEP</td><td colspan=\"3\">77.64 52.19 62.42</td></tr><tr><td colspan=\"4\">BioBERT-base* + TWO-STEP 72.00 54.10 61.78</td></tr><tr><td>BioBERT-large + TWO-STEP</td><td colspan=\"3\">72.76 57.65 64.33</td></tr><tr><td colspan=\"2\">Selection+Label</td><td/><td/></tr><tr><td>System</td><td>P</td><td>R</td><td>F1</td></tr><tr><td>Baseline</td><td colspan=\"3\">48.46 38.80 43.10</td></tr><tr><td>BioBERT-base + TWO-STEP</td><td colspan=\"3\">68.29 45.90 54.90</td></tr><tr><td colspan=\"4\">BioBERT-base* + TWO-STEP 64.00 48.09 54.92</td></tr><tr><td>BioBERT-large + TWO-STEP</td><td colspan=\"3\">64.83 51.37 57.32</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF8": { |
| "text": "Comparison of full pipeline performance on the dev set of SCIFACT.", |
| "content": "<table/>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF10": { |
| "text": "", |
| "content": "<table><tr><td>: Full pipeline performance on SCIFACT's test</td></tr><tr><td>set. OURSYSTEMuses BioBERT-large for abstract re-</td></tr><tr><td>trieval and rationale selection with two-step label pre-</td></tr><tr><td>diction, all trained on trained set and dev set.</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| }, |
| "TABREF11": { |
| "text": "David Wadden, Shanchuan Lin, Kyle Lo, Lucy Lu Wang, Madeleine van Zuylen, Arman Cohan, and Hannaneh Hajishirzi. 2020. Fact or Fiction: Verifying Scientific Claims. arXiv:2004.14974 [cs]. ArXiv: 2004.14974. Tianyi Zhang, Varsha Kishore, Felix Wu, Kilian Q. Weinberger, and Yoav Artzi. 2020.", |
| "content": "<table><tr><td>BERTScore:</td><td colspan=\"2\">Evaluating Text Generation</td></tr><tr><td>with BERT.</td><td>arXiv:1904.09675 [cs].</td><td>ArXiv:</td></tr><tr><td>1904.09675.</td><td/><td/></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "html": null |
| } |
| } |
| } |
| } |
