wanyu/IteraTeR_v2 huggingface dataset:
Original: Recent studies suggest that cooperative decision-making in one-shot interactions is a history-dependent dual process: promoting intuition versus deliberation has typically a positive effect on cooperation ( duality ) among people living in a cooperative setting and with no previous experience in economic games on cooperation (history-dependence).
Revised: Recent studies suggest that cooperative decision-making in one-shot interactions is a history-dependent dynamic process: promoting intuition versus deliberation has typically a positive effect on cooperation ( duality ) among people living in a cooperative setting and with no previous experience in economic games on cooperation (history-dependence).
Edit intent: clarity
Original: Recent studies suggest that cooperative decision-making in one-shot interactions is a history-dependent dual process: promoting intuition versus deliberation has typically a positive effect on cooperation ( duality ) among people living in a cooperative setting and with no previous experience in economic games on cooperation (history-dependence).
Revised: Recent studies suggest that cooperative decision-making in one-shot interactions is a history-dependent dual process: promoting intuition versus deliberation has typically a positive effect on cooperation ( dynamism ) among people living in a cooperative setting and with no previous experience in economic games on cooperation (history-dependence).
Edit intent: clarity
Original:  Here we report a large experiment exploring how these findings transfer to a non-cooperative setting.
Revised:  Here we report on a lab experiment exploring how these findings transfer to a non-cooperative setting.
Edit intent: clarity
Original:  (ii) experienced subjects are much more cooperative than inexperienced subjects;
Revised:  (ii) experienced subjects cooperate more than inexperienced subjects;
Edit intent: clarity
Original:  These results suggest that cooperation is a slow learning process, rather than an instinctive impulse or a self-controlled choice, and that experience operates primarily via the channel of intuition.
Revised:  These results suggest that cooperation is a learning process, rather than an instinctive impulse or a self-controlled choice, and that experience operates primarily via the channel of intuition.
Edit intent: clarity
Original:  Producers optionally store some production for future sale and go short on forward contracts to hedge their future commodity price uncertainty.
Revised:  Producers optionally store some production for future sale and go short on forward contracts to hedge the uncertainty of the future commodity price uncertainty.
Edit intent: clarity
Original:  On the other hand, speculators invest in these contracts  to diversify their portfolios.
Revised:  On the other hand, speculators invest in these contracts in order to diversify their portfolios.
Edit intent: clarity
Original:  The model can explain why increased speculators ' participation in forward commodity markets and higher correlation between the commodity and the stock market could result in higher spot prices and lower forward premia.
Revised:  The model can explain why increased investors ' participation in forward commodity markets and higher correlation between the commodity and the stock market could result in higher spot prices and lower forward premia.
Edit intent: clarity
Original: In this paper, we propose a universal model for high-dimensional data, called the Hybrid Orthogonal Projection and Estimation (HOPE) model, which combines a linear orthogonal projection and a finite mixture model under a unified generative modelling framework.
Revised: In this paper, we propose a novel model for high-dimensional data, called the Hybrid Orthogonal Projection and Estimation (HOPE) model, which combines a linear orthogonal projection and a finite mixture model under a unified generative modelling framework.
Edit intent: clarity
Original: In this paper, we propose a universal model for high-dimensional data, called the Hybrid Orthogonal Projection and Estimation (HOPE) model, which combines a linear orthogonal projection and a finite mixture model under a unified generative modelling framework.
Revised: In this paper, we propose a universal model for high-dimensional data, called the Hybrid Orthogonal Projection and Estimation (HOPE) model, which combines a linear orthogonal projection and a finite mixture model under a unified generative modeling framework.
Edit intent: fluency
Original:  The HOPE model itself can be learned unsupervisedly from un-labelled data based on the maximum likelihood estimation as well as trained discriminatively from labelled data.
Revised:  The HOPE model itself can be learned unsupervised from unlabelled data based on the maximum likelihood estimation as well as trained discriminatively from labelled data.
Edit intent: coherence
Original:  The HOPE model itself can be learned unsupervisedly from un-labelled data based on the maximum likelihood estimation as well as trained discriminatively from labelled data.
Revised:  The HOPE model itself can be learned unsupervisedly from un-labelled data based on the maximum likelihood estimation as well as discriminatively from labelled data.
Edit intent: clarity
Original:  More interestingly, we have shown the proposed HOPE models are closely related to neural networks (NNs) in a sense that each NN hidden layer can be reformulated as a HOPE model.
Revised:  More interestingly, we have shown the proposed HOPE models are closely related to neural networks (NNs) in a sense that each hidden layer can be reformulated as a HOPE model.
Edit intent: fluency
Original:  As a result, the HOPE framework can be used as a novel tool to probe why and how NNs work, more importantly, it also provides several new learning algorithms to learn NNs either supervisedly or unsupervisedly .
Revised:  As a result, the HOPE framework can be used as a novel tool to probe why and how NNs work, more importantly, to learn NNs either supervisedly or unsupervisedly .
Edit intent: coherence
Original:  As a result, the HOPE framework can be used as a novel tool to probe why and how NNs work, more importantly, it also provides several new learning algorithms to learn NNs either supervisedly or unsupervisedly .
Revised:  As a result, the HOPE framework can be used as a novel tool to probe why and how NNs work, more importantly, it also provides several new learning algorithms to learn NNs in either supervised or unsupervised ways .
Edit intent: clarity
Original:  In this work, we have investigated the HOPE framework in learning NNs for several standard tasks, including image recognition on MNIST and speech recognition on TIMIT.
Revised:  In this work, we have investigated the HOPE framework to learn NNs for several standard tasks, including image recognition on MNIST and speech recognition on TIMIT.
Edit intent: fluency
Original:  Experimental results show that the HOPE framework yields significant performance gains over the current state-of-the-art methods in various types of NN learning problems, including unsupervised feature learning, supervised or semi-supervised learning.
Revised:  Experimental results have shown that the HOPE framework yields significant performance gains over the current state-of-the-art methods in various types of NN learning problems, including unsupervised feature learning, supervised or semi-supervised learning.
Edit intent: clarity
Original:  On standard benchmarks for chaotic prediction tasks, a product ESN network maintains the performance of a standard nonlinear ESN while being more amenable to mathematical analysis.
Revised:  On standard benchmarks for chaotic prediction tasks, the product RC maintains the performance of a standard nonlinear ESN while being more amenable to mathematical analysis.
Edit intent: clarity
Original: Defining the extent and significance of epistasis - the non-independence of the effects of mutations - is critical for understanding the relationship of genotype, phenotype, and ultimately fitness in biological systems.
Revised: Defining the extent of epistasis - the non-independence of the effects of mutations - is critical for understanding the relationship of genotype, phenotype, and ultimately fitness in biological systems.
Edit intent: clarity
Original: Defining the extent and significance of epistasis - the non-independence of the effects of mutations - is critical for understanding the relationship of genotype, phenotype, and ultimately fitness in biological systems.
Revised: Defining the extent and significance of epistasis - the non-independence of the effects of mutations - is essential for understanding the relationship of genotype, phenotype, and ultimately fitness in biological systems.
Edit intent: clarity
Original: Defining the extent and significance of epistasis - the non-independence of the effects of mutations - is critical for understanding the relationship of genotype, phenotype, and ultimately fitness in biological systems.
Revised: Defining the extent and significance of epistasis - the non-independence of the effects of mutations - is critical for understanding the relationship of genotype, phenotype, and fitness in biological systems.
Edit intent: clarity
Original:  We discuss approaches to handle the common situation in which the combinatorial complexity of possible epistatic terms exceeds the actual number of data points and examine the applicability of these approaches depending on the specific reasons underlying the interest in epistasis .
Revised:  We discuss approaches to handle the common situation in which the combinatorial complexity of mutations. In this regard, we discuss possible approaches for optimally learning the epistatic structure of biological systems .
Edit intent: clarity
Original:  Both are classic similarity measures of sequences that have a wealth of applications and can be computed in time O(n^2)  .
Revised:  Both are classic similarity measures of sequences that have a wealth of applications and can be computed by simple O(n^2) .
Edit intent: clarity
Original: Color refinement is a classical technique  to show that two given graphs G and H are non-isomorphic;
Revised: Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic;
Edit intent: clarity
Original:  it is very efficient, even if incomplete in general .
Revised:  it is very efficient, although it does not succeed on all graphs .
Edit intent: clarity
Original:  We call a graph G amenable to color refinement if this algorithm succeeds in distinguishing G from any non-isomorphic graph H. Babai, Erdos, and Selkow (1982) proved that almost all graphs G are amenable .
Revised:  We call a graph G amenable to color refinement if the color-refinement procedure succeeds in distinguishing G from any non-isomorphic graph H. Babai, Erdos, and Selkow (1982) proved that almost all graphs G are amenable .
Edit intent: clarity
Original:  We here determine the exact range of applicability of color refinement by showing that the class of all amenable graphs is recognizable in time O((n+m)\log n), where n and m denote the number of vertices and the number of edges in the input graph.
Revised:  We here determine the exact range of applicability of color refinement by showing that the class of amenable graphs is recognizable in time O((n+m)\log n), where n and m denote the number of vertices and the number of edges in the input graph.
Edit intent: clarity
Original:  Furthermore, we prove that amenable graphs are compact in the sense of Tinhofer (1991) , that is, their polytopes of fractional automorphisms are integral.
Revised:  Furthermore, we prove that amenable graphs are compact in the sense of Tinhofer (1991) . That is, their polytopes of fractional automorphisms are integral.
Edit intent: fluency
Original:  Our result implies that  this linear programming approach to isomorphism testing has the applicability range at least as large as  the combinatorial approach based on color refinement.
Revised:  Our result implies that the applicability range for this linear programming approach to isomorphism testing has the applicability range at least as large as the combinatorial approach based on color refinement.
Edit intent: clarity
Original:  Our result implies that  this linear programming approach to isomorphism testing has the applicability range at least as large as  the combinatorial approach based on color refinement.
Revised:  Our result implies that this linear programming approach to isomorphism testing is at least as large as the combinatorial approach based on color refinement.
Edit intent: clarity
Original:  Our result implies that  this linear programming approach to isomorphism testing has the applicability range at least as large as  the combinatorial approach based on color refinement.
Revised:  Our result implies that this linear programming approach to isomorphism testing has the applicability range at least as large as for the combinatorial approach based on color refinement.
Edit intent: clarity
Original:  We call a graph G amenable to color refinement if the color-refinement procedure succeeds in distinguishing G from any non-isomorphic graph H. Babai, Erd\H{o recognizable in time O((n + m) \log n ), where n and m denote the number of vertices and the number of edges in the input graph.
Revised:  We call a graph G amenable to color refinement if it succeeds in distinguishing G from any non-isomorphic graph H. Babai, Erd\H{o recognizable in time O((n + m) \log n ), where n and m denote the number of vertices and the number of edges in the input graph.
Edit intent: clarity
Original:  Furthermore, we prove that amenable graphs are compact in the sense of Tinhofer (1991).
Revised:  - We show that all amenable graphs are compact in the sense of Tinhofer (1991).
Edit intent: clarity
Original: We explain how recent developments in the fields of realizability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity.
Revised: We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity.
Edit intent: fluency
Original:  This paper provides the background, motivations and perspectives of this complexity-through-realizability theory to be developed, and illustrates it with recent results.
Revised:  This paper provides the background, motivations and perspectives of this complexity-through-realisability theory to be developed, and illustrates it with recent results.
Edit intent: fluency
Original: The Ebola virus is spreading throughout West Africa , causing thousands of deaths.
Revised: The Ebola virus is spreading throughout West Africa and is causing thousands of deaths.
Edit intent: coherence
Original:  We study the propagation of the Ebola virus through Liberia by using a model in which people travel from one county to another in order to quantify the effectiveness of different strategies .
Revised:  We study the propagation of the Ebola virus through Liberia is caused by travel between counties .
Edit intent: clarity
Original:  For the initial months in which the Ebola virus spreads, we find that the arrival times of the disease into the counties predicted by our model are in good agreement with World Health Organization data .
Revised:  For the initial months in which the Ebola virus spreads, we find that the arrival times of the disease into the counties predicted by our model are compatible with World Health Organization data .
Edit intent: clarity
Original:  We also find that reducing mobility  delays the arrival of Ebola virus in each county by only a few weeks , and as a consequence, is insufficient to contain the epidemic.
Revised:  We also find that reducing mobility is insufficient to contain the epidemic because it delays the arrival of Ebola virus in each county by only a few weeks , and as a consequence, is insufficient to contain the epidemic.
Edit intent: coherence
Original:  Finally we study the effect of a strategy focused on increasing safe burials and hospitalization under two scenarios: (i) one implemented in mid-July 2014 and (ii) one in mid-August, which was the actual time that strong interventions began in Liberia.
Revised:  Finally we study the effect of a strategy in which safe burials are increased and effective hospitalisation instituted under two scenarios: (i) one implemented in mid-July 2014 and (ii) one in mid-August, which was the actual time that strong interventions began in Liberia.
Edit intent: clarity
Original:  Finally we study the effect of a strategy focused on increasing safe burials and hospitalization under two scenarios: (i) one implemented in mid-July 2014 and (ii) one in mid-August, which was the actual time that strong interventions began in Liberia.
Revised:  Finally we study the effect of a strategy focused on increasing safe burials and hospitalization under two scenarios: (i) one implemented in mid-July 2014 and (ii) one in mid-August---which was the actual time that strong interventions began in Liberia.
Edit intent: fluency
Original:  We find that if scenario (i) had been pursued the lifetime of the epidemic would have been reduced by three months and the total number of infected individuals reduced by 80\\%DIF < , when compared to scenario (ii).
Revised:  We find that if scenario (i) had been pursued the lifetime of the epidemic would have been three months shorter and the total number of infected individuals reduced by 80\\%DIF < , when compared to scenario (ii).
Edit intent: clarity
Original:  We find that if scenario (i) had been pursued the lifetime of the epidemic would have been reduced by three months and the total number of infected individuals reduced by 80\\%DIF < , when compared to scenario (ii).
Revised:  We find that if scenario (i) had been pursued the lifetime of the epidemic would have been reduced by three months and the total number of infected individuals 80\\%DIF < , when compared to scenario (ii).
Edit intent: fluency
Original:  Our projection under scenario (ii) %DIF > less than in scenario (ii).
Revised:  Our %DIF > less than in scenario (ii).
Edit intent: clarity
Original:  Our projection under scenario (ii) is that the spreading will cease by mid-spring 2015.
Revised:  Our projection under scenario (ii) is that the spreading will stop by mid-spring 2015.
Edit intent: fluency
Original: We propose and encourage the publication of review/survey articles that will be updated regularly, both in traditional journals and novel venues.
Revised: We advocate the publication of review/survey articles that will be updated regularly, both in traditional journals and novel venues.
Edit intent: clarity
Original:  We call these " living reviews."
Revised:  We call these " perpetual reviews."
Edit intent: style
Original:  This idea naturally builds on the dissemination and archival capabilities present in the modern internet, and indeed living reviews exist already in some forms.
Revised:  This idea naturally builds on the dissemination and archival capabilities present in the modern internet, and indeed perpetual reviews exist already in some forms.
Edit intent: clarity
Original:  Living review articles allow authors to maintain over time the relevance of non-research scholarship that requires a significant investment of effort.
Revised:  Perpetual review articles allow authors to maintain over time the relevance of non-research scholarship that requires a significant investment of effort.
Edit intent: clarity
Original:  We also envision living reviews leading to the creation of a new category of review - review papers published as living reviews in a purely electronic format without space constraints .
Revised:  Further, such reviews published in a purely electronic format without space constraints .
Edit intent: clarity
Original: Last decades witness rapid development in numerical modelling of structures as well as materials and the complexity of  models increases quickly together with their computational demands.
Revised: Rapid development in numerical modelling of structures as well as materials and the complexity of models increases quickly together with their computational demands.
Edit intent: coherence
Original: Last decades witness rapid development in numerical modelling of structures as well as materials and the complexity of  models increases quickly together with their computational demands.
Revised: Last decades witness rapid development in numerical modelling of materials and the complexity of models increases quickly together with their computational demands.
Edit intent: clarity
Original: Last decades witness rapid development in numerical modelling of structures as well as materials and the complexity of  models increases quickly together with their computational demands.
Revised: Last decades witness rapid development in numerical modelling of structures as well as materials and the complexity of new models increases quickly together with their computational demands.
Edit intent: clarity
Original:  Despite the growing performance of modern computers and clusters, calibration of such models from noisy experimental data remains a nontrivial and often computational exhaustive task.
Revised:  Despite the growing performance of modern computers and clusters, calibration of such models from noisy experimental data remains a nontrivial and often computationally exhaustive task.
Edit intent: fluency
Original:  The advantages and drawbacks of particular strategies are demonstrated on  calibration of four parameters of  affinity hydration model from simulated data as well as from experimental measurements.
Revised:  The advantages and drawbacks of particular strategies are demonstrated on the calibration of four parameters of affinity hydration model from simulated data as well as from experimental measurements.
Edit intent: fluency
Original:  The advantages and drawbacks of particular strategies are demonstrated on  calibration of four parameters of  affinity hydration model from simulated data as well as from experimental measurements.
Revised:  The advantages and drawbacks of particular strategies are demonstrated on calibration of four parameters of the affinity hydration model from simulated data as well as from experimental measurements.
Edit intent: fluency
Original: We continue the systematic investigation of classical and quantum finite automata  on promise problems and we focus on unary ones in this paper .
Revised: We continue the systematic investigation of classical and quantum finite automata on promise problems by focusing on unary languages .
Edit intent: clarity
Original:  But, on contrary to the binary problems, the computational power of Las-Vegas QFAs and bounded-error PFAs are equivalent to DFAs . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Revised:  But, in contrary to the binary problems, the computational power of Las-Vegas QFAs and bounded-error PFAs are equivalent to DFAs . Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Edit intent: coherence