wanyu/IteraTeR_v2 huggingface dataset:
Original:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other textual resources .
Revised:  Automatic text summarization tools can help users in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other textual resources .
Edit intent: clarity
Original:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other textual resources .
Revised:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access information efficiently from the large volume of scientific literature and other textual resources .
Edit intent: clarity
Original:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other textual resources .
Revised:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from a large volume of scientific literature and other textual resources .
Edit intent: fluency
Original:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other textual resources .
Revised:  Automatic text summarization helps the clinicians and researchers in the biomedical domain to access the intended information efficiently from the large volume of scientific literature and other sources of text documents .
Edit intent: clarity
Original:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then,  the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Revised:  To address the concept-level analysis of text, our method initially maps the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then, the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Edit intent: clarity
Original:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then,  the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Revised:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the UMLS . Then, the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Edit intent: clarity
Original:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then,  the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Revised:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then, it discovers the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Edit intent: clarity
Original:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then,  the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Revised:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then, the essential subtopics of the text using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Edit intent: clarity
Original:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then,  the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and the conceptual modelis constructed .
Revised:  To address the concept-level analysis of text, we map the original document to biomedical concepts using the Unified Medical Language System (UMLS) . Then, the essential subtopics of text are discovered using a data mining technique, namely itemset mining, and constructs the summarization model .
Edit intent: clarity
Original:  The employed itemset mining algorithm supplies a set of frequent itemsets containing correlated and recurrent concepts of the input document.
Revised:  The employed itemset mining algorithm extracts a set of frequent itemsets containing correlated and recurrent concepts of the input document.
Edit intent: clarity
Original:  The final summary is created by selecting the most related and informative sentences .
Revised:  The summarizer selects the most related and informative sentences .
Edit intent: clarity
Original:  We evaluated the competency of our itemset-based summarizer using the Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metrics, by performing a set of experiments.
Revised:  We evaluated the competency of our itemset-based summarizer using the Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metrics, performing a set of experiments.
Edit intent: coherence
Original:  The proposed method was compared with the SUMMA, SweSum, AutoSummarize, term-based version of the itemset-based summarizer, and two baselines.
Revised:  The results show that the itemset-based summarizer, and two baselines.
Edit intent: clarity
Original:  The experimental results achieved using two distinct hardware and datasets collected in two different environments show that available positioning algorithms can benefit from incorporating the classifier into their measurement model as a meta-sensor modeling technique.
Revised:  The experimental results achieved using hardware show that available positioning algorithms can benefit from incorporating the classifier into their measurement model as a meta-sensor modeling technique.
Edit intent: clarity
Original:  There is a wide range methods for predicting solvation free energies, ranging from empirical statistical models to ab initio quantum mechanical approaches.
Revised:  There is a wide range of methods available for predicting solvation free energies, ranging from empirical statistical models to ab initio quantum mechanical approaches.
Edit intent: clarity
Original:  Each of these methods are based on a set of conceptual assumptions that can affect a method's predictive accuracy and transferability.
Revised:  Each of these methods is based on a set of conceptual assumptions that can affect a method's predictive accuracy and transferability.
Edit intent: fluency
Original:  Each of these methods are based on a set of conceptual assumptions that can affect a method's predictive accuracy and transferability.
Revised:  Each of these methods are based on a set of conceptual assumptions that can affect predictive accuracy and transferability.
Edit intent: clarity
Original:  This work provides a new approach for accurate solvation free energy prediction and lays the foundation for future work on aggregate models that can balance computational cost with predictive accuracy.
Revised:  This work provides a new approach for accurate solvation free energy prediction and lays the foundation for future work on aggregate models that can balance computational cost with prediction accuracy.
Edit intent: fluency
Original:  We present here the first practical decentralized  Heat-Diffusion Collection Protocol (HDCP)  for wireless sensor networks and detail its implementation on Contiki OS . We present a thorough evaluation of HDCP based on real testbed experiments, including a comparative analysis of its performance with respect to the state of the art Collection Tree Protocol (CTP) and Backpressure Collection Protocol (BCP) for wireless sensor networks.
Revised:  We present here the first practical decentralized Heat-Diffusion Collection Protocol (HDCP) , for wireless sensor networks and detail its implementation on Contiki OS . We present a thorough evaluation of HDCP based on real testbed experiments, including a comparative analysis of its performance with respect to the state of the art Collection Tree Protocol (CTP) and Backpressure Collection Protocol (BCP) for wireless sensor networks.
Edit intent: fluency
Original:  We present here the first practical decentralized  Heat-Diffusion Collection Protocol (HDCP)  for wireless sensor networks and detail its implementation on Contiki OS . We present a thorough evaluation of HDCP based on real testbed experiments, including a comparative analysis of its performance with respect to the state of the art Collection Tree Protocol (CTP) and Backpressure Collection Protocol (BCP) for wireless sensor networks.
Revised:  We present here the first practical decentralized Heat-Diffusion Collection Protocol (HDCP) for wireless sensor networks . We present a thorough evaluation of HDCP based on real testbed experiments, including a comparative analysis of its performance with respect to the state of the art Collection Tree Protocol (CTP) and Backpressure Collection Protocol (BCP) for wireless sensor networks.
Edit intent: coherence
Original: Combinatorial codes, i.e. subsets of the power set, naturally arise as the language of neural networks in the brain and silicon .
Revised: Combinatorial codes, i.e. subsets of the power set, often serve as a language of neural networks in the brain and silicon .
Edit intent: clarity
Original: Combinatorial codes, i.e. subsets of the power set, naturally arise as the language of neural networks in the brain and silicon .
Revised: Combinatorial codes, i.e. subsets of the power set, naturally arise as the language of neural networks .
Edit intent: coherence
Original: Combinatorial codes , i.e. subsets of the power set, often serve as a language of neural networks.
Revised: Neural codes serve as a language of neural networks.
Edit intent: clarity
Original:  A number of combinatorial codes in the brain arise as a pattern of intersections of convex sets in a Euclidean space.
Revised:  A number of combinatorial codes in the brain . Convex codes, which arise from the pattern of intersections of convex sets in a Euclidean space.
Edit intent: coherence
Original:  What combinatorial properties of a code  determine its convexity and what determines its embedding dimension is still poorly understood.
Revised:  What combinatorial properties of a code that determine its convexity and what determines its embedding dimension is still poorly understood.
Edit intent: coherence
Original:  What combinatorial properties of a code  determine its convexity and what determines its embedding dimension is still poorly understood.
Revised:  What combinatorial properties of a code determine its convexity are still poorly understood.
Edit intent: coherence
Original:  Here we establish that the codes that arise from open convex sets and the codes that arise from closed convex sets are distinct classes of codes.
Revised:  Here we find that a code that can be realized by a collection of open convex sets and the codes that arise from closed convex sets are distinct classes of codes.
Edit intent: clarity
Original: Finally we prove that codes that contain all intersections of its maximal codewords are both open  and closed convex, and provide an upper bound for their embedding dimension .
Revised: Finally we prove that codes that contain all intersections of maximal codewords) are both open and closed convex, and provide an upper bound for their embedding dimension .
Edit intent: clarity
Original: Finally we prove that codes that contain all intersections of its maximal codewords are both open  and closed convex, and provide an upper bound for their embedding dimension .
Revised: Finally we prove that codes that contain all intersections of its maximal codewords are both open convex and closed convex, and provide an upper bound for their embedding dimension .
Edit intent: fluency
Original:  We find that\sim40 , although activity spaces undergo considerable changes, the number of familiar locations an individual visits at any point in time is a conserved quantity .
Revised:  We find that\sim40 , although activity spaces undergo considerable changes, the number of familiar locations an individual visits at any point is a conserved quantity .
Edit intent: clarity
Original:  Furthermore, shifting the attention from aggregated quantities to individual behavior  we show that the size of an individual's set of preferred locations correlates with the number of her social interactions.
Revised:  Furthermore, shifting the attention from aggregated quantities to individual behavior , we show that the size of an individual's set of preferred locations correlates with the number of her social interactions.
Edit intent: fluency
Original:  We anticipate that our work will sparkle further research linking the study of Human Mobility and the Cognitive and Behavioral Sciences.
Revised:  We anticipate that our work will spark further research linking the study of Human Mobility and the Cognitive and Behavioral Sciences.
Edit intent: fluency
Original: We analyze a coupled  dataset collecting the mobile phone communication and bank transactions history of a large number of individuals living in Mexico .
Revised: We analyze a coupled dataset collecting the mobile phone communication and bank transactions history of a large number of individuals .
Edit intent: clarity
Original: Recurrent neural network (RNN) based character-level language models (CLMs) are extremely useful for modeling unseen words by nature.
Revised: Recurrent neural network (RNN) based character-level language models (CLMs) are extremely useful for modeling out-of-vocabulary words by nature.
Edit intent: clarity
Original:  We address this problem by proposing hierarchical RNN architectures, which consist of multiple modules with different clock rates . Despite the multi-clock structures, the input and output layers operate with the character-level clock, which allows the existing RNN CLM training approaches to be directly applicable without any modifications.
Revised:  We address this problem by proposing hierarchical RNN architectures, which consist of multiple modules with different timescales . Despite the multi-clock structures, the input and output layers operate with the character-level clock, which allows the existing RNN CLM training approaches to be directly applicable without any modifications.
Edit intent: clarity
Original:  We address this problem by proposing hierarchical RNN architectures, which consist of multiple modules with different clock rates . Despite the multi-clock structures, the input and output layers operate with the character-level clock, which allows the existing RNN CLM training approaches to be directly applicable without any modifications.
Revised:  We address this problem by proposing hierarchical RNN architectures, which consist of multiple modules with different clock rates . Despite the multi-timescale structures, the input and output layers operate with the character-level clock, which allows the existing RNN CLM training approaches to be directly applicable without any modifications.
Edit intent: clarity
Original:  In practice, however, the two-dimensional shape of the allotted piece is of crucial importance in many applications .
Revised:  In practice, however, the two-dimensional shape of the allotted piece is of crucial importance .
Edit intent: clarity
Original:  We present constructive cake-cutting procedures that satisfy the two most prominent fairness criteria, namely envy-freeness and proportionality.
Revised:  We present constructive division algorithms that satisfy the two most prominent fairness criteria, namely envy-freeness and proportionality.
Edit intent: clarity
Original:  In scenarios where proportionality cannot be achieved due to the geometric constraints, our procedures provide a partially-proportional division, guaranteeing that the fraction allocated to each agent be at least a certain positive constant.
Revised:  In settings where proportionality cannot be achieved due to the geometric constraints, our procedures provide a partially-proportional division, guaranteeing that the fraction allocated to each agent be at least a certain positive constant.
Edit intent: clarity
Original:  In scenarios where proportionality cannot be achieved due to the geometric constraints, our procedures provide a partially-proportional division, guaranteeing that the fraction allocated to each agent be at least a certain positive constant.
Revised:  In scenarios where proportionality cannot be achieved due to the geometric constraints, our algorithms provide a partially-proportional division, guaranteeing that the fraction allocated to each agent be at least a certain positive constant.
Edit intent: clarity
Original:  We prove that in many natural scenarios the envy-freeness requirement is compatible with the best attainable partial-proportionality.
Revised:  We prove that in many natural settings the envy-freeness requirement is compatible with the best attainable partial-proportionality.
Edit intent: clarity
Original:  However, some TEs are parasitic, relying on the enzymes produced by the regular TEs .
Revised:  However, some transposons are parasitic, relying on the enzymes produced by the regular TEs .
Edit intent: clarity
Original:  However, some TEs are parasitic, relying on the enzymes produced by the regular TEs .
Revised:  However, some TEs are parasitic, relying on the enzymes produced by the regular transposons .
Edit intent: clarity
Original:  In this case, we show that a stochastic model, which takes into account the small copy numbers of the TEs in a cell, predicts noise-induced predator-prey oscillations with a characteristic time scale that is much longer than the cell replication time, indicating that the state of the predator-prey oscillator is stored in the genome and transmitted to successive generations.
Revised:  In this case, we show that a stochastic model, which takes into account the small copy numbers of the transposons in a cell, predicts noise-induced predator-prey oscillations with a characteristic time scale that is much longer than the cell replication time, indicating that the state of the predator-prey oscillator is stored in the genome and transmitted to successive generations.
Edit intent: clarity
Original:  In this paper, we present the application of Benford's law to a new network flow metric "flow size difference", which have not been studied  by other researchers, to build an unsupervised flow-based intrusion detection system (IDS).
Revised:  In this paper, we present the application of Benford's law to a new network flow metric "flow size difference", which have not been studied before by other researchers, to build an unsupervised flow-based intrusion detection system (IDS).
Edit intent: clarity
Original:  The proposed IDS is unsupervised so no training is needed thus can be easily deployed  .
Revised:  The proposed IDS is unsupervised , so it can be easily deployed .
Edit intent: coherence
Original:  The proposed IDS is unsupervised so no training is needed thus can be easily deployed  .
Revised:  The proposed IDS is unsupervised so no training is needed thus can be easily deployed without any training .
Edit intent: clarity
Original:  It has two simple  parameters with a clear semantic meaning, allowing the human operator to set and adapt their values intuitively to adjust the overall performance of the IDS.
Revised:  It has two simple operational parameters with a clear semantic meaning, allowing the human operator to set and adapt their values intuitively to adjust the overall performance of the IDS.
Edit intent: clarity
Original:  It has two simple  parameters with a clear semantic meaning, allowing the human operator to set and adapt their values intuitively to adjust the overall performance of the IDS.
Revised:  It has two simple parameters with a clear semantic meaning, allowing the IDS operator to set and adapt their values intuitively to adjust the overall performance of the IDS.
Edit intent: clarity
Original:  We tested the proposed IDS on  one closed and two publicdatasets and proved its efficiency in terms of AUC (area under the ROC curve).
Revised:  We tested the proposed IDS on one closed and one public) datasets, and proved its efficiency in terms of AUC (area under the ROC curve).
Edit intent: fluency
Original:  Overall, we found that CRNNs show  strong performance with respect to the number of parameter and training time, indicating the effectiveness of its hybrid structure in music feature extraction and feature summarisation.
Revised:  Overall, we found that CRNNs show a strong performance with respect to the number of parameter and training time, indicating the effectiveness of its hybrid structure in music feature extraction and feature summarisation.
Edit intent: fluency
Original:   In this article, we analyze collaborative bots by studying the interactions between bots that edit articles on Wikipedia.
Revised:  Bots are predictable automatons that do not have the capacity for emotions, meaning-making, creativity, and sociality and it is hence natural to expect interactions between bots to be relatively predictable and uneventful. In this article, we analyze collaborative bots by studying the interactions between bots that edit articles on Wikipedia.
Edit intent: coherence
Original:   In this article, we analyze collaborative bots by studying the interactions between bots that edit articles on Wikipedia.
Revised:  In this article, we analyze the interactions between bots that edit articles on Wikipedia.
Edit intent: clarity
Original:  Further, just like humans, Wikipedia bots exhibit cultural differences .
Revised:  Unlike humans on Wikipedia, bots' interactions tend to occur over longer periods of time and to be more reciprocated. Yet, just like humans, Wikipedia bots exhibit cultural differences .
Edit intent: coherence
Original:  Further, just like humans, Wikipedia bots exhibit cultural differences .
Revised:  Further, just like humans, bots in different cultural environments may behave differently .
Edit intent: clarity
Original:  Our research suggests that even relatively "dumb" bots may give rise to complex interactions, and this provides a warning to the Artificial Intelligence research community .
Revised:  Our research suggests that even relatively "dumb" bots may give rise to complex interactions, and this carries important implications for Artificial Intelligence research community .
Edit intent: clarity
Original:  Our research suggests that even relatively "dumb" bots may give rise to complex interactions, and this provides a warning to the Artificial Intelligence research community .
Revised:  Our research suggests that even relatively "dumb" bots may give rise to complex interactions, and this provides a warning to the Artificial Intelligence research . Understanding what affects bot-bot interactions is crucial for managing social media well, providing adequate cyber-security, and designing well functioning autonomous vehicles .
Edit intent: clarity
Original:  The latter perspective is considered in this perspective article to develop low- and high-hanging image reconstruction techniques.
Revised:  The latter aspect is considered in this perspective article to develop low- and high-hanging image reconstruction techniques.
Edit intent: clarity