Invalid JSON: Unexpected non-whitespace character after JSONat line 2, column 1
| {"before_sent": "In this paper , we present a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism.", "after_sent": "This paper presents a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism.", "before_sent_with_intent": "<clarity> <S> In this paper , we present a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. </S> Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations.", "labels": "clarity", "doc_id": "2001.04063", "revision_depth": 2} | |
| {"before_sent": " Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step.", "after_sent": " Instead of optimizing one-step-ahead prediction in the traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step.", "before_sent_with_intent": "<clarity> In this paper , we present a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. <S> Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. </S> The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively.", "labels": "clarity", "doc_id": "2001.04063", "revision_depth": 2} | |
| {"before_sent": " Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step.", "after_sent": " Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction that predicts the next n tokens simultaneously based on previous context tokens at each time step.", "before_sent_with_intent": "<fluency> In this paper , we present a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. <S> Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. </S> The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively.", "labels": "fluency", "doc_id": "2001.04063", "revision_depth": 2} | |
| {"before_sent": " We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively.", "after_sent": " We pre-train ProphetNet using a base scale dataset (16GB) and a large-scale dataset (160GB) respectively.", "before_sent_with_intent": "<fluency> Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. <S> We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively. </S> Then we conduct experiments on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks for abstractive summarization and question generation tasks. Experimental results show that ProphetNet achieves new state-of-the-art results on all these datasets compared to the models using the same scale pre-training corpus.", "labels": "fluency", "doc_id": "2001.04063", "revision_depth": 2} | |
| {"before_sent": " We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively.", "after_sent": " We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) , respectively.", "before_sent_with_intent": "<fluency> Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. <S> We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively. </S> Then we conduct experiments on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks for abstractive summarization and question generation tasks. Experimental results show that ProphetNet achieves new state-of-the-art results on all these datasets compared to the models using the same scale pre-training corpus.", "labels": "fluency", "doc_id": "2001.04063", "revision_depth": 2} | |
| {"before_sent": " While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases which help the language model understand the given task.", "after_sent": " While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases to help language models understand a given task.", "before_sent_with_intent": "<clarity> Some NLP tasks can be solved in a fully unsupervised fashion by providing a pretrained language model with \"task descriptions\" in natural language (e.g., Radford et al., 2019). <S> While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases which help the language model understand the given task. </S> Theses phrases are then used to assign soft labels to a large set of unlabeled examples. Finally, regular supervised training is performed on the resulting training set.", "labels": "clarity", "doc_id": "2001.07676", "revision_depth": 1} | |
| {"before_sent": " Theses phrases are then used to assign soft labels to a large set of unlabeled examples.", "after_sent": " These phrases are then used to assign soft labels to a large set of unlabeled examples.", "before_sent_with_intent": "<fluency> Some NLP tasks can be solved in a fully unsupervised fashion by providing a pretrained language model with \"task descriptions\" in natural language (e.g., Radford et al., 2019). While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases which help the language model understand the given task. <S> Theses phrases are then used to assign soft labels to a large set of unlabeled examples. </S> Finally, regular supervised training is performed on the resulting training set. On several tasks , we show that PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin.", "labels": "fluency", "doc_id": "2001.07676", "revision_depth": 1} | |
| {"before_sent": " On several tasks , we show that PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin.", "after_sent": " For several tasks and languages, PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin.", "before_sent_with_intent": "<clarity> Theses phrases are then used to assign soft labels to a large set of unlabeled examples. Finally, regular supervised training is performed on the resulting training set. <S> On several tasks , we show that PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin. </S> ", "labels": "clarity", "doc_id": "2001.07676", "revision_depth": 1} | |
| {"before_sent": " Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding .", "after_sent": " In this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding .", "before_sent_with_intent": "<coherence> Automatic humor detection has interesting use cases in modern technologies, such as chatbots and virtual assistants. <S> Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding . </S> Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs for parallel lines of hidden layers in a neural network. These lines are finally concatenated to predict the target value.", "labels": "coherence", "doc_id": "2004.12765", "revision_depth": 2} | |
| {"before_sent": " Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding .", "after_sent": " Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts based on the general linguistic structure of humor .", "before_sent_with_intent": "<clarity> Automatic humor detection has interesting use cases in modern technologies, such as chatbots and virtual assistants. <S> Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding . </S> Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs for parallel lines of hidden layers in a neural network. These lines are finally concatenated to predict the target value.", "labels": "clarity", "doc_id": "2004.12765", "revision_depth": 2} | |
| {"before_sent": " Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs for parallel lines of hidden layers in a neural network.", "after_sent": " Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs of parallel lines of hidden layers in a neural network.", "before_sent_with_intent": "<fluency> Automatic humor detection has interesting use cases in modern technologies, such as chatbots and virtual assistants. Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding . <S> Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs for parallel lines of hidden layers in a neural network. </S> These lines are finally concatenated to predict the target value. For evaluation purposes, we created a new dataset for humor detection consisting of 200k formal short texts (100k positive and 100k negative).", "labels": "fluency", "doc_id": "2004.12765", "revision_depth": 2} | |
| {"before_sent": " Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models.", "after_sent": " Our 8-layer model with 110M parameters outperforms the baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models.", "before_sent_with_intent": "<clarity> For evaluation purposes, we created a new dataset for humor detection consisting of 200k formal short texts (100k positive and 100k negative). Experimental results show that our proposed method can determine humor in short texts with accuracy and an F1-score of 98.2 percent. <S> Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models. </S> ", "labels": "clarity", "doc_id": "2004.12765", "revision_depth": 2} | |
| {"before_sent": " Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models.", "after_sent": " Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure of texts in machine learning models.", "before_sent_with_intent": "<clarity> For evaluation purposes, we created a new dataset for humor detection consisting of 200k formal short texts (100k positive and 100k negative). Experimental results show that our proposed method can determine humor in short texts with accuracy and an F1-score of 98.2 percent. <S> Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models. </S> ", "labels": "clarity", "doc_id": "2004.12765", "revision_depth": 2} | |
| {"before_sent": "The Arabic language is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) and Relation Extraction (RE).", "after_sent": "Arabic is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) and Relation Extraction (RE).", "before_sent_with_intent": "<clarity> <S> The Arabic language is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) and Relation Extraction (RE). </S> A few multilingual pre-trained models have been proposed and show good performance for Arabic, however, most experiment results are reported on language understanding tasks, such as natural language inference, question answering and sentiment analysis. Their performance on the IE tasks is less known, in particular, the cross-lingual transfer capability from English to Arabic.", "labels": "clarity", "doc_id": "2004.14519", "revision_depth": 1} | |
| {"before_sent": "The Arabic language is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) and Relation Extraction (RE).", "after_sent": "The Arabic language is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) , and Relation Extraction (RE).", "before_sent_with_intent": "<fluency> <S> The Arabic language is a morphological rich language, posing many challenges for information extraction (IE) tasks, including Named Entity Recognition (NER), Part-of-Speech tagging (POS), Argument Role Labeling (ARL) and Relation Extraction (RE). </S> A few multilingual pre-trained models have been proposed and show good performance for Arabic, however, most experiment results are reported on language understanding tasks, such as natural language inference, question answering and sentiment analysis. Their performance on the IE tasks is less known, in particular, the cross-lingual transfer capability from English to Arabic.", "labels": "fluency", "doc_id": "2004.14519", "revision_depth": 1} | |
| {"before_sent": " In this work, we pre-train a Gigaword-based bilingual language model (GigaBERT) to study these two distant languages as well as zero-short transfer learning on the information extraction tasks.", "after_sent": " In this work, we pre-train a Gigaword-based bilingual language model (GigaBERT) to study these two distant languages as well as zero-short transfer learning on various IE tasks.", "before_sent_with_intent": "<clarity> A few multilingual pre-trained models have been proposed and show good performance for Arabic, however, most experiment results are reported on language understanding tasks, such as natural language inference, question answering and sentiment analysis. Their performance on the IE tasks is less known, in particular, the cross-lingual transfer capability from English to Arabic. <S> In this work, we pre-train a Gigaword-based bilingual language model (GigaBERT) to study these two distant languages as well as zero-short transfer learning on the information extraction tasks. </S> Our GigaBERT model can outperform mBERT and XLM-R-base on NER, POS and ARL tasks, with regarding to the per-language and /or zero-transfer performance. We make our pre-trained models publicly available at URL to facilitate the research of this field.", "labels": "clarity", "doc_id": "2004.14519", "revision_depth": 1} | |
| {"before_sent": "We make our pre-trained models publicly available at URL to facilitate the research of this field.", "after_sent": "We makeWe have made our pre-trained models publicly available at URL to facilitate the research of this field.", "before_sent_with_intent": "<clarity> In this work, we pre-train a Gigaword-based bilingual language model (GigaBERT) to study these two distant languages as well as zero-short transfer learning on the information extraction tasks. Our GigaBERT model can outperform mBERT and XLM-R-base on NER, POS and ARL tasks, with regarding to the per-language and /or zero-transfer performance. <S> We make our pre-trained models publicly available at URL to facilitate the research of this field. </S> ", "labels": "clarity", "doc_id": "2004.14519", "revision_depth": 1} | |
| {"before_sent": "We make our pre-trained models publicly available at URL to facilitate the research of this field.", "after_sent": "We make our pre-trained models publicly available at URL ", "before_sent_with_intent": "<clarity> In this work, we pre-train a Gigaword-based bilingual language model (GigaBERT) to study these two distant languages as well as zero-short transfer learning on the information extraction tasks. Our GigaBERT model can outperform mBERT and XLM-R-base on NER, POS and ARL tasks, with regarding to the per-language and /or zero-transfer performance. <S> We make our pre-trained models publicly available at URL to facilitate the research of this field. </S> ", "labels": "clarity", "doc_id": "2004.14519", "revision_depth": 1} | |
| {"before_sent": "In adversarial (challenge) testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models.", "after_sent": "In adversarial testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models.", "before_sent_with_intent": "<coherence> <S> In adversarial (challenge) testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models. </S> What properties must a system have in order to succeed at these hard tasks? In this paper, we argue that an essential factor is the ability to form modular representations .", "labels": "coherence", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": " In this paper, we argue that an essential factor is the ability to form modular representations .", "after_sent": " In this paper, we argue that an essential factor is modular internal structure .", "before_sent_with_intent": "<clarity> In adversarial (challenge) testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models. What properties must a system have in order to succeed at these hard tasks? <S> In this paper, we argue that an essential factor is the ability to form modular representations . </S> Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation.", "labels": "clarity", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": " Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense .", "after_sent": " Our central contribution is a new experimental method called 'interchange interventions', in which systematic manipulations of model-internal states are related to causal effects on their outputs, thereby allowing us to identify modular structure .", "before_sent_with_intent": "<clarity> What properties must a system have in order to succeed at these hard tasks? In this paper, we argue that an essential factor is the ability to form modular representations . <S> Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . </S> Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "labels": "clarity", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": " We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "after_sent": " We find that a BERT model is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "before_sent_with_intent": "<clarity> Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. <S> We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations. </S> ", "labels": "clarity", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": " We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "after_sent": " We find that a BERT model with fine-tuning is strikingly successful at the systematic generalization task we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "before_sent_with_intent": "<clarity> Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. <S> We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations. </S> ", "labels": "clarity", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": " We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "after_sent": " We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations of model-internal vectors help us understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "before_sent_with_intent": "<clarity> Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. <S> We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations. </S> ", "labels": "clarity", "doc_id": "2004.14623", "revision_depth": 1} | |
| {"before_sent": "For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers .", "after_sent": "In the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers .", "before_sent_with_intent": "<coherence> <S> For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . </S> However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness.", "labels": "coherence", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": "For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers .", "after_sent": "For the automatic evaluation of generative question answering (GenQA ) systems, it is essential to assess the correctness of the generated answers .", "before_sent_with_intent": "<fluency> <S> For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . </S> However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness.", "labels": "fluency", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": "For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers .", "after_sent": "For the automatic evaluation of Generative Question Answering (genQA ) systems, it is difficult to assess the correctness of the generated answers .", "before_sent_with_intent": "<clarity> <S> For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . </S> However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness.", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness.", "after_sent": " Moreover, there is a lack of benchmark datasets to evaluate the suitability of existing metrics in terms of the correctness.", "before_sent_with_intent": "<clarity> For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . <S> Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. </S> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments.", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness.", "after_sent": " Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of correctness.", "before_sent_with_intent": "<fluency> For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . <S> Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. </S> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments.", "labels": "fluency", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets.", "after_sent": " To study a better metric for GenQA, we first create high-quality human judgments of correctness on two standard genQA datasets.", "before_sent_with_intent": "<clarity> However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. <S> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. </S> Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets.", "after_sent": " To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard GenQA datasets.", "before_sent_with_intent": "<fluency> However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. <S> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. </S> Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "labels": "fluency", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments.", "after_sent": " Using our human-evaluation datasets, we show that widely used n-gram similarity do not correlate with human judgments.", "before_sent_with_intent": "<clarity> Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. <S> Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. </S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments.", "after_sent": " Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity metrics do not correlate with human judgments.", "before_sent_with_intent": "<clarity> Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. <S> Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. </S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "after_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of GenQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "before_sent_with_intent": "<fluency> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. <S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . </S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "fluency", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "after_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, our new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "before_sent_with_intent": "<clarity> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. <S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . </S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "after_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights to each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "before_sent_with_intent": "<fluency> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. <S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . </S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "fluency", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "after_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a generated answer sentence captures the key meaning of the human judge's ground-truth .", "before_sent_with_intent": "<clarity> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. <S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . </S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth .", "after_sent": " To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the reference answer .", "before_sent_with_intent": "<clarity> To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. <S> To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . </S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "after_sent": " Our proposed metric shows a significantly higher correlation with human judgments than existing metrics in various datasets .", "before_sent_with_intent": "<clarity> Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . <S> Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics . </S> ", "labels": "clarity", "doc_id": "2005.00192", "revision_depth": 1} | |
| {"before_sent": " Our approach uses a lightweight probing model that learns to map language representations of concrete words to the visual domain .", "after_sent": " Our approach uses a probing model that learns to map language representations of concrete words to the visual domain .", "before_sent_with_intent": "<coherence> Vision, as a central component of human perception, plays a fundamental role in shaping natural language . To better understand how text models are connected to our visual perceptions , we propose a method for examining the similarities between neural representations extracted from words in text and objects in images . <S> Our approach uses a lightweight probing model that learns to map language representations of concrete words to the visual domain . </S> We find that representations from models trained on purely textual data, such as BERT, can be nontrivially mapped to those of a vision model. Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations .", "labels": "coherence", "doc_id": "2005.00619", "revision_depth": 1} | |
| {"before_sent": " Our approach uses a lightweight probing model that learns to map language representations of concrete words to the visual domain .", "after_sent": " Our approach uses a lightweight probing model that examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with the visual domain .", "before_sent_with_intent": "<clarity> Vision, as a central component of human perception, plays a fundamental role in shaping natural language . To better understand how text models are connected to our visual perceptions , we propose a method for examining the similarities between neural representations extracted from words in text and objects in images . <S> Our approach uses a lightweight probing model that learns to map language representations of concrete words to the visual domain . </S> We find that representations from models trained on purely textual data, such as BERT, can be nontrivially mapped to those of a vision model. Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations .", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 1} | |
| {"before_sent": " Moreover, we find that the context surrounding objects in sentences greatly impacts performance.", "after_sent": " ", "before_sent_with_intent": "<clarity> We find that representations from models trained on purely textual data, such as BERT, can be nontrivially mapped to those of a vision model. Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations . <S> Moreover, we find that the context surrounding objects in sentences greatly impacts performance. </S> Finally, we show that humans significantly outperform all examined models , suggesting considerable room for improvement in representation learning and grounding .", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 1} | |
| {"before_sent": " Finally, we show that humans significantly outperform all examined models , suggesting considerable room for improvement in representation learning and grounding .", "after_sent": " Finally, we show that the examined models substantially under-perform humans in retrieval. Altogether, our findings shed new empirical insights on language grounding, suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress .", "before_sent_with_intent": "<clarity> Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations . Moreover, we find that the context surrounding objects in sentences greatly impacts performance. <S> Finally, we show that humans significantly outperform all examined models , suggesting considerable room for improvement in representation learning and grounding . </S> ", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 1} | |
| {"before_sent": " In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to.", "after_sent": " In this work, we characterize how contextual representations of concrete nouns relate to the physical appearance of the objects they refer to.", "before_sent_with_intent": "<clarity> While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. <S> In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to. </S> Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches .", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 2} | |
| {"before_sent": " In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to.", "after_sent": " In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical properties of the objects they refer to.", "before_sent_with_intent": "<clarity> While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. <S> In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to. </S> Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches .", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 2} | |
| {"before_sent": " Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations.", "after_sent": " Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations.", "before_sent_with_intent": "<style> While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to. <S> Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. </S> We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches . In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results.", "labels": "style", "doc_id": "2005.00619", "revision_depth": 2} | |
| {"before_sent": " We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches .", "after_sent": " We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches .", "before_sent_with_intent": "<clarity> In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to. Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. <S> We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches . </S> In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results. Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval.", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 2} | |
| {"before_sent": " Altogether, our findings shed new empirical insights on language grounding , suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress .", "after_sent": " Altogether, our findings shed new empirical insights on language grounding and its materialization in contextual language models .", "before_sent_with_intent": "<clarity> Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval. Finally, we show that the examined models substantially under-perform humans in retrieval . <S> Altogether, our findings shed new empirical insights on language grounding , suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress . </S> ", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 2} | |
| {"before_sent": "While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations.", "after_sent": "The success of large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations.", "before_sent_with_intent": "<coherence> <S> While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. </S> In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations.", "labels": "coherence", "doc_id": "2005.00619", "revision_depth": 3} | |
| {"before_sent": "While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations.", "after_sent": "While large-scale contextual language models has attracted great interest in probing what is encoded in their representations.", "before_sent_with_intent": "<clarity> <S> While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. </S> In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations.", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 3} | |
| {"before_sent": " In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to.", "after_sent": " In this work, we consider a new question: to what extent contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to.", "before_sent_with_intent": "<clarity> While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. <S> In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. </S> Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations. We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process.", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 3} | |
| {"before_sent": " Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations.", "after_sent": " Our approach uses a probing model that evaluates how effective are text-only representations in distinguishing between matching and non-matching visual representations.", "before_sent_with_intent": "<clarity> While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. <S> Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations. </S> We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process. Much weaker results are found in control experiments, attesting the selectivity of the probe.", "labels": "clarity", "doc_id": "2005.00619", "revision_depth": 3} | |
| {"before_sent": " We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process.", "after_sent": " Our findings show that language representations alone provide a strong signal for retrieving image patches from the correct object categories. Moreover, they are effective in retrieving specific instances of image patches; textual context plays an important role in this process.", "before_sent_with_intent": "<style> In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations. <S> We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process. </S> Much weaker results are found in control experiments, attesting the selectivity of the probe. All examined models greatly under-perform humans in retrieval, highlighting substantial room for future progress.", "labels": "style", "doc_id": "2005.00619", "revision_depth": 3} | |
| {"before_sent": "We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback.", "after_sent": "We propose a new task of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback.", "before_sent_with_intent": "<clarity> <S> We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback. </S> To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot). In each dialog, the recommender proactively leads a multi-type dialog to approach recommendation targets and then makes multiple recommendations with rich interaction behavior.", "labels": "clarity", "doc_id": "2005.03954", "revision_depth": 2} | |
| {"before_sent": "We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback.", "after_sent": "We focus on the study of conversational recommendation over multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback.", "before_sent_with_intent": "<clarity> <S> We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback. </S> To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot). In each dialog, the recommender proactively leads a multi-type dialog to approach recommendation targets and then makes multiple recommendations with rich interaction behavior.", "labels": "clarity", "doc_id": "2005.03954", "revision_depth": 2} | |
| {"before_sent": " To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot).", "after_sent": " To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot).", "before_sent_with_intent": "<clarity> We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback. <S> To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot). </S> In each dialog, the recommender proactively leads a multi-type dialog to approach recommendation targets and then makes multiple recommendations with rich interaction behavior. This dataset allows us to systematically investigate different parts of the overall problem, e.g., how to naturally lead a dialog, how to interact with users for recommendation.", "labels": "clarity", "doc_id": "2005.03954", "revision_depth": 2} | |
| {"before_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "after_sent": " However, it is often overlooked that the decoder obtains only a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "before_sent_with_intent": "<clarity> In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. <S> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . </S> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "after_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, i.e. , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "before_sent_with_intent": "<clarity> In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. <S> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . </S> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "after_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer . Although those representations are supposed to be a global view of source sequences .", "before_sent_with_intent": "<coherence> In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. <S> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . </S> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "labels": "coherence", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences .", "after_sent": " However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a comprehensive, global view of source sequences .", "before_sent_with_intent": "<clarity> In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. <S> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . </S> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " Such implementation hinders the decoder from concrete, fine-grained , local source information .", "after_sent": " Such implementation hinders the decoder from concrete, fine-grained source information generated by other encoder layers .", "before_sent_with_intent": "<clarity> In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . <S> Such implementation hinders the decoder from concrete, fine-grained , local source information . </S> In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "after_sent": " In this work, we propose to encourage the decoder to take the full advantage of the multi-level source representations for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "before_sent_with_intent": "<clarity> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . Such implementation hinders the decoder from concrete, fine-grained , local source information . <S> In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . </S> We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers .", "after_sent": " In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers .", "before_sent_with_intent": "<coherence> However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . Such implementation hinders the decoder from concrete, fine-grained , local source information . <S> In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . </S> We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "labels": "coherence", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "after_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on the neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "before_sent_with_intent": "<fluency> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . <S> We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets. </S> ", "labels": "fluency", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "after_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task , surpassing the previous state-of-the-art architecture on three machine translation datasets.", "before_sent_with_intent": "<clarity> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . <S> We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets. </S> ", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "after_sent": " We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three benchmark datasets.", "before_sent_with_intent": "<clarity> Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . <S> We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets. </S> ", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 1} | |
| {"before_sent": " In this work, we propose to encourage the decoder to take the full advantage of the multi-level source representations for layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations.", "after_sent": " In this work, we propose layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations.", "before_sent_with_intent": "<clarity> However, it is often overlooked that the decoder obtains only a single view of the source sequences, i.e., the representations generated by the last encoder layer . Although those representations are supposed to be a comprehensive, global view of source sequences, such practice keeps the decoders from concrete, fine-grained source information generated by other encoder layers . <S> In this work, we propose to encourage the decoder to take the full advantage of the multi-level source representations for layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations. </S> In particular, the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on the neural machine translation task, surpassing the previous state-of-the-art architecture on three benchmark datasets .", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 2} | |
| {"before_sent": " In this work, we propose layer-wise cross-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences.", "after_sent": " In this work, we propose layer-wise multi-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences.", "before_sent_with_intent": "<clarity> While it is common practice to draw information from only the last encoder layer, recent work has proposed to use representations from different encoder layers for diversified levels of information. Nonetheless, the decoder still obtains only a single view of the source sequences, which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem. <S> In this work, we propose layer-wise cross-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. </S> Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks .", "labels": "clarity", "doc_id": "2005.08081", "revision_depth": 3} | |
| {"before_sent": " Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks .", "after_sent": " Systematic experiments and analyses show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks .", "before_sent_with_intent": "<coherence> Nonetheless, the decoder still obtains only a single view of the source sequences, which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem. In this work, we propose layer-wise cross-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. <S> Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks . </S> ", "labels": "coherence", "doc_id": "2005.08081", "revision_depth": 3} | |
| {"before_sent": "Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others.", "after_sent": "Deep learning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others.", "before_sent_with_intent": "<fluency> <S> Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others. </S> However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. This issue has been studied profoundly in image and audio domain.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": "Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others.", "after_sent": "Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis , and many others.", "before_sent_with_intent": "<fluency> <S> Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others. </S> However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. This issue has been studied profoundly in image and audio domain.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify.", "after_sent": " However, in recent years it has been shown that these models possess weakness to noises which force the model to misclassify.", "before_sent_with_intent": "<fluency> Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others. <S> However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. </S> This issue has been studied profoundly in image and audio domain. Very little has been studied on this issue with respect to textual data.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " This issue has been studied profoundly in image and audio domain.", "after_sent": " This issue has been studied profoundly in the image and audio domain.", "before_sent_with_intent": "<fluency> Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others. However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. <S> This issue has been studied profoundly in image and audio domain. </S> Very little has been studied on this issue with respect to textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " Very little has been studied on this issue with respect to textual data.", "after_sent": " Very little has been studied on this issue concerning textual data.", "before_sent_with_intent": "<clarity> However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. This issue has been studied profoundly in image and audio domain. <S> Very little has been studied on this issue with respect to textual data. </S> Even less survey on this topic has been performed to understand different types of attacks and defense techniques. In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "labels": "clarity", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "after_sent": " In this manuscript , we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "before_sent_with_intent": "<fluency> Very little has been studied on this issue with respect to textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques. <S> In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea. </S> Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "after_sent": " In this manuscript we accumulated and analyzed different attacking techniques and various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "before_sent_with_intent": "<fluency> Very little has been studied on this issue with respect to textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques. <S> In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea. </S> Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field.", "labels": "fluency", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea.", "after_sent": " In this manuscript we accumulated and analyzed different attacking techniques , various defense models to provide a more comprehensive idea.", "before_sent_with_intent": "<clarity> Very little has been studied on this issue with respect to textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques. <S> In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea. </S> Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field.", "labels": "clarity", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": " Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field.", "after_sent": " Later we point out some of the interesting findings of all papers and challenges that need to be overcome to move forward in this field.", "before_sent_with_intent": "<clarity> Even less survey on this topic has been performed to understand different types of attacks and defense techniques. In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea. <S> Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field. </S> ", "labels": "clarity", "doc_id": "2005.14108", "revision_depth": 1} | |
| {"before_sent": "Deep neural networks excel at learning from labeled data and achieve state-of-the-art results on a wide array of Natural Language Processing tasks.", "after_sent": "Deep neural networks excel at learning from labeled data and achieve state-of-the-art resultson a wide array of Natural Language Processing tasks.", "before_sent_with_intent": "<fluency> <S> Deep neural networks excel at learning from labeled data and achieve state-of-the-art results on a wide array of Natural Language Processing tasks. </S> In contrast, learning from unlabeled data, especially under domain shift, remains a challenge. Motivated by the latest advances, in this survey we review neural unsupervised domain adaptation techniques which do not require labeled target domain data.", "labels": "fluency", "doc_id": "2006.00632", "revision_depth": 1} | |
| {"before_sent": " We outline methods, from early approaches in traditional non-neural methods to pre-trained model transfer.", "after_sent": " We outline methods, from early traditional non-neural methods to pre-trained model transfer.", "before_sent_with_intent": "<clarity> Motivated by the latest advances, in this survey we review neural unsupervised domain adaptation techniques which do not require labeled target domain data. This is a more challenging yet a more widely applicable setup. <S> We outline methods, from early approaches in traditional non-neural methods to pre-trained model transfer. </S> We also revisit the notion of domain, and we uncover a bias in the type of Natural Language Processing tasks which received most attention. Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future intelligent NLP.", "labels": "clarity", "doc_id": "2006.00632", "revision_depth": 1} | |
| {"before_sent": " Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future intelligent NLP.", "after_sent": " Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future NLP.", "before_sent_with_intent": "<clarity> We outline methods, from early approaches in traditional non-neural methods to pre-trained model transfer. We also revisit the notion of domain, and we uncover a bias in the type of Natural Language Processing tasks which received most attention. <S> Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future intelligent NLP. </S> ", "labels": "clarity", "doc_id": "2006.00632", "revision_depth": 1} | |
| {"before_sent": " We motivate the development of our framework with several cautionary tales of previous re-search , which has developed numerous less-than-optimal algorithms for computing expectations and their gradients.", "after_sent": " We motivate the development of our framework with several cautionary tales of previous research , which has developed numerous less-than-optimal algorithms for computing expectations and their gradients.", "before_sent_with_intent": "<fluency> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. <S> We motivate the development of our framework with several cautionary tales of previous re-search , which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. </S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria. As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence.", "labels": "fluency", "doc_id": "2008.12988", "revision_depth": 1} | |
| {"before_sent": " In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reducesthe runtime complexity by a factor (or two) of the sentence length.", "after_sent": " In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length.", "before_sent_with_intent": "<fluency> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria. As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence. <S> In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reducesthe runtime complexity by a factor (or two) of the sentence length. </S> We validate the implementation of our framework through runtime experiments. We find our algorithms are upto 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively.", "labels": "fluency", "doc_id": "2008.12988", "revision_depth": 1} | |
| {"before_sent": " We find our algorithms are upto 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively.", "after_sent": " We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively.", "before_sent_with_intent": "<fluency> In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reducesthe runtime complexity by a factor (or two) of the sentence length. We validate the implementation of our framework through runtime experiments. <S> We find our algorithms are upto 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively. </S> ", "labels": "fluency", "doc_id": "2008.12988", "revision_depth": 1} | |
| {"before_sent": "We give a general framework for inference in spanning tree models.", "after_sent": "We propose a general framework for inference in spanning tree models.", "before_sent_with_intent": "<clarity> <S> We give a general framework for inference in spanning tree models. </S> We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms.", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " These algorithms are easy to implement, given the prevalence of automatic differentiation software.", "after_sent": " ", "before_sent_with_intent": "<coherence> We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. <S> These algorithms are easy to implement, given the prevalence of automatic differentiation software. </S> We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria .", "labels": "coherence", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients.", "after_sent": " We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients.", "before_sent_with_intent": "<style> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. <S> We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. </S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence .", "labels": "style", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients.", "after_sent": " We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients.", "before_sent_with_intent": "<clarity> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. <S> We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. </S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence .", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria .", "after_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, and the generalized expectation criterion .", "before_sent_with_intent": "<clarity> These algorithms are easy to implement, given the prevalence of automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. <S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . </S> As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length.", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length.", "after_sent": " In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length.", "before_sent_with_intent": "<clarity> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence . <S> In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length. </S> We validate the implementation of our framework through runtime experiments. We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively .", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": " We validate the implementation of our framework through runtime experiments.", "after_sent": " We validate our framework through runtime experiments.", "before_sent_with_intent": "<clarity> As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length. <S> We validate the implementation of our framework through runtime experiments. </S> We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively .", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 2} | |
| {"before_sent": "We propose a general framework for computing expectations in edge-factored, non-projective spanning-tree models.", "after_sent": "We give a general framework for computing expectations in edge-factored, non-projective spanning-tree models.", "before_sent_with_intent": "<clarity> <S> We propose a general framework for computing expectations in edge-factored, non-projective spanning-tree models. </S> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. We motivate the development of our framework with several emph{cautionary tales} of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients.", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 3} | |
| {"before_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion .", "after_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, and the generalized expectation criterion .", "before_sent_with_intent": "<clarity> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. We motivate the development of our framework with several emph{cautionary tales} of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. <S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion . </S> As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length.", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 3} | |
| {"before_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion .", "after_sent": " We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, entropy, and generalized expectation criteria .", "before_sent_with_intent": "<clarity> Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. We motivate the development of our framework with several emph{cautionary tales} of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. <S> We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion . </S> As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length.", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 3} | |
| {"before_sent": " As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence .", "after_sent": " As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence .", "before_sent_with_intent": "<clarity> We motivate the development of our framework with several emph{cautionary tales} of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion . <S> As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . </S> In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length. We validate our framework through rigorous proofs of correctness and efficiency .", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 3} | |
| {"before_sent": " We validate our framework through rigorous proofs of correctness and efficiency .", "after_sent": " We validate the implementation of our framework through rigorous proofs of correctness and efficiency .", "before_sent_with_intent": "<clarity> As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length. <S> We validate our framework through rigorous proofs of correctness and efficiency . </S> ", "labels": "clarity", "doc_id": "2008.12988", "revision_depth": 3} | |
| {"before_sent": " A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust differentiable top-k operator.", "after_sent": " A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust trainable top-k operator.", "before_sent_with_intent": "<clarity> We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on task-specific parts of the input. <S> A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust differentiable top-k operator. </S> For example, our experiments on a challenging summarization task of long documents show that our method is much faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models. The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements since representation pooling addresses a different aspect of the attention's complexity problem .", "labels": "clarity", "doc_id": "2009.05169", "revision_depth": 2} | |
| {"before_sent": " For example, our experiments on a challenging summarization task of long documents show that our method is much faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models.", "after_sent": " For example, our experiments on a challenging summarization task of long documents show that our method is over 3 times faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models.", "before_sent_with_intent": "<clarity> We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on task-specific parts of the input. A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust differentiable top-k operator. <S> For example, our experiments on a challenging summarization task of long documents show that our method is much faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models. </S> The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements since representation pooling addresses a different aspect of the attention's complexity problem .", "labels": "clarity", "doc_id": "2009.05169", "revision_depth": 2} | |
| {"before_sent": " The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements since representation pooling addresses a different aspect of the attention's complexity problem .", "after_sent": " The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements .", "before_sent_with_intent": "<clarity> A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust differentiable top-k operator. For example, our experiments on a challenging summarization task of long documents show that our method is much faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models. <S> The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements since representation pooling addresses a different aspect of the attention's complexity problem . </S> ", "labels": "clarity", "doc_id": "2009.05169", "revision_depth": 2} | |
| {"before_sent": "Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage.", "after_sent": "Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage.", "before_sent_with_intent": "<style> <S> Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage. </S> Unlike NMT, the attention-aware inference of NAS requires the prediction of the optimal attention distribution. Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources.", "labels": "style", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": "Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage.", "after_sent": "Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage.", "before_sent_with_intent": "<clarity> <S> Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage. </S> Unlike NMT, the attention-aware inference of NAS requires the prediction of the optimal attention distribution. Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources.", "labels": "clarity", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": " Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources.", "after_sent": " Therefore, an attention-prediction model to learn the dependency between attention weights and sources.", "before_sent_with_intent": "<coherence> Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage. Unlike NMT, the attention-aware inference of NAS requires the prediction of the optimal attention distribution. <S> Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources. </S> To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed.", "labels": "coherence", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed.", "after_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the vanilla beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed.", "before_sent_with_intent": "<style> Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources. To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. <S> Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed. </S> Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture .", "labels": "style", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed.", "after_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware mechanism , significant improvements on the quality of summaries could be further observed.", "before_sent_with_intent": "<style> Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources. To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. <S> Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed. </S> Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture .", "labels": "style", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed.", "after_sent": " Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be observed.", "before_sent_with_intent": "<style> Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources. To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. <S> Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed. </S> Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture .", "labels": "style", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": " Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture .", "after_sent": " Last but not the least, the attention-aware inference has strong universality that can be easily adopted to different hierarchical summarization models to promote the models' performance .", "before_sent_with_intent": "<style> To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed. <S> Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture . </S> ", "labels": "style", "doc_id": "2009.06891", "revision_depth": 1} | |
| {"before_sent": "Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage.", "after_sent": "This paper proposes a novel inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage.", "before_sent_with_intent": "<clarity> <S> Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage. </S> Unlike NMT, NAS is not based on one-to-one transformation. Instead, its attention distribution for the input should be irregular and depend on the content layout of the source documents.", "labels": "clarity", "doc_id": "2009.06891", "revision_depth": 2} | |
| {"before_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation .", "after_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) for answering open-domain questions, which augments a query with relevant contexts through text generation .", "before_sent_with_intent": "<clarity> Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching. Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. <S> In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . </S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation .", "after_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query through text generation .", "before_sent_with_intent": "<coherence> Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching. Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. <S> In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . </S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.", "labels": "coherence", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation .", "after_sent": " In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation of heuristically discovered relevant contexts without external resources as supervision .", "before_sent_with_intent": "<clarity> Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching. Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. <S> In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . </S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "after_sent": " We demonstrate that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "before_sent_with_intent": "<coherence> Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . <S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . </S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance.", "labels": "coherence", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "after_sent": " We demonstrate on open-domain question answering that the generated contexts substantially enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "before_sent_with_intent": "<clarity> Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . <S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . </S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance.", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "after_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "before_sent_with_intent": "<coherence> Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . <S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . </S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance.", "labels": "coherence", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "after_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "before_sent_with_intent": "<coherence> Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . <S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . </S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance.", "labels": "coherence", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "after_sent": " We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense retrieval methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense .", "before_sent_with_intent": "<clarity> Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . <S> We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . </S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance.", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.", "after_sent": " We show that generating diverse contexts for a query is beneficial as fusing their results consistently yields better retrieval accuracy.", "before_sent_with_intent": "<clarity> In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . <S> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. </S> Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "after_sent": " GAR achieves state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "before_sent_with_intent": "<coherence> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. <S> Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used. </S> ", "labels": "coherence", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "after_sent": " Furthermore, GAR achieves the state-of-the-art performance on Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "before_sent_with_intent": "<clarity> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. <S> Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used. </S> ", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "after_sent": " Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive QA setup when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "before_sent_with_intent": "<clarity> We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. <S> Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used. </S> ", "labels": "clarity", "doc_id": "2009.08553", "revision_depth": 2} | |
| {"before_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources .", "after_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles . HALO implements a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources .", "before_sent_with_intent": "<clarity> Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. <S> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . </S> The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources .", "after_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the performance-portable execution of a hardware-agnostic application host codes across heterogeneous accelerator resources .", "before_sent_with_intent": "<clarity> Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. <S> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . </S> The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources .", "after_sent": " In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic host application across heterogeneous accelerators .", "before_sent_with_intent": "<clarity> Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. <S> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . </S> The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs,", "after_sent": " The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 CPUs,", "before_sent_with_intent": "<clarity> Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . <S> The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, </S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for host programs to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "before_sent_with_intent": "<clarity> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, <S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work . </S> ", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently top performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "before_sent_with_intent": "<clarity> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, <S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work . </S> ", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "before_sent_with_intent": "<clarity> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, <S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work . </S> ", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is up to five orders of magnitude higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "before_sent_with_intent": "<clarity> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, <S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work . </S> ", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_sent": " Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution .", "before_sent_with_intent": "<clarity> In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, <S> Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work . </S> ", "labels": "clarity", "doc_id": "2011.10896", "revision_depth": 2} | |
| {"before_sent": "Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations.", "after_sent": "Natural Language Processing (NLP) systems learn harmful societal biases that cause them to amplify inequality as they are deployed in more and more situations.", "before_sent_with_intent": "<clarity> <S> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. </S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics .", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "after_sent": " To guide efforts at debiasing these systems , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "before_sent_with_intent": "<clarity> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. <S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. </S> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "after_sent": " To address and combat this , the NLP community relies on a variety of metrics that quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "before_sent_with_intent": "<fluency> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. <S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. </S> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "labels": "fluency", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "after_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in models . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "before_sent_with_intent": "<clarity> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. <S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. </S> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "after_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, measuring bias in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "before_sent_with_intent": "<clarity> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. <S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. </S> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into.", "after_sent": " To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, measuring bias in downstream tasks that the word embeddings are plugged into.", "before_sent_with_intent": "<clarity> Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. <S> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. </S> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "after_sent": " We measure both intrinsic and extrinsic metrics across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "before_sent_with_intent": "<clarity> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . <S> We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. </S> We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "after_sent": " We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions . Our results show no reliable correlation between these metrics that holds in all scenarios across tasks and languages.", "before_sent_with_intent": "<coherence> To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . <S> We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. </S> We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "labels": "coherence", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data.", "after_sent": " We urge researchers working on debiasing to focus on extrinsic measures of bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data.", "before_sent_with_intent": "<clarity> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. <S> We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. </S> We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data.", "after_sent": " We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and to make using these measures more feasible via creation of additional challenge sets and annotated test data.", "before_sent_with_intent": "<clarity> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. <S> We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. </S> We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data.", "after_sent": " We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of new challenge sets and annotated test data.", "before_sent_with_intent": "<clarity> This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. <S> We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. </S> We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "after_sent": " To aid this effort, we release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "before_sent_with_intent": "<clarity> We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. <S> We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech . </S> ", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "after_sent": " We additionally release code, a new intrinsic metric, and an annotated test set focused on gender bias in hate speech .", "before_sent_with_intent": "<clarity> We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. <S> We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech . </S> ", "labels": "clarity", "doc_id": "2012.15859", "revision_depth": 2} | |
| {"before_sent": " In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries.", "after_sent": " In this paper, we present CANINE, a neural encoder that operates directly on character sequences, without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries.", "before_sent_with_intent": "<coherence> Pipelined NLP systems have largely been superseded by end-to-end neural modeling, yet nearly all commonly-used models still require an explicit tokenization step. While recent tokenization approaches based on data-derived subword lexicons are less brittle than manually engineered tokenizers, these techniques are not equally suited to all languages, and the use of any fixed vocabulary may limit a model's ability to adapt. <S> In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries. </S> To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes con-text . CANINE outperforms a comparable mBERT model by >= 1 F1 on TyDi QA, a challenging multilingual benchmark, despite having 28\\% fewer model parameters.", "labels": "coherence", "doc_id": "2103.06874", "revision_depth": 1} | |
| {"before_sent": " In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries.", "after_sent": " In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary, and a pre-training strategy with soft inductive biases in place of hard token boundaries.", "before_sent_with_intent": "<coherence> Pipelined NLP systems have largely been superseded by end-to-end neural modeling, yet nearly all commonly-used models still require an explicit tokenization step. While recent tokenization approaches based on data-derived subword lexicons are less brittle than manually engineered tokenizers, these techniques are not equally suited to all languages, and the use of any fixed vocabulary may limit a model's ability to adapt. <S> In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries. </S> To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes con-text . CANINE outperforms a comparable mBERT model by >= 1 F1 on TyDi QA, a challenging multilingual benchmark, despite having 28\\% fewer model parameters.", "labels": "coherence", "doc_id": "2103.06874", "revision_depth": 1} | |
| {"before_sent": " To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes con-text .", "after_sent": " To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes context .", "before_sent_with_intent": "<fluency> While recent tokenization approaches based on data-derived subword lexicons are less brittle than manually engineered tokenizers, these techniques are not equally suited to all languages, and the use of any fixed vocabulary may limit a model's ability to adapt. In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries. <S> To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes con-text . </S> CANINE outperforms a comparable mBERT model by >= 1 F1 on TyDi QA, a challenging multilingual benchmark, despite having 28\\% fewer model parameters.", "labels": "fluency", "doc_id": "2103.06874", "revision_depth": 1} | |
| {"before_sent": " a binary classification (offensive versus non-offensive comments ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "after_sent": " a binary classification (offensive versus non-offensive language ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "before_sent_with_intent": "<clarity> This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: <S> a binary classification (offensive versus non-offensive comments ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). </S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement .", "labels": "clarity", "doc_id": "2103.14972", "revision_depth": 1} | |
| {"before_sent": " a binary classification (offensive versus non-offensive comments ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "after_sent": " a binary classification (offensive versus non-offensive comments ), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "before_sent_with_intent": "<fluency> This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: <S> a binary classification (offensive versus non-offensive comments ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). </S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement .", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 1} | |
| {"before_sent": " The proposed annotation process is also language and domain independent .", "after_sent": " The proposed annotation approach is also language and domain independent .", "before_sent_with_intent": "<clarity> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. <S> The proposed annotation process is also language and domain independent . </S> ", "labels": "clarity", "doc_id": "2103.14972", "revision_depth": 2} | |
| {"before_sent": "This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language in social media.", "after_sent": "This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language on social media.", "before_sent_with_intent": "<fluency> <S> This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language in social media. </S> In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers:", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language.", "after_sent": " In addition, we provide the first robust corpus of this kind for the Brazilian Portuguese language.", "before_sent_with_intent": "<fluency> This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language in social media. <S> In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. </S> The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers:", "after_sent": " The corpus was collected from Instagram posts of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers:", "before_sent_with_intent": "<clarity> This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language in social media. In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. <S> The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: </S> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement.", "labels": "clarity", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "after_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive , and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "before_sent_with_intent": "<fluency> In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: <S> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). </S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "after_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religious intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "before_sent_with_intent": "<fluency> In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: <S> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). </S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia).", "after_sent": " a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism , and fat phobia).", "before_sent_with_intent": "<fluency> In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: <S> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). </S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " Each comment was annotated by three different annotators, which achieved high inter-annotator agreement.", "after_sent": " Each comment was annotated by three different annotators, and achieved high inter-annotator agreement.", "before_sent_with_intent": "<coherence> The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). <S> Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. </S> The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "labels": "coherence", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "after_sent": " The proposed annotation approach is also language and domain-independent (although it has been applied for Brazilian Portuguese .", "before_sent_with_intent": "<clarity> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. <S> The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese . </S> ", "labels": "clarity", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "after_sent": " The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese ) .", "before_sent_with_intent": "<fluency> a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. <S> The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese . </S> ", "labels": "fluency", "doc_id": "2103.14972", "revision_depth": 3} | |
| {"before_sent": " Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive.", "after_sent": " Our approach incorporate an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive.", "before_sent_with_intent": "<fluency> This paper presents a new approach for offensive language and hate speech detection on social media. <S> Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive. </S> Due to the severity of the hate speech and offensive comments in Brazil and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method. However, the proposal may be applied to any other language or domain.", "labels": "fluency", "doc_id": "2104.12265", "revision_depth": 1} | |
| {"before_sent": " Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive.", "after_sent": " Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent and context-independent offensive.", "before_sent_with_intent": "<clarity> This paper presents a new approach for offensive language and hate speech detection on social media. <S> Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive. </S> Due to the severity of the hate speech and offensive comments in Brazil and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method. However, the proposal may be applied to any other language or domain.", "labels": "clarity", "doc_id": "2104.12265", "revision_depth": 1} | |
| {"before_sent": " Due to the severity of the hate speech and offensive comments in Brazil and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method.", "after_sent": " Due to the severity of the hate speech and offensive comments in Brazil , and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method.", "before_sent_with_intent": "<fluency> This paper presents a new approach for offensive language and hate speech detection on social media. Our approach incorporates an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent offensive and context-independent offensive. <S> Due to the severity of the hate speech and offensive comments in Brazil and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method. </S> However, the proposal may be applied to any other language or domain. Based on the obtained results, the proposed approach showed high performance results overcoming the current baselines for European and Brazilian Portuguese.", "labels": "fluency", "doc_id": "2104.12265", "revision_depth": 1} | |
| {"before_sent": "Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference.", "after_sent": "Gordon Brown in 2004.United Kingdom Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference.", "before_sent_with_intent": "<clarity> <S> Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference. </S> In the speech he made several commitments, which he said he would \"work tirelessly\" to achieve. On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the carers that serve this country [the UK] so well.", "labels": "clarity", "doc_id": "100912", "revision_depth": 1} | |
| {"before_sent": "Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference.", "after_sent": "Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of the party's spring conference.", "before_sent_with_intent": "<clarity> <S> Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference. </S> In the speech he made several commitments, which he said he would \"work tirelessly\" to achieve. On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the carers that serve this country [the UK] so well.", "labels": "clarity", "doc_id": "100912", "revision_depth": 1} | |
| {"before_sent": " On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the carers that serve this country [the UK] so well.", "after_sent": " On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the careers that serve this country [the UK] so well.", "before_sent_with_intent": "<fluency> Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference. In the speech he made several commitments, which he said he would \"work tirelessly\" to achieve. <S> On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the carers that serve this country [the UK] so well. </S> He continued by saying that since Labour came to power in 1997, three million new jobs have been created. He also said that Labour will attempt to get 100,00 people back to work.", "labels": "fluency", "doc_id": "100912", "revision_depth": 1} | |
| {"before_sent": " When discussing crime in the speech, Mr. Brown claimed that his party has \"already cut crime by 32\\%.\"", "after_sent": " While discussing crime in the speech, Mr. Brown claimed that his party has \"already cut crime by 32\\%.\"", "before_sent_with_intent": "<fluency> He continued by saying that since Labour came to power in 1997, three million new jobs have been created. He also said that Labour will attempt to get 100,00 people back to work. <S> When discussing crime in the speech, Mr. Brown claimed that his party has \"already cut crime by 32\\%.\" </S> He also made promises of community policing across the UK.", "labels": "fluency", "doc_id": "100912", "revision_depth": 1} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry.", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry.", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. </S> Besides for the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 1} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry.", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry.", "before_sent_with_intent": "<coherence> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. </S> Besides for the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "labels": "coherence", "doc_id": "106096", "revision_depth": 1} | |
| {"before_sent": " Besides for the early-announced \"Wow!", "after_sent": " Besides of the early-announced \"Wow!", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. <S> Besides for the early-announced \"Wow! </S> Taiwan Design Award\", winners from \"2008 Young Designers Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 1} | |
| {"before_sent": " Taiwan Design Award\", winners from \"2008 Young Designers Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "after_sent": " Taiwan Design Award\", winners from \"2008 Young Designers ' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "before_sent_with_intent": "<clarity> 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. Besides for the early-announced \"Wow! <S> Taiwan Design Award\", winners from \"2008 Young Designers Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17). </S> ", "labels": "clarity", "doc_id": "106096", "revision_depth": 1} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry . </S> ", "labels": "clarity", "doc_id": "106096", "revision_depth": 2} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday May 18. It features participation by 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "before_sent_with_intent": "<coherence> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry . </S> ", "labels": "coherence", "doc_id": "106096", "revision_depth": 2} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academic groups in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry . </S> ", "labels": "clarity", "doc_id": "106096", "revision_depth": 2} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "after_sent": " 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry . </S> ", "labels": "clarity", "doc_id": "106096", "revision_depth": 2} | |
| {"before_sent": " 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and will close at Sunday May 18.", "after_sent": " 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and closes Sunday May 18.", "before_sent_with_intent": "<clarity> noicon|Launch of the Opening Ceremony. <S> 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and will close at Sunday May 18. </S> It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations.", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries.", "after_sent": " Besides the several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries.", "before_sent_with_intent": "<coherence> It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. <S> Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. </S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. Besides of the early-announced \"Wow!", "labels": "coherence", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries.", "after_sent": " Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will showcase different solutions for design, creative, and cultural industries.", "before_sent_with_intent": "<clarity> It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. <S> Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. </S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. Besides of the early-announced \"Wow!", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries.", "after_sent": " Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for the design, creative, and cultural industries.", "before_sent_with_intent": "<fluency> It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. <S> Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. </S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. Besides of the early-announced \"Wow!", "labels": "fluency", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "after_sent": " The show's organizer , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "before_sent_with_intent": "<coherence> It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. <S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. </S> Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "coherence", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "after_sent": " In addition , Taiwan Design Center, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "before_sent_with_intent": "<clarity> It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. <S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. </S> Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "after_sent": " In addition , Taiwan Design Center, the show organizer, also designed several on-site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "before_sent_with_intent": "<clarity> It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. <S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. </S> Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "after_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Career Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "before_sent_with_intent": "<fluency> It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. <S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. </S> Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "fluency", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition.", "after_sent": " In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with the on-line exhibition.", "before_sent_with_intent": "<clarity> It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. <S> In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. </S> Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": " Besides of the early-announced \"Wow!", "after_sent": " Besides of the previously announced \"Wow!", "before_sent_with_intent": "<clarity> Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. <S> Besides of the early-announced \"Wow! </S> Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "labels": "clarity", "doc_id": "106096", "revision_depth": 3} | |
| {"before_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "after_sent": "One hundred students from Serbia who decide to pursue graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "before_sent_with_intent": "<clarity> <S> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. </S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "after_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for Young Talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "before_sent_with_intent": "<fluency> <S> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. </S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "labels": "fluency", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "after_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who wish to apply must have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "before_sent_with_intent": "<clarity> <S> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. </S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "after_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least an 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "before_sent_with_intent": "<fluency> <S> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. </S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "labels": "fluency", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26.", "after_sent": "One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and must be younger then 26.", "before_sent_with_intent": "<clarity> <S> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. </S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies.", "after_sent": " Additionally, students must commit to work in Serbia for at least 5 years after finishing their graduate studies.", "before_sent_with_intent": "<coherence> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. <S> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. </S> Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month. The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too .", "labels": "coherence", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "after_sent": " Scholarship will be awarded based on the student's GPA and the prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "before_sent_with_intent": "<clarity> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. <S> Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month. </S> The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too . The Fund for young talents will cover about 2.5\\% of students in Serbia.", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month.", "after_sent": " Winners will be decided based on their GPA and prestige of the university to which they apply . Also, one thousand university seniors will be awarded 250 a month.", "before_sent_with_intent": "<clarity> One hundred students from Serbia who decide to start graduate studies abroad will get 15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. <S> Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month. </S> The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too . The Fund for young talents will cover about 2.5\\% of students in Serbia.", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too .", "after_sent": " The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account as well .", "before_sent_with_intent": "<style> Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month. <S> The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too . </S> The Fund for young talents will cover about 2.5\\% of students in Serbia.", "labels": "style", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " The Fund for young talents will cover about 2.5\\% of students in Serbia.", "after_sent": " The Fund for Young Talents will provide funding to about 2.5\\% of students in Serbia.", "before_sent_with_intent": "<clarity> Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded 250 a month. The secretary of the Serbian Student Union, Marko Milovanovi, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too . <S> The Fund for young talents will cover about 2.5\\% of students in Serbia. </S> ", "labels": "clarity", "doc_id": "15187", "revision_depth": 1} | |
| {"before_sent": " A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) .", "after_sent": " A video purporting to show the execution of 21 by supporters of (ISIL) .", "before_sent_with_intent": "<clarity> Flag of ISIL. <S> A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) . </S> The video shows the prisoners being beheaded in a location apparently near in . The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January.", "labels": "clarity", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": " A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) .", "after_sent": " A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) has been released yesterday .", "before_sent_with_intent": "<clarity> Flag of ISIL. <S> A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) . </S> The video shows the prisoners being beheaded in a location apparently near in . The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January.", "labels": "clarity", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": " The video shows the prisoners being beheaded in a location apparently near in .", "after_sent": " The video shows them being beheaded in a location apparently near in .", "before_sent_with_intent": "<style> Flag of ISIL. A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) . <S> The video shows the prisoners being beheaded in a location apparently near in . </S> The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January. The video indicates that the Christians were targeted by ISIL because of their religion.", "labels": "style", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": " The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January.", "after_sent": " The captives, all shown being executed in orange in the video, were picked up in , a coastal town in Libya, during December and January.", "before_sent_with_intent": "<style> A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) . The video shows the prisoners being beheaded in a location apparently near in . <S> The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January. </S> The video indicates that the Christians were targeted by ISIL because of their religion. The Coptic Orthodox Church stated they were \"confident\" justice would be carried out .", "labels": "style", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": " The video indicates that the Christians were targeted by ISIL because of their religion.", "after_sent": " The video asserts the Christians were targeted by ISIL because of their religion.", "before_sent_with_intent": "<clarity> The video shows the prisoners being beheaded in a location apparently near in . The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January. <S> The video indicates that the Christians were targeted by ISIL because of their religion. </S> The Coptic Orthodox Church stated they were \"confident\" justice would be carried out . 's President stated: \"Egypt and the whole world are in a fierce battle with extremist groups carrying extremist ideology and sharing the same goals\".", "labels": "clarity", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": " The Coptic Orthodox Church stated they were \"confident\" justice would be carried out .", "after_sent": " The Coptic Orthodox Church stated they were \"confident\" justice would be done on those who executed their followers .", "before_sent_with_intent": "<clarity> The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January. The video indicates that the Christians were targeted by ISIL because of their religion. <S> The Coptic Orthodox Church stated they were \"confident\" justice would be carried out . </S> 's President stated: \"Egypt and the whole world are in a fierce battle with extremist groups carrying extremist ideology and sharing the same goals\".", "labels": "clarity", "doc_id": "1928792", "revision_depth": 2} | |
| {"before_sent": "The for by reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery.", "after_sent": "The for , according reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery.", "before_sent_with_intent": "<clarity> <S> The for by reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery. </S> As reported, lawyer Marcos Cesar Feres Braga so-named by the newspaper working for the , was driving with his family through the suburb of near the main complex when the incident occurred. According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood.", "labels": "clarity", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": "The for by reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery.", "after_sent": "The for by reports disputed by the Russian Consul ; shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery.", "before_sent_with_intent": "<fluency> <S> The for by reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery. </S> As reported, lawyer Marcos Cesar Feres Braga so-named by the newspaper working for the , was driving with his family through the suburb of near the main complex when the incident occurred. According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood.", "labels": "fluency", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " As reported, lawyer Marcos Cesar Feres Braga so-named by the newspaper working for the , was driving with his family through the suburb of near the main complex when the incident occurred.", "after_sent": " lawyer Marcos Cesar Feres Braga so-named by the newspaper working for the , was driving with his family through the suburb of near the main complex when the incident occurred.", "before_sent_with_intent": "<coherence> The for by reports disputed by the Russian Consul shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery. <S> As reported, lawyer Marcos Cesar Feres Braga so-named by the newspaper working for the , was driving with his family through the suburb of near the main complex when the incident occurred. </S> According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood. Two individuals on motorbikes approached and used a gun to smash the car window.", "labels": "coherence", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene.", "after_sent": " Braga, trained in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene.", "before_sent_with_intent": "<clarity> According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood. Two individuals on motorbikes approached and used a gun to smash the car window. <S> Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene. </S> Rio de Janeiro's homicide branch has released a statement in relation to the incident. \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots.", "labels": "clarity", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene.", "after_sent": " Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot and kill the alleged attacker, while the second suspect fled the scene.", "before_sent_with_intent": "<clarity> According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood. Two individuals on motorbikes approached and used a gun to smash the car window. <S> Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene. </S> Rio de Janeiro's homicide branch has released a statement in relation to the incident. \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots.", "labels": "clarity", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots.", "after_sent": " \"The vice consul got into a physical struggle with the assailant , and during the fight the aggressor's weapon fired shots.", "before_sent_with_intent": "<fluency> Braga, trained and considered an expert according to reports in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene. Rio de Janeiro's homicide branch has released a statement in relation to the incident. <S> \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots. </S> The assailant died of his wounds on the spot.\" However, Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident.", "labels": "fluency", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " However, Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident.", "after_sent": " Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident.", "before_sent_with_intent": "<coherence> \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots. The assailant died of his wounds on the spot.\" <S> However, Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident. </S> \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality \".", "labels": "coherence", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": " \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality \".", "after_sent": " \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality .\"", "before_sent_with_intent": "<fluency> The assailant died of his wounds on the spot.\" However, Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident. <S> \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality \". </S> ", "labels": "fluency", "doc_id": "2795820", "revision_depth": 2} | |
| {"before_sent": "Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the portuguese economy.\"", "after_sent": "Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the Portuguese economy.\"", "before_sent_with_intent": "<fluency> <S> Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the portuguese economy.\" </S> Volkswagen will reveal the new model to be produced next week. By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models.", "labels": "fluency", "doc_id": "31572", "revision_depth": 1} | |
| {"before_sent": " By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models.", "after_sent": " By 2008 , the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models.", "before_sent_with_intent": "<fluency> Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the portuguese economy.\" Volkswagen will reveal the new model to be produced next week. <S> By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models. </S> With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "labels": "fluency", "doc_id": "31572", "revision_depth": 1} | |
| {"before_sent": " By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models.", "after_sent": " By 2008 the factory at Palmela will only be producing the multi-purpose vehicle Sharan and the Eos models.", "before_sent_with_intent": "<clarity> Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the portuguese economy.\" Volkswagen will reveal the new model to be produced next week. <S> By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models. </S> With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "labels": "clarity", "doc_id": "31572", "revision_depth": 1} | |
| {"before_sent": " With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "after_sent": " With the end of the production of the multi-purpose vehicle, the factory needs to guarantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "before_sent_with_intent": "<fluency> Volkswagen will reveal the new model to be produced next week. By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models. <S> With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers. </S> ", "labels": "fluency", "doc_id": "31572", "revision_depth": 1} | |
| {"before_sent": " With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "after_sent": " With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is not sufficient to maintain the current 2,790 workers.", "before_sent_with_intent": "<style> Volkswagen will reveal the new model to be produced next week. By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models. <S> With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers. </S> ", "labels": "style", "doc_id": "31572", "revision_depth": 1} | |
| {"before_sent": "David Parker today resigned from Cabinet;", "after_sent": "David Parker resigned today from Cabinet,", "before_sent_with_intent": "<clarity> <S> David Parker today resigned from Cabinet; </S> a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. The declaration said that ;", "labels": "clarity", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited.", "after_sent": " a day after he resigned his position as Attorney-General and after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited.", "before_sent_with_intent": "<coherence> David Parker today resigned from Cabinet; <S> a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. </S> The declaration said that ; the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter.", "labels": "coherence", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited.", "after_sent": " a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration with the Companies Office on behalf of Queens Park Mews Limited.", "before_sent_with_intent": "<fluency> David Parker today resigned from Cabinet; <S> a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. </S> The declaration said that ; the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " The declaration said that ;", "after_sent": " The declaration said that ", "before_sent_with_intent": "<fluency> David Parker today resigned from Cabinet; a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. <S> The declaration said that ; </S> the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. Parker was saying early this morning , that he would persist to hold his other portfolios.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter.", "after_sent": " the three shareholders had unanimously agreed not to appoint an auditor for the company ; but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter.", "before_sent_with_intent": "<fluency> a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. The declaration said that ; <S> the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. </S> Parker was saying early this morning , that he would persist to hold his other portfolios. Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter.", "after_sent": " the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder , Russell Hyslop, had never been consulted about the matter.", "before_sent_with_intent": "<fluency> a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. The declaration said that ; <S> the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. </S> Parker was saying early this morning , that he would persist to hold his other portfolios. Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " Parker was saying early this morning , that he would persist to hold his other portfolios.", "after_sent": " Parker was saying early this morning that he would persist to hold his other portfolios.", "before_sent_with_intent": "<fluency> The declaration said that ; the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. <S> Parker was saying early this morning , that he would persist to hold his other portfolios. </S> Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " Parker was saying early this morning , that he would persist to hold his other portfolios.", "after_sent": " Parker was saying early this morning , that he would persist in holding his other portfolios.", "before_sent_with_intent": "<clarity> The declaration said that ; the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. <S> Parker was saying early this morning , that he would persist to hold his other portfolios. </S> Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act.", "labels": "clarity", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting.", "after_sent": " Prime Minister Helen Clark released the news shortly before 11 a.m. (NZST) as she walked into a caucus meeting.", "before_sent_with_intent": "<fluency> the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. Parker was saying early this morning , that he would persist to hold his other portfolios. <S> Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. </S> She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act.", "after_sent": " She said, \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act.", "before_sent_with_intent": "<fluency> Parker was saying early this morning , that he would persist to hold his other portfolios. Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. <S> She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. </S> The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "labels": "fluency", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "after_sent": " The maximum penalty under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "before_sent_with_intent": "<clarity> Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. <S> The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment. </S> ", "labels": "clarity", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": " The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "after_sent": " The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or five years of imprisonment.", "before_sent_with_intent": "<clarity> Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. <S> The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment. </S> ", "labels": "clarity", "doc_id": "36498", "revision_depth": 1} | |
| {"before_sent": "According to BBC NEWS , Merseyside police have apparently been called in and are working with the Crown Prosecution Service.", "after_sent": "According to BBC News , Merseyside police have apparently been called in and are working with the Crown Prosecution Service.", "before_sent_with_intent": "<fluency> <S> According to BBC NEWS , Merseyside police have apparently been called in and are working with the Crown Prosecution Service. </S> As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter.", "labels": "fluency", "doc_id": "47188", "revision_depth": 1} | |
| {"before_sent": " An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter.", "after_sent": " An earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter.", "before_sent_with_intent": "<fluency> According to BBC NEWS , Merseyside police have apparently been called in and are working with the Crown Prosecution Service. As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. <S> An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter. </S> Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems.", "labels": "fluency", "doc_id": "47188", "revision_depth": 1} | |
| {"before_sent": " An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter.", "after_sent": " An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather than criminal matter.", "before_sent_with_intent": "<fluency> According to BBC NEWS , Merseyside police have apparently been called in and are working with the Crown Prosecution Service. As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. <S> An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter. </S> Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems.", "labels": "fluency", "doc_id": "47188", "revision_depth": 1} | |
| {"before_sent": " Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems.", "after_sent": " Liverpool City Council, has so far declined to comment on the sites disappearance , although the site had been previosuly blocked from the council's IT systems.", "before_sent_with_intent": "<fluency> As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter. <S> Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems. </S> ", "labels": "fluency", "doc_id": "47188", "revision_depth": 1} | |
| {"before_sent": " Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems.", "after_sent": " Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previously blocked from the council's IT systems.", "before_sent_with_intent": "<fluency> As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter. <S> Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems. </S> ", "labels": "fluency", "doc_id": "47188", "revision_depth": 1} | |
| {"before_sent": "Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press.", "after_sent": "Hewlett-Packard (HP) is embroiled in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press.", "before_sent_with_intent": "<clarity> <S> Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press. </S> The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records.", "labels": "clarity", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": "Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press.", "after_sent": "Hewlett-Packard is in a scandal over the alleged illegal investigation of its own board members over leaks from the board to the press.", "before_sent_with_intent": "<fluency> <S> Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press. </S> The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records.", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors.", "after_sent": " The companys admits that it hired private investigators and that they used pretexting to get private phone records of its own directors.", "before_sent_with_intent": "<fluency> Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press. <S> The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. </S> Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records. It is illegal in the State of California.", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records.", "after_sent": " 'Pretexting' is where someone pretends to be the customer when calling the phone company to get their phone records.", "before_sent_with_intent": "<fluency> Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press. The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. <S> Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records. </S> It is illegal in the State of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists.", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " It is illegal in the State of California.", "after_sent": " It is illegal in the state of California.", "before_sent_with_intent": "<fluency> The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records. <S> It is illegal in the State of California. </S> The aim of the HP investigation was to find out which director(s) had leaked information to journalists. VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "after_sent": " Venture Capitalist investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "before_sent_with_intent": "<clarity> It is illegal in the State of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists. <S> VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. </S> The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "labels": "clarity", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "after_sent": " VC investor Tom Perkins resigned from the board on May 22, 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "before_sent_with_intent": "<fluency> It is illegal in the State of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists. <S> VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. </S> The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry.", "after_sent": " VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in its leak inquiry.", "before_sent_with_intent": "<fluency> It is illegal in the State of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists. <S> VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. </S> The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "labels": "fluency", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "after_sent": " The Federal Communications Commission is looking into phone companies who may have supplied the phone records illegally under California law. So", "before_sent_with_intent": "<clarity> The aim of the HP investigation was to find out which director(s) had leaked information to journalists. VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. <S> The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So </S> ", "labels": "clarity", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "after_sent": " The FCC is looking into phone companies who may have supplied the phone records illegally under California law. ", "before_sent_with_intent": "<coherence> The aim of the HP investigation was to find out which director(s) had leaked information to journalists. VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. <S> The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So </S> ", "labels": "coherence", "doc_id": "49966", "revision_depth": 1} | |
| {"before_sent": " 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany.", "after_sent": "A 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany.", "before_sent_with_intent": "<fluency> <S> 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany. </S> His self-immolation was apparently to protest against the spread of Islam, which he felt the Protestant church should take more seriously. His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany.", "labels": "fluency", "doc_id": "54370", "revision_depth": 1} | |
| {"before_sent": " His self-immolation was apparently to protest against the spread of Islam, which he felt the Protestant church should take more seriously.", "after_sent": " His self-immolation was apparently in protest against the spread of Islam, which he felt the Protestant church should take more seriously.", "before_sent_with_intent": "<fluency> 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany. <S> His self-immolation was apparently to protest against the spread of Islam, which he felt the Protestant church should take more seriously. </S> His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany. He was transported to a burns unit in Halle but died en route.", "labels": "fluency", "doc_id": "54370", "revision_depth": 1} | |
| {"before_sent": " His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany.", "after_sent": " His last words were \"Jesus and Oskar,\" , believed to a reference to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany.", "before_sent_with_intent": "<style> 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany. His self-immolation was apparently to protest against the spread of Islam, which he felt the Protestant church should take more seriously. <S> His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany. </S> He was transported to a burns unit in Halle but died en route. Reverend Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation.", "labels": "style", "doc_id": "54370", "revision_depth": 1} | |
| {"before_sent": " Reverend Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation.", "after_sent": " Rev. Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation.", "before_sent_with_intent": "<clarity> His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany. He was transported to a burns unit in Halle but died en route. <S> Reverend Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation. </S> Axel Noack, Bishop of Saxony, said that he was shocked at Rev. Weisselberg's self-immolation, stressing that Christians could not accept a \"clash of cultures\". He confessed that the issue of Islam had been sidelined within the Church and was only spoken about in private.", "labels": "clarity", "doc_id": "54370", "revision_depth": 1} | |
| {"before_sent": " There were few Muslims there with whom they could engage in dialogue, Noack claimed .", "after_sent": " There were few Muslims there with whom they could engage in dialogue, Noack said .", "before_sent_with_intent": "<style> Axel Noack, Bishop of Saxony, said that he was shocked at Rev. Weisselberg's self-immolation, stressing that Christians could not accept a \"clash of cultures\". He confessed that the issue of Islam had been sidelined within the Church and was only spoken about in private. <S> There were few Muslims there with whom they could engage in dialogue, Noack claimed . </S> ", "labels": "style", "doc_id": "54370", "revision_depth": 1} | |
| {"before_sent": "Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area.", "after_sent": "Nine people are confirmed dead in a fire in a leather bag factory in Kolkata's South 24 Pargana district in Topsia area.", "before_sent_with_intent": "<fluency> <S> Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area. </S> Eighteen people were seriously injured and admitted to National Medical College and Hospital. Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed.", "labels": "fluency", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " Eighteen people were seriously injured and admitted to National Medical College and Hospital.", "after_sent": " Eighteen people were seriously injured and admitted to the National Medical College and Hospital.", "before_sent_with_intent": "<fluency> Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area. <S> Eighteen people were seriously injured and admitted to National Medical College and Hospital. </S> Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed. Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building.", "labels": "fluency", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed.", "after_sent": " Inspector General of Police (Law and Order) Raj Kanojia said that the fire broke out at about 3 am when the victims were inside the factory and all the doors were closed.", "before_sent_with_intent": "<fluency> Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area. Eighteen people were seriously injured and admitted to National Medical College and Hospital. <S> Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed. </S> Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. At the time of fire, all the premises were closed and workers could not come out from the factory.", "labels": "fluency", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed.", "after_sent": " Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 a.m. local time, when the victims were inside the factory and all the doors were closed.", "before_sent_with_intent": "<clarity> Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area. Eighteen people were seriously injured and admitted to National Medical College and Hospital. <S> Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed. </S> Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. At the time of fire, all the premises were closed and workers could not come out from the factory.", "labels": "clarity", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " At the time of fire, all the premises were closed and workers could not come out from the factory.", "after_sent": " At the time of fire, all the exits were shut and workers could not come out from the factory.", "before_sent_with_intent": "<clarity> Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed. Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. <S> At the time of fire, all the premises were closed and workers could not come out from the factory. </S> The cause of the fire was yet to be ascertained. Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory .", "labels": "clarity", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " The cause of the fire was yet to be ascertained.", "after_sent": " The cause of the fire is yet to be ascertained.", "before_sent_with_intent": "<fluency> Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. At the time of fire, all the premises were closed and workers could not come out from the factory. <S> The cause of the fire was yet to be ascertained. </S> Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory .", "labels": "fluency", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory .", "after_sent": " Kolkata Mayor Bikash Ranjan Bhattacharya suggested that a short circuit or an unattended cigarette causing fire in the factory .", "before_sent_with_intent": "<clarity> At the time of fire, all the premises were closed and workers could not come out from the factory. The cause of the fire was yet to be ascertained. <S> Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory . </S> ", "labels": "clarity", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory .", "after_sent": " Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette may have caused the fire .", "before_sent_with_intent": "<clarity> At the time of fire, all the premises were closed and workers could not come out from the factory. The cause of the fire was yet to be ascertained. <S> Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory . </S> ", "labels": "clarity", "doc_id": "55265", "revision_depth": 1} | |
| {"before_sent": " It is also \"any of the large bodies of water into which the great ocean is divided\".", "after_sent": " Another definition is \"any of the large bodies of water into which the great ocean is divided\".", "before_sent_with_intent": "<coherence> The ocean (also the sea or the world ocean) is the body of salt water which covers approximately 71\\% of the surface of the Earth and contains 97\\% of Earth's water. <S> It is also \"any of the large bodies of water into which the great ocean is divided\". </S> \"Ocean.\" Merriam-Webster.com Dictionary, Merriam-Webster, URL Accessed March 14, 2021. A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans .", "labels": "coherence", "doc_id": "18842359", "revision_depth": 1} | |
| {"before_sent": " A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans .", "after_sent": " The ocean is divided into five oceans: Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans .", "before_sent_with_intent": "<clarity> It is also \"any of the large bodies of water into which the great ocean is divided\". \"Ocean.\" Merriam-Webster.com Dictionary, Merriam-Webster, URL Accessed March 14, 2021. <S> A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans . </S> Seawater covers approximately of the Earth. As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth, forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 1} | |
| {"before_sent": " A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans .", "after_sent": " A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest) .", "before_sent_with_intent": "<clarity> It is also \"any of the large bodies of water into which the great ocean is divided\". \"Ocean.\" Merriam-Webster.com Dictionary, Merriam-Webster, URL Accessed March 14, 2021. <S> A common definition lists five oceans, in descending order by area, the Pacific , Atlantic, Indian, Southern (Antarctic), and Arctic Oceans . </S> Seawater covers approximately of the Earth. As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth, forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 1} | |
| {"before_sent": " The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest).", "after_sent": " Separate names are used to identify five different areas of the ocean : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest).", "before_sent_with_intent": "<clarity> Another definition is \"any of the large bodies of water into which the great ocean is divided\". \"Ocean.\" Merriam-Webster.com Dictionary, Merriam-Webster, URL Accessed March 14, 2021. <S> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). </S> Seawater covers approximately of the Earth. As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest).", "after_sent": " The ocean is divided into five oceans : Pacific (the largest) Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest).", "before_sent_with_intent": "<fluency> Another definition is \"any of the large bodies of water into which the great ocean is divided\". \"Ocean.\" Merriam-Webster.com Dictionary, Merriam-Webster, URL Accessed March 14, 2021. <S> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). </S> Seawater covers approximately of the Earth. As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "labels": "fluency", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "after_sent": " The ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "before_sent_with_intent": "<clarity> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). Seawater covers approximately of the Earth. <S> As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns. </S> Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions. The pelagic zone consists of the water column of the open ocean, and can be divided into further regions categorized by light abundance and by depth.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "after_sent": " As the world's ocean is the principal component of Earth's hydrosphere, and therefore integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "before_sent_with_intent": "<clarity> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). Seawater covers approximately of the Earth. <S> As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns. </S> Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions. The pelagic zone consists of the water column of the open ocean, and can be divided into further regions categorized by light abundance and by depth.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "after_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth . The ocean is a huge heat reservoir - influences climate and weather patterns.", "before_sent_with_intent": "<coherence> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). Seawater covers approximately of the Earth. <S> As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns. </S> Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions. The pelagic zone consists of the water column of the open ocean, and can be divided into further regions categorized by light abundance and by depth.", "labels": "coherence", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns.", "after_sent": " As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir and influences climate and weather patterns.", "before_sent_with_intent": "<fluency> The ocean is divided into five oceans : Pacific (the largest) , Atlantic, Indian, Southern (Antarctic), and Arctic (the smallest). Seawater covers approximately of the Earth. <S> As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns. </S> Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions. The pelagic zone consists of the water column of the open ocean, and can be divided into further regions categorized by light abundance and by depth.", "labels": "fluency", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions.", "after_sent": " Oceanographers divide the ocean into different vertical and horizontal zones based on physical and biological conditions.", "before_sent_with_intent": "<clarity> Seawater covers approximately of the Earth. As the world's ocean is the principal component of Earth's hydrosphere, it is integral to life on Earth , forms part of the carbon cycle and water cycle, and - as a huge heat reservoir - influences climate and weather patterns. <S> Oceanographers divide the ocean into different vertical and horizontal zones defined by physical and biological conditions. </S> The pelagic zone consists of the water column of the open ocean, and can be divided into further regions categorized by light abundance and by depth. The photic zone includes the oceans from the surface to a depth of 200m;", "labels": "clarity", "doc_id": "18842359", "revision_depth": 2} | |
| {"before_sent": " The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth.", "after_sent": " The pelagic zone consists of the water column from surface to ocean floor throughout the open ocean , and can be divided into further regions categorized by light abundance and by depth.", "before_sent_with_intent": "<clarity> Oceanographers divide the ocean into different vertical and horizontal zones based on physical and biological conditions. <S> The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth. </S> The photic zone includes the oceans from the surface to a depth of 200m ; it is the region where photosynthesis can occur and is, therefore, the most biodiverse.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth.", "after_sent": " The pelagic zone consists of the water column of the open ocean . The water column is further categorized in other zones depending on light abundance and by depth.", "before_sent_with_intent": "<coherence> Oceanographers divide the ocean into different vertical and horizontal zones based on physical and biological conditions. <S> The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth. </S> The photic zone includes the oceans from the surface to a depth of 200m ; it is the region where photosynthesis can occur and is, therefore, the most biodiverse.", "labels": "coherence", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth.", "after_sent": " The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and depth.", "before_sent_with_intent": "<fluency> Oceanographers divide the ocean into different vertical and horizontal zones based on physical and biological conditions. <S> The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth. </S> The photic zone includes the oceans from the surface to a depth of 200m ; it is the region where photosynthesis can occur and is, therefore, the most biodiverse.", "labels": "fluency", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The photic zone includes the oceans from the surface to a depth of 200m ;", "after_sent": " The photic zone includes the water column from the surface to a depth of 200m ;", "before_sent_with_intent": "<clarity> Oceanographers divide the ocean into different vertical and horizontal zones based on physical and biological conditions. The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth. <S> The photic zone includes the oceans from the surface to a depth of 200m ; </S> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " it is the region where photosynthesis can occur and is, therefore, the most biodiverse.", "after_sent": " it is the region where photosynthesis can occur . This makes the photic zone the most biodiverse.", "before_sent_with_intent": "<clarity> The pelagic zone consists of the water column of the open ocean , and can be divided into further regions categorized by light abundance and by depth. The photic zone includes the oceans from the surface to a depth of 200m ; <S> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. </S> Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "after_sent": " This upper sunlit zone of the ocean ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "before_sent_with_intent": "<clarity> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. <S> It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. </S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "after_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a depth of a few hundred meters depth , so the remaining ocean below this is cold and dark.", "before_sent_with_intent": "<clarity> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. <S> It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. </S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "after_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters , so the remaining ocean below this is cold and dark.", "before_sent_with_intent": "<clarity> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. <S> It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. </S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark.", "after_sent": " It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below is cold and dark.", "before_sent_with_intent": "<clarity> it is the region where photosynthesis can occur and is, therefore, the most biodiverse. Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. <S> It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. </S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "after_sent": " The continental shelf where the ocean touches land is more shallow (a few hundred meters or less) and this region is most impacted by human activity.", "before_sent_with_intent": "<clarity> Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. <S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity. </S> ", "labels": "clarity", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity.", "after_sent": " The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and experiences more impact from human activity.", "before_sent_with_intent": "<style> Photosynthesis by plants and microscopic algae (free floating phytoplankton) allows them to URLanic matter from chemical precursors including water and carbon dioxide. It is this upper sunlit ocean that creates the food supply that ultimately sustains most of the ocean ecosystem . Light only penetrates to a few hundred meters depth , so the remaining ocean below this is cold and dark. <S> The continental shelf around the edge of the oceans is shallower (a few hundred meters or less) and this region is most impacted by human activity. </S> ", "labels": "style", "doc_id": "18842359", "revision_depth": 3} | |
| {"before_sent": " The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and the concentration of salt .", "after_sent": " The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and salinity .", "before_sent_with_intent": "<clarity> During study of fluid mechanics, researchers attempted to give a correct vision of maritime currents. <S> The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and the concentration of salt . </S> The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "labels": "clarity", "doc_id": "43193013", "revision_depth": 1} | |
| {"before_sent": " The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "after_sent": " The study of currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "before_sent_with_intent": "<clarity> During study of fluid mechanics, researchers attempted to give a correct vision of maritime currents. The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and the concentration of salt . <S> The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance. </S> ", "labels": "clarity", "doc_id": "43193013", "revision_depth": 1} | |
| {"before_sent": " The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "after_sent": " The study of these currents, combined with other factors such as tides and waves is relevant for understanding marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "before_sent_with_intent": "<clarity> During study of fluid mechanics, researchers attempted to give a correct vision of maritime currents. The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and the concentration of salt . <S> The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance. </S> ", "labels": "clarity", "doc_id": "43193013", "revision_depth": 1} | |
| {"before_sent": " The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance.", "after_sent": " The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and linked processes such as sediment transport and climate balance.", "before_sent_with_intent": "<clarity> During study of fluid mechanics, researchers attempted to give a correct vision of maritime currents. The origin of currents is owed to physical differences between various water masses, the main parameter being the difference of density that varies in function of the temperature and the concentration of salt . <S> The study of these currents, combined with other factors such as tides (producing a change in sea level) and wind (originally swell) for understanding the marine hydrodynamics and different processes which are linked there as sediment movement and the climate balance. </S> ", "labels": "clarity", "doc_id": "43193013", "revision_depth": 1} | |
| {"before_sent": "A trainee is commonly known as an individual taking part in a trainee program or a graduate program within a company after having graduated from university or college .", "after_sent": "A trainee is commonly known as an individual taking part in a trainee program within URLanization after having graduated from university or college .", "before_sent_with_intent": "<clarity> <S> A trainee is commonly known as an individual taking part in a trainee program or a graduate program within a company after having graduated from university or college . </S> A trainee is an official employee of the firm that is being trained to the job they were originally hired for. Literally, a trainee is an employee in training.", "labels": "clarity", "doc_id": "4914567", "revision_depth": 1} | |
| {"before_sent": "A trainee is commonly known as an individual taking part in a trainee program or a graduate program within a company after having graduated from university or college .", "after_sent": "A trainee is commonly known as an individual taking part in a trainee program or a graduate program within a company after having graduated from higher and technical courses .", "before_sent_with_intent": "<clarity> <S> A trainee is commonly known as an individual taking part in a trainee program or a graduate program within a company after having graduated from university or college . </S> A trainee is an official employee of the firm that is being trained to the job they were originally hired for. Literally, a trainee is an employee in training.", "labels": "clarity", "doc_id": "4914567", "revision_depth": 1} | |
| {"before_sent": " Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over.", "after_sent": " Trainee programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over.", "before_sent_with_intent": "<clarity> A trainee is an official employee of the firm that is being trained to the job they were originally hired for. Literally, a trainee is an employee in training. <S> Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over. </S> Often used as an insurance measure by companies, firms typically will have a trainee period (23 months) where the person is still being evaluated after which an official decision to hire on a permanent basis is made.", "labels": "clarity", "doc_id": "4914567", "revision_depth": 1} | |
| {"before_sent": " Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over.", "after_sent": " Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee position has a varied duration depending on the company's program . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over.", "before_sent_with_intent": "<clarity> A trainee is an official employee of the firm that is being trained to the job they were originally hired for. Literally, a trainee is an employee in training. <S> Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over. </S> Often used as an insurance measure by companies, firms typically will have a trainee period (23 months) where the person is still being evaluated after which an official decision to hire on a permanent basis is made.", "labels": "clarity", "doc_id": "4914567", "revision_depth": 1} | |
| {"before_sent": " Often used as an insurance measure by companies, firms typically will have a trainee period (23 months) where the person is still being evaluated after which an official decision to hire on a permanent basis is made.", "after_sent": " Often used as an insurance measure by companies, firms typically will have a trainee period where the person is still being evaluated after which an official decision to hire on a permanent basis is made.", "before_sent_with_intent": "<clarity> Literally, a trainee is an employee in training. Trainee programs and graduate programs are arranged by private companies and public sector employers where the trainee is offered the possibility to take part 6 to 20 months training programs . During the duration of these programs, the trainee is expected to receive a salary as well as is expected to have full-time employment awaiting in the company when the program is over. <S> Often used as an insurance measure by companies, firms typically will have a trainee period (23 months) where the person is still being evaluated after which an official decision to hire on a permanent basis is made. </S> ", "labels": "clarity", "doc_id": "4914567", "revision_depth": 1} | |
| {"before_sent": "Thenumgal Poulose Jacob is an Indian surgeon specialized in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College.", "after_sent": "Thenumgal Poulose Jacob is an Indian surgeon specializing in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College.", "before_sent_with_intent": "<fluency> <S> Thenumgal Poulose Jacob is an Indian surgeon specialized in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College. </S> Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution. He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head till his superannuation in 1993.", "labels": "fluency", "doc_id": "51157723", "revision_depth": 1} | |
| {"before_sent": " Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution.", "after_sent": " Born in Aluva, in the south Indian state of Kerala , to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution.", "before_sent_with_intent": "<fluency> Thenumgal Poulose Jacob is an Indian surgeon specialized in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College. <S> Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution. </S> He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head till his superannuation in 1993. The Government of India awarded him the fourth highest civilian honour of the Padma Shri, in 2014, for his contributions to medical science.", "labels": "fluency", "doc_id": "51157723", "revision_depth": 1} | |
| {"before_sent": " Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution.", "after_sent": " Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai , and secured his MS degree from the same institution.", "before_sent_with_intent": "<fluency> Thenumgal Poulose Jacob is an Indian surgeon specialized in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College. <S> Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution. </S> He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head till his superannuation in 1993. The Government of India awarded him the fourth highest civilian honour of the Padma Shri, in 2014, for his contributions to medical science.", "labels": "fluency", "doc_id": "51157723", "revision_depth": 1} | |
| {"before_sent": " He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head till his superannuation in 1993.", "after_sent": " He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head until his superannuation in 1993.", "before_sent_with_intent": "<fluency> Thenumgal Poulose Jacob is an Indian surgeon specialized in vascular surgery, and the founder Head of the Department of Vascular Surgery at Madras Medical College. Born in Aluva, in the south Indian state of Kerala to Thenumgal Poulose and Mariam in a Malayali family, he did his under-graduate studies at UC College before graduating in medicine from Stanley Medical College, Chennai and secured his MS degree from the same institution. <S> He started his practice under government service at Madras Medical College where he helped establish the department of vascular surgery in 1978 and served as its founder head till his superannuation in 1993. </S> The Government of India awarded him the fourth highest civilian honour of the Padma Shri, in 2014, for his contributions to medical science. He is married to Esther and the couple has a daughter, Siji Jacob, an academic and a son, Hasum Jacob Thenumgal, an engineer at TCS.", "labels": "fluency", "doc_id": "51157723", "revision_depth": 1} | |
| {"before_sent": " He is doing private practice at T. P. Jacob Clinic in Royapuram, Chennai and is also a consultant vascular surgeon at MV Hospitals for Diabetes, Royapuram.", "after_sent": " He is in private practice at T. P. Jacob Clinic in Royapuram, Chennai and is also a consultant vascular surgeon at MV Hospitals for Diabetes, Royapuram.", "before_sent_with_intent": "<fluency> The Government of India awarded him the fourth highest civilian honour of the Padma Shri, in 2014, for his contributions to medical science. He is married to Esther and the couple has a daughter, Siji Jacob, an academic and a son, Hasum Jacob Thenumgal, an engineer at TCS. <S> He is doing private practice at T. P. Jacob Clinic in Royapuram, Chennai and is also a consultant vascular surgeon at MV Hospitals for Diabetes, Royapuram. </S> ", "labels": "fluency", "doc_id": "51157723", "revision_depth": 1} | |
| {"before_sent": " is a model and endorser in Philippines ,", "after_sent": " is a model and endorser in Philippines .", "before_sent_with_intent": "<fluency> Philippines), or better known as Fhrancis Lopez, <S> is a model and endorser in Philippines , </S> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " He is known as one of the winners in Mister Philippines 2011,", "after_sent": " He is known for being one of the winners in Mister Philippines 2011,", "before_sent_with_intent": "<clarity> or better known as Fhrancis Lopez, is a model and endorser in Philippines , <S> He is known as one of the winners in Mister Philippines 2011, </S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "clarity", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal . Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<coherence> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "coherence", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila . Before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<fluency> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis worked as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<fluency> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model . Fhrancis and his agency signed a contract with the Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<coherence> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "coherence", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<clarity> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "clarity", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management . After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<fluency> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held a pageant in Patravadi Theatre. Lopez is one of the finalists Top 16 in Mister International 2011.", "before_sent_with_intent": "<fluency> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the Top 16 in Mister International 2011.", "before_sent_with_intent": "<coherence> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "coherence", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011.", "after_sent": " which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 finalists in Mister International 2011.", "before_sent_with_intent": "<clarity> is a model and endorser in Philippines , He is known as one of the winners in Mister Philippines 2011, <S> which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. </S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "labels": "clarity", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "after_sent": " Mister Philippines 2011 & Mister International 2011 Lopez was declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "before_sent_with_intent": "<fluency> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. <S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok. </S> ", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "after_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winners of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "before_sent_with_intent": "<fluency> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. <S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok. </S> ", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "after_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011. After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "before_sent_with_intent": "<fluency> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. <S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok. </S> ", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "after_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined to compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "before_sent_with_intent": "<fluency> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. <S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok. </S> ", "labels": "fluency", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok.", "after_sent": " Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant in Pattaya, Thailand and Bangkok.", "before_sent_with_intent": "<coherence> He is known as one of the winners in Mister Philippines 2011, which is made to the audience of his appeal , he is look a like an actor in the Philippines, JM de URL Biography Lopez was born and raised in the southern tip of Metro Manila , before he joined the pageant of Mister Philippines, Fhrancis work as a model and he signing contracted in a Go Green Artists his agency and the Project Management , After he won and got the prize, Fhrancis held pageant of Patravadi Theatre, Lopez is one of the finalists Top 16 in Mister International 2011. <S> Mister Philippines 2011 & Mister International 2011 Lopez declared as one of the winner of Mister Philippines 2011, After he won the competition on December 17, 2011, Lopez joined the compete in the Mister International 2011 pageant which is happening in Pattaya, Thailand and Bangkok. </S> ", "labels": "coherence", "doc_id": "51355210", "revision_depth": 1} | |
| {"before_sent": " Paderap has four sons, namely Tuanku Jalaluddin (or Kejuruan Metar), Tuanku Panglima Pasutan (or Kejuruan Padang), Tuanku Tawar (or Kejuruan Santun), and Tuanku Umar (or Kejuruan Junjongan).", "after_sent": " Paderap had four sons, namely Tuanku Jalaluddin (or Kejuruan Metar), Tuanku Panglima Pasutan (or Kejuruan Padang), Tuanku Tawar (or Kejuruan Santun), and Tuanku Umar (or Kejuruan Junjongan).", "before_sent_with_intent": "<fluency> Tuanku Panglima Paderap, also called Panglima Deli, was the third ruler of the Deli Sultanate, now part of North Sumatra, Indonesia. He succeeded his father Tuanku Panglima Perunggit, who died around 1700. <S> Paderap has four sons, namely Tuanku Jalaluddin (or Kejuruan Metar), Tuanku Panglima Pasutan (or Kejuruan Padang), Tuanku Tawar (or Kejuruan Santun), and Tuanku Umar (or Kejuruan Junjongan). </S> A power struggle happened in the Deli after Paderap died in 1720. Jalaluddin, Paderap's first son, cannot replace him because of a physical disability.", "labels": "fluency", "doc_id": "65581384", "revision_depth": 1} | |
| {"before_sent": " Jalaluddin, Paderap's first son, cannot replace him because of a physical disability.", "after_sent": " Jalaluddin, Paderap's first son, could not replace him because of a physical disability.", "before_sent_with_intent": "<fluency> Paderap has four sons, namely Tuanku Jalaluddin (or Kejuruan Metar), Tuanku Panglima Pasutan (or Kejuruan Padang), Tuanku Tawar (or Kejuruan Santun), and Tuanku Umar (or Kejuruan Junjongan). A power struggle happened in the Deli after Paderap died in 1720. <S> Jalaluddin, Paderap's first son, cannot replace him because of a physical disability. </S> In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate.", "labels": "fluency", "doc_id": "65581384", "revision_depth": 1} | |
| {"before_sent": " In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate.", "after_sent": " It was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate.", "before_sent_with_intent": "<clarity> A power struggle happened in the Deli after Paderap died in 1720. Jalaluddin, Paderap's first son, cannot replace him because of a physical disability. <S> In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate. </S> ", "labels": "clarity", "doc_id": "65581384", "revision_depth": 1} | |
| {"before_sent": " In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate.", "after_sent": " In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar became the first ruler of the Serdang Sultanate.", "before_sent_with_intent": "<clarity> A power struggle happened in the Deli after Paderap died in 1720. Jalaluddin, Paderap's first son, cannot replace him because of a physical disability. <S> In the end, it was Pasutan who became the fourth ruler of Deli, while his younger brother Umar got a separate territory and became the first ruler of the Serdang Sultanate. </S> ", "labels": "clarity", "doc_id": "65581384", "revision_depth": 1} | |