wanyu/IteraTeR_v2 huggingface dataset:
Original:  To enable users to explore data on a conceptual entity-relationship level , we also introduce a graph-based model, called typed graph model that provides an abstraction of relational databases .
Revised:  To enable users to explore data on a conceptual entity-relationship level .
Edit intent: coherence
Original:  In a user study, participants performed a range of database querying tasks faster with Etable than with a commercial graphical query builder.
Revised:  In a user study, participants performed a range of database querying tasks faster with ETable than with a commercial graphical query builder.
Edit intent: fluency
Original:  Subjective feedback about Etable was also positive.
Revised:  Subjective feedback about ETable was also positive.
Edit intent: fluency
Original:  All participants found that Etable was easier to learn and helpful for exploring databases.
Revised:  All participants found that ETable was easier to learn and helpful for exploring databases.
Edit intent: fluency
Original: The proliferation of connected low-power devices on the Internet of Things will result in a data explosion that will significantly increase data transmission costs with respect to energy consumption and latency.
Revised: The proliferation of connected low-power devices will result in a data explosion that will significantly increase data transmission costs with respect to energy consumption and latency.
Edit intent: clarity
Original:  Edge computing reduces these costs by performing computations at the edge nodes  prior to data transmission  to interpret and/or utilize the data.
Revised:  Edge computing reduces these costs by performing computations at the edge nodes , prior to data transmission to interpret and/or utilize the data.
Edit intent: fluency
Original:  Edge computing reduces these costs by performing computations at the edge nodes  prior to data transmission  to interpret and/or utilize the data.
Revised:  Edge computing reduces these costs by performing computations at the edge nodes prior to data transmission , to interpret and/or utilize the data.
Edit intent: fluency
Original:  While much research has focused on the IoT's connected nature and communication challenges, the challenges of IoT embedded computing with respect to device microprocessors and optimizations has received much less attention.
Revised:  While much research has focused on the IoT's connected nature and communication challenges, the challenges of IoT embedded computing with respect to device microprocessors has received much less attention.
Edit intent: clarity
Original:  This article explores IoT applications' execution characteristics from a microarchitectural perspective and the microarchitectural characteristics that will enable efficient and effective edge computing.
Revised:  This paper explores IoT applications' execution characteristics from a microarchitectural perspective and the microarchitectural characteristics that will enable efficient and effective edge computing.
Edit intent: fluency
Original:  Our work also provides a foundation for the analysis and design of a diverse set of microprocessor architectures for edge computing in next-generation IoT devices.
Revised:  Our work also provides a foundation for the analysis and design of a diverse set of microprocessor architectures for next-generation IoT devices.
Edit intent: clarity
Original:  The model is solved by numerical technique because of the non-linearity of the  functions.
Revised:  The model is solved by numerical technique because of the non-linearity of the related functions.
Edit intent: clarity
Original: The fidelity of DNA replication by DNA polymerase (DNAP) has long been an important issue in basic researches and application studies in biology.
Revised: The fidelity of DNA replication by DNA polymerase (DNAP) has long been an important issue in biology.
Edit intent: clarity
Original:  Our results show good agreements with previous intuitive estimate of some DNAPs' fidelity under bio-relevant conditions .
Revised:  Our results show good agreements with previous intuitive estimates given by experimentalists .
Edit intent: clarity
Original: A classical result by Erdos and Posas and P\'osa } states that there is a function f: N -> N { such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G-T is acyclic.
Revised: A classical result by Erd\H{os and P\'osa } states that there is a function f: N -> N { such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G-T is acyclic.
Edit intent: fluency
Original:  For this natural class of digraphs we obtain a nearly complete characterisation of the digraphs within this class with the Erdos-Posa-propertys-P\'osa-property} .
Revised:  For this natural class of digraphs we obtain a nearly complete characterisation of the digraphs within this class with the Erd\H{os-P\'osa-property} .
Edit intent: fluency
Original:  In particular we give positive and algorithmic examples of digraphs with the Erdos-Posa-propertys-P\'osa-property } by using directed tree decompositions in a novel way.
Revised:  In particular we give positive and algorithmic examples of digraphs with the Erd\H{os-P\'osa-property } by using directed tree decompositions in a novel way.
Edit intent: clarity
Original: A classical result by Erd\H{os and P\'osa }  states that there is a function f: {\mathbb N} \rightarrow {\mathbb N} such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G-T is acyclic.
Revised: A classical result by s and P\'osa } states that there is a function f: {\mathbb N} \rightarrow {\mathbb N} such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G-T is acyclic.
Edit intent: clarity
Original:  Robertson and Seymour proved that a graph H has the Erd\H{os-P\'osa-property }  if, and only if, H is planar.
Revised:  Robertson and Seymour proved that a graph H has the s-P\'osa-property } if, and only if, H is planar.
Edit intent: coherence
Original:  We obtain a complete characterisation of the class of strongly connected digraphs which have the Erd\H{os-P\'osa-property }  (both for topological and butterfly minors).
Revised:  We obtain a complete characterisation of the class of strongly connected digraphs which have the s-P\'osa-property } (both for topological and butterfly minors).
Edit intent: clarity
Original:  For this natural class of digraphs we obtain a nearly complete characterisation of the digraphs within this class with the Erd\H{os-P\'osa-property}  .
Revised:  For this natural class of digraphs we obtain a nearly complete characterisation of the digraphs within this class with the s-P\'osa-property} .
Edit intent: coherence
Original: In this paper we study the sources of dynamic energy during the execution of software on microprocessors suited for the Internet of Things (IoT ) domain.
Revised: This paper examines dynamic energy consumption during the execution of software on microprocessors suited for the Internet of Things (IoT ) domain.
Edit intent: clarity
Original:  Estimating the energy consumed by executing software is typically achieved by determining the most costly path through the program according to some energy model of the processor .
Revised:  Estimating the energy consumed by executing software is typically achieved by determining the most costly execution path .
Edit intent: clarity
Original:  Few models , however, adequately tackle the matter of dynamic energy caused by operand data .
Revised:  Few models adequately consider dynamic energy caused by operand data .
Edit intent: clarity
Original:  Few models , however, adequately tackle the matter of dynamic energy caused by operand data .
Revised:  Few models , however, adequately tackle the matter of dynamic energy caused by switching due to operand values .
Edit intent: clarity
Original:  We find that the contribution of operand data to overall energy can be significant, prove that finding the worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Revised:  We find that energy contribution of operand data to overall energy can be significant, prove that finding the worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Edit intent: clarity
Original:  We find that the contribution of operand data to overall energy can be significant, prove that finding the worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Revised:  We find that the contribution of operand values can be significant, prove that finding the worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Edit intent: clarity
Original:  We find that the contribution of operand data to overall energy can be significant, prove that finding the worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Revised:  We find that the contribution of operand data to overall energy can be significant, prove that finding worst-case input data is NP-hard, and further, that it cannot be estimated to any useful factor.
Edit intent: coherence
Original:  Our work shows that  accurate worst-case analysis of data dependent energy is infeasible, and that other techniques for energy estimation should be considered .
Revised:  Our work shows that accurate worst-case analysis of data-dependent energy is infeasible, and that other techniques for energy estimation should be considered .
Edit intent: fluency
Original: This paper examines dynamic energy consumption during the execution of software on deeply embedded IoT microprocessors .
Revised: This paper examines dynamic energy consumption during the execution of software on deeply embedded microprocessors, which can be significant on some devices .
Edit intent: coherence
Original:  We find that energy contribution of operand values can be significant, prove that finding worst-case input data is NP-hard, and that tight bounds cannot be approximated with guaranteed safety.
Revised:  We find that energy contribution of operand values can be significant, prove that finding worst-case energy is NP-hard, and that tight bounds cannot be approximated with guaranteed safety.
Edit intent: clarity
Original:  We conclude that accurate worst-case analysis of data-dependent energy is infeasible, and provide recommendations to minimize the impact of this, without resorting to significant over-estimation .
Revised:  We conclude that any energy model targeting tightness must either sacrifice safety or accept overapproximation proportional to data-dependent energy .
Edit intent: clarity
Original:  So far, research on detection in laser range data has been dominated by handcrafted features and boosted classifiers, potentially losing performance due to suboptimal design choices.
Revised:  So far, research on detection in laser range data has been dominated by hand-crafted features and boosted classifiers, potentially losing performance due to suboptimal design choices.
Edit intent: fluency
Original:  We provide a ROS node for our detector and release our dataset containing 464k laser scans, out of which 24k were annotated for training .
Revised:  We provide a ROS node for our detector and release our dataset containing 464k laser scans, out of which 24k were annotated .
Edit intent: clarity
Original: We present a sequential Monte Carlo algorithm for Markov chain paths with proposals constructed in reverse time .
Revised: We present a sequential Monte Carlo algorithm for Markov chain trajectories with proposals constructed in reverse time .
Edit intent: fluency
Original:  These ratios can often be interpreted as conditional sampling distributions of some co-ordinates given the others.
Revised:  Conditioning arguments can be used to interpret these ratios as low-dimensional conditional sampling distributions of some co-ordinates given the others.
Edit intent: clarity
Original:  These ratios can often be interpreted as conditional sampling distributions of some co-ordinates given the others.
Revised:  These ratios can often be interpreted as conditional sampling distributions of some coordinates of the process given the others.
Edit intent: clarity
Original:  The conditional sampling distributions are typically much lower dimensional than the whole process, and approximating them fully specifies the proposal distribution.
Edit intent: coherence
Original:  Hence the difficulty in designing good SMC proposals in high dimension is greatly reduced.
Revised:  Hence the difficulty in designing SMC proposals in high dimension is greatly reduced.
Edit intent: clarity
Original:  We illustrate our method on estimating an overflow probability in a queuing model, the probability that a diffusion follows a narrowing corridor, and the initial location of an infection in an epidemic model on a network.
Revised:  We illustrate our method on estimating an overflow probability in a queueing model, the probability that a diffusion follows a narrowing corridor, and the initial location of an infection in an epidemic model on a network.
Edit intent: fluency
Original: We compute a sharp small-time estimate for the price of a basket call under a bi-variate SABR model with both \beta parameters equal to 1 and three correlation parameters, which extends the work of Bayer,Friz&Laurence [BFL14] for the multivariate Black-Scholes flat vol model , and we show that the BFL14%DIFDELCMD < ] %DIFDELCMD < %%% result has to be adjusted for strikes above a certain critical value K^* where the convolution density admits a higher order saddlepoint .
Revised: We compute a sharp small-time estimate for the price of a basket call under a bi-variate SABR model with both \beta parameters equal to 1 and three correlation parameters, which extends the work of Bayer,Friz&Laurence [BFL14] for the multivariate Black-Scholes flat vol model BFL14%DIFDELCMD < ] %DIFDELCMD < %%% result has to be adjusted for strikes above a certain critical value K^* where the convolution density admits a higher order saddlepoint .
Edit intent: coherence
Original: We compute a sharp small-time estimate for the price of a basket call under a bi-variate SABR model with both \beta parameters equal to 1 and three correlation parameters, which extends the work of Bayer,Friz&Laurence [BFL14] for the multivariate Black-Scholes flat vol model , and we show that the BFL14%DIFDELCMD < ] %DIFDELCMD < %%% result has to be adjusted for strikes above a certain critical value K^* where the convolution density admits a higher order saddlepoint .
Revised: We compute a sharp small-time estimate for the price of a basket call under a bi-variate SABR model with both \beta parameters equal to 1 and three correlation parameters, which extends the work of Bayer,Friz&Laurence [BFL14] for the multivariate Black-Scholes flat vol model , and we show that the %DIFDELCMD < ] %DIFDELCMD < %%% result has to be adjusted for strikes above a certain critical value K^* where the convolution density admits a higher order saddlepoint .
Edit intent: coherence
Original:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by Leishmania amazonensis andLeishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Revised:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by andLeishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Edit intent: fluency
Original:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by Leishmania amazonensis andLeishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Revised:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by Leishmania amazonensis Leishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Edit intent: fluency
Original:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by Leishmania amazonensis andLeishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Revised:  These parasites are the etiological agents of neglected tropical diseases: leishmaniasis caused by Leishmania amazonensis andLeishmania braziliensis , African sleeping sickness caused by Trypanosoma brucei , and Chagas disease caused by \textit{Trypanosoma cruzi .
Edit intent: fluency
Original:  We observe that these architectures, hereby characterized as Passthrough Networks, in addition to the mitigation of the vanishing gradient problem, enable the decoupling of the network state size from the number of parameters of the network, a possibility that is exploited in some recent works but not thoroughly explored  .
Revised:  We observe that these architectures, hereby characterized as Passthrough Networks, in addition to the mitigation of the vanishing gradient problem, enable the decoupling of the network state size from the number of parameters of the network, a possibility has been studied by .
Edit intent: clarity
Original:  However, directly applying standard language processing tools to historical texts often yields unsatisfactoryperformance , due to language change and genre differences.
Revised:  However, directly applying standard language processing tools to these archives. However, the performance of these tools is often unsatisfactory , due to language change and genre differences.
Edit intent: clarity
Original:  Spelling normalization is the dominant solution , but it fails to account for changes in usage and vocabulary.
Revised:  Spelling normalization is the dominant solution for dealing with historical texts, but this approach fails to account for changes in usage and vocabulary.
Edit intent: clarity
Original:  In this empirical paper, we assess the capability of do- main adaptation techniques to cope with historical texts, focusing on the classic bench- mark task of part-of-speech tagging.
Revised:  In this empirical paper, we assess the capability of domain adaptation techniques to cope with historical texts, focusing on the classic bench- mark task of part-of-speech tagging.
Edit intent: fluency
Original:  In this empirical paper, we assess the capability of do- main adaptation techniques to cope with historical texts, focusing on the classic bench- mark task of part-of-speech tagging.
Revised:  In this empirical paper, we assess the capability of do- main adaptation techniques to cope with historical texts, focusing on the classic benchmark task of part-of-speech tagging.
Edit intent: fluency
Original:  We empirically evaluate several domain adaptation methods on the task of tagging two million- word treebanks of the Penn Corpora of Historical English.
Revised:  We evaluate several domain adaptation methods on the task of tagging two million- word treebanks of the Penn Corpora of Historical English.
Edit intent: clarity
Original:  From each class we select one student attempt as a specification for the given strategy . (2) Given an incorrect student attempt we run a repair procedure against all specifications, and automatically generate the minimal repair based on one of them.
Revised:  From each cluster we select one student attempt as a specification for the given strategy . (2) Given an incorrect student attempt we run a repair procedure against all specifications, and automatically generate the minimal repair based on one of them.
Edit intent: clarity
Original:  From each class we select one student attempt as a specification for the given strategy . (2) Given an incorrect student attempt we run a repair procedure against all specifications, and automatically generate the minimal repair based on one of them.
Revised:  From each class we select one student attempt as a specification . (2) Given an incorrect student attempt we run a repair procedure against all specifications, and automatically generate the minimal repair based on one of them.
Edit intent: clarity
Original:  In our evaluation we first automatically clustered correct attempts and generated specifications from the correct student attempts and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for 86%DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Revised:  In our evaluation we first automatically clustered the correct student attempts and generated specifications from the correct student attempts and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for 86%DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Edit intent: fluency
Original:  In our evaluation we first automatically clustered correct attempts and generated specifications from the correct student attempts and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for 86%DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Revised:  In our evaluation we first automatically clustered correct attempts and generated specifications , and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for 86%DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Edit intent: clarity
Original:  In our evaluation we first automatically clustered correct attempts and generated specifications from the correct student attempts and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for 86%DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Revised:  In our evaluation we first automatically clustered correct attempts and generated specifications from the correct student attempts and then used these specifications to repair the incorrect student attempts without any human intervention, finding repairs for %DIFDELCMD < \\%%% %DIF < of incorrect student attempts in around 7 seconds per attempt.abstract 
Edit intent: clarity
Original: Providing feedback on programming assignments is a tedious task for the instructor, and even impossible in large MOOCs with thousands of students.
Revised: Providing feedback on programming assignments is a tedious task for the instructor, and even impossible in large Massive Open Online Courses with thousands of students.
Edit intent: clarity
Original: We consider the problem of modelling the term structure of bonds subject to default risk , under minimal assumptions on the default time.
Revised: We consider the problem of modelling the term structure of defaultable bonds , under minimal assumptions on the default time.
Edit intent: clarity
Original:  It turns out that this requires the introduction of an additional term to the forward-rate approach by Heath, Jarrow and Morton (1992).
Revised:  It turns out that this requires the introduction of an additional term in the forward rate approach by Heath, Jarrow and Morton (1992).
Edit intent: fluency
Original:  It allows to compute bi- and multivariate dissimilarity profiles, averaged values and bivariate matrices.
Revised:  It allows to compute similarity and dissimilarity profiles, averaged values and bivariate matrices.
Edit intent: clarity
Original: Living cells display a remarkable capacity to compartmentalize their functional biochemistry spatially .
Revised: Living cells display a remarkable capacity to compartmentalize their functional biochemistry .
Edit intent: clarity
Original:  Together with associated soluble proteins, the nuclear pores constitute an important transport system.
Edit intent: coherence