wanyu/IteraTeR_v2 huggingface dataset:
Original:  Based on this analysis we propose Recurrent Highway Networks, which are long not only in time but also in space, generalizing LSTMs to larger step-to-step  depths.
Revised:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, generalizing LSTMs to larger step-to-step depths.
Edit intent: clarity
Original:  Based on this analysis we propose Recurrent Highway Networks, which are long not only in time but also in space, generalizing LSTMs to larger step-to-step  depths.
Revised:  Based on this analysis we propose Recurrent Highway Networks, which are long not only in time but also in space, extending the LSTM architecture to larger step-to-step depths.
Edit intent: clarity
Original:  Experiments indicate that the proposed architecture results in complex but efficient models , beating previous models for character prediction on the Hutter Prize Wikipedia dataset and word-level language modeling on the Penn Treebank corpus .
Revised:  Experiments demonstrate that the proposed architecture results in complex but efficient models , beating previous models for character prediction on the Hutter Prize Wikipedia dataset and word-level language modeling on the Penn Treebank corpus .
Edit intent: clarity
Original:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, extending the LSTM architecture to larger step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models benefiting from up to 10 layers in the recurrent transition .
Revised:  Based on this analysis we propose Recurrent Highway Networks, which extend the LSTM architecture to larger step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models benefiting from up to 10 layers in the recurrent transition .
Edit intent: clarity
Original:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, extending the LSTM architecture to larger step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models benefiting from up to 10 layers in the recurrent transition .
Revised:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, extending the LSTM architecture to allow step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models benefiting from up to 10 layers in the recurrent transition .
Edit intent: clarity
Original:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, extending the LSTM architecture to larger step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models benefiting from up to 10 layers in the recurrent transition .
Revised:  Based on this analysis we propose Recurrent Highway Networks, which are deep not only in time but also in space, extending the LSTM architecture to larger step-to-step transition depths . Experiments demonstrate that the proposed architecture results in powerful and efficient models .
Edit intent: coherence
Original:  On the larger Hutter Prize Wikipedia dataset, a single network again significantly outperforms all previous results with an entropy of 1.32 bits per character on the test set .
Revised:  On the larger Hutter Prize Wikipedia dataset, a single network again significantly outperforms all previous results and achieve an entropy of 1.32 bits per character on the test set .
Edit intent: clarity
Original:  On the larger Hutter Prize Wikipedia dataset, a single network again significantly outperforms all previous results with an entropy of 1.32 bits per character on the test set .
Revised:  On the larger Hutter Prize Wikipedia dataset, a single network again significantly outperforms all previous results with an entropy of 1.32 bits per character .
Edit intent: clarity
Original:  One particular class of methods, based on the linear parametric representation of multiple interacting time series, is widely used to study causal connectivity in the brain in both fundamental and clinical neuroscientific research .
Revised:  One particular class of methods, based on the linear parametric representation of multiple interacting time series, is widely used to study causal connectivity in the brain .
Edit intent: clarity
Original:   Although many measures of causal connectivity derived from EEG sensor time series are affected by this , here we will focus on the well-known time domain index of Granger causality (GC) and on the frequency domain directed transfer function (DTF).
Revised:  Although many measures of causal connectivity derived from EEG sensor time series are affected by the latter , here we will focus on the well-known time domain index of Granger causality (GC) and on the frequency domain directed transfer function (DTF).
Edit intent: clarity
Original:  Using the state-space framework and designing two different simulation studies we show that mixing effects caused by volume conduction can lead to spurious connections, detected either by time domain GC or by DTF , when interpreted in terms of anatomically interacting sources .
Revised:  Using the state-space framework and designing two simulation studies we show that mixing effects caused by volume conduction can lead to spurious connections, detected either by time domain GC or by DTF , when interpreted in terms of anatomically interacting sources .
Edit intent: clarity
Original:  Using the state-space framework and designing two different simulation studies we show that mixing effects caused by volume conduction can lead to spurious connections, detected either by time domain GC or by DTF , when interpreted in terms of anatomically interacting sources .
Revised:  Using the state-space framework and designing two different simulation studies we show that mixing effects caused by volume conduction can lead to spurious connections, detected either by time domain GC or by DTF .
Edit intent: coherence
Original: In this paper we give a simple  two stage algorithm for approximating a point cloud S\subsetR^m by a simplicial complex K.
Revised: We give a simple two stage algorithm for approximating a point cloud S\subsetR^m by a simplicial complex K.
Edit intent: clarity
Original:  Our experiments on real data show that multiforce can keep nodes reasonably aligned across different layers without significantly affecting the internal layout of each layer .
Revised:  Our experiments on real data show that multiforce can keep nodes well aligned across different layers without significantly affecting the internal layout of each layer .
Edit intent: clarity
Original: The function f\colon \{-1,1\}^n \to \{-1,1\} is a k-junta if it depends on at most k of its variables.
Revised: A function f\colon \{-1,1\}^n \to \{-1,1\} is a k-junta if it depends on at most k of its variables.
Edit intent: fluency
Original:  Specifically, we design an algorithm that given \rho\in(0,1/2) accepts any function that is \frac{\epsilon\rho -close to some k-junta and rejects any function that is \epsilon-far from every k-junta.
Revised:  Specifically, we design an algorithm that given \rho\in(0,1/2) accepts any function that is \frac{\epsilon\rho -close to some k-junta and rejects any function that is \epsilon-far from every k-junta.
Edit intent: fluency
Original: We study nonlinear hyperbolic conservation laws posed on a differential (n+1)-manifold with boundary referred to as a spacetime, and in which the " flux " is defined as a flux field of n-forms depending on a parameter (the unknown variable), a class of equations recently proposed by LeFloch and Okutmustur .
Revised: We study nonlinear hyperbolic conservation laws posed on a differential (n+1)-manifold with boundary referred to as a spacetime, and in which the " flux field of n-forms depending on a parameter (the unknown variable), a class of equations recently proposed by LeFloch and Okutmustur .
Edit intent: clarity
Original: We study nonlinear hyperbolic conservation laws posed on a differential (n+1)-manifold with boundary referred to as a spacetime, and in which the " flux " is defined as a flux field of n-forms depending on a parameter (the unknown variable), a class of equations recently proposed by LeFloch and Okutmustur .
Revised: We study nonlinear hyperbolic conservation laws posed on a differential (n+1)-manifold with boundary referred to as a spacetime, and in which the " flux " is defined as a flux field of n-forms depending on a parameter (the unknown variable), a class of equations proposed by LeFloch and Okutmustur .
Edit intent: clarity
Original:  A main difference with previous work is that we allow here for slices with  boundary and, in addition, introduce a new formulation of the finite volume method which involves the notion of total flux functions.
Revised:  A main difference with previous work is that we allow for slices with boundary and, in addition, introduce a new formulation of the finite volume method which involves the notion of total flux functions.
Edit intent: clarity
Original:  A main difference with previous work is that we allow here for slices with  boundary and, in addition, introduce a new formulation of the finite volume method which involves the notion of total flux functions.
Revised:  A main difference with previous work is that we allow here for slices with a boundary and, in addition, introduce a new formulation of the finite volume method which involves the notion of total flux functions.
Edit intent: fluency
Original:  A main difference with previous work is that we allow here for slices with  boundary and, in addition, introduce a new formulation of the finite volume method which involves the notion of total flux functions.
Revised:  A main difference with previous work is that we allow here for slices with boundary and, in addition, introduce a new formulation of the finite volume method involving the notion of total flux functions.
Edit intent: coherence
Original:  Under a natural global hyperbolicity condition on the spacetime and provided the spacetime is foliated by compact slices (with boundary) , we establish an existence and uniqueness theory for the initial and boundary value problem, and derive a contraction property in a geometrically natural L1-type distance.
Revised:  Under a natural global hyperbolicity condition on the spacetime and provided the spacetime is foliated by compact slices with boundary , we establish an existence and uniqueness theory for the initial and boundary value problem, and derive a contraction property in a geometrically natural L1-type distance.
Edit intent: coherence
Original:  Under a natural global hyperbolicity condition on the spacetime and provided the spacetime is foliated by compact slices (with boundary) , we establish an existence and uniqueness theory for the initial and boundary value problem, and derive a contraction property in a geometrically natural L1-type distance.
Revised:  Under a natural global hyperbolicity condition on the spacetime and provided the spacetime is foliated by compact slices (with boundary) , we establish an existence and uniqueness theory for the initial and boundary value problem, and we prove a contraction property in a geometrically natural L1-type distance.
Edit intent: clarity
Original: The simultaneous expression of the hunchback gene in the multiple nuclei of the developing fly embryo gives us a unique opportunity to study how transcription is regulated in functional organisms.
Revised: The simultaneous expression of the hunchback gene in the numerous nuclei of the developing fly embryo gives us a unique opportunity to study how transcription is regulated in functional organisms.
Edit intent: fluency
Original: The simultaneous expression of the hunchback gene in the multiple nuclei of the developing fly embryo gives us a unique opportunity to study how transcription is regulated in functional organisms.
Revised: The simultaneous expression of the hunchback gene in the multiple nuclei of the developing fly embryo gives us a unique opportunity to study how transcription is regulated in living organisms.
Edit intent: clarity
Original:  Based on life imaging data, we identify signatures of bursty transcription initiation from the hunchback promoter.
Revised:  Based on live imaging data, we identify signatures of bursty transcription initiation from the hunchback promoter.
Edit intent: fluency
Original:  Our method is general and can be extended to any type of small organic molecule systems, as well as other descriptive polarizable force field  .
Revised:  Our method shows the possibility of developing descriptive polarizable force field .
Edit intent: clarity
Original:  Unlike the related results in the literature, we do not have to impose any smallness assumption on the size of the jumps of the predictable bracket of the driving martingale or on the Lipschitz constant of the generator .
Revised:  Our result allows in particular to obtain a wellposedness result for BSDEs driven by discrete-time approximations of general martingales .
Edit intent: clarity
Original:  Our result allows in particular to obtain a wellposedness result for BSDEs driven by discrete-time approximations of general martingales.
Revised:  Our result allows in particular to obtain a wellposedness result for BSDEs driven by discrete--time approximations of general martingales.
Edit intent: fluency
Original: A ubiquitous phenomenon is that interesting signals or data concentrate on low dimensional smooth manifolds inside a high dimensional ambient Euclidean space.
Revised: Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient Euclidean space.
Edit intent: clarity
Original: A ubiquitous phenomenon is that interesting signals or data concentrate on low dimensional smooth manifolds inside a high dimensional ambient Euclidean space.
Revised: A ubiquitous phenomenon is that interesting signals or data concentrate on low dimensional smooth manifolds inside a high dimensional ambient space.
Edit intent: clarity
Original:  Random projections are a simple and powerful tool for dimensionality reduction of such signals and data.
Revised:  Random projections are a simple , powerful tool for dimensionality reduction of such signals and data.
Edit intent: fluency
Original:  Random projections are a simple and powerful tool for dimensionality reduction of such signals and data.
Revised:  Random projections are a simple and powerful tool for dimensionality reduction of such data.
Edit intent: clarity
Original:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Revised:  Previous works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Edit intent: clarity
Original:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Revised:  Previous , seminal works have studied bounds on how many projections are needed to accurately preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Edit intent: clarity
Original:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Revised:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, given their intrinsic dimensionality, volume and curvature of the manifold .
Edit intent: clarity
Original:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature of the manifold .
Revised:  Previous , seminal works have studied bounds on how the number of projections needed to preserve the geometry of these manifolds, at a given accuracy, scales with the intrinsic dimensionality, volume and curvature .
Edit intent: clarity
Original:  Therefore such theory cannot be easily tested against numerical simulations to quantitatively understand the tightness of the proven bounds.
Revised:  Therefore such theory cannot be easily tested against numerical simulations to understand the tightness of the proven bounds.
Edit intent: clarity
Original:  We instead study the typical distortions arising in random projections of an ensemble of smooth Gaussian random manifolds.
Revised:  We instead study typical distortions arising in random projections of an ensemble of smooth Gaussian random manifolds.
Edit intent: fluency
Original:  In doing so, we find explicitly computable, approximate theoretical bounds on the number of projections required to preserve the geometric structure of these manifolds to a prescribed level of accuracy .
Revised:  We find explicitly computable, approximate theoretical bounds on the number of projections required to preserve the geometric structure of these manifolds to a prescribed level of accuracy .
Edit intent: clarity
Original:  In doing so, we find explicitly computable, approximate theoretical bounds on the number of projections required to preserve the geometric structure of these manifolds to a prescribed level of accuracy .
Revised:  In doing so, we find explicitly computable, approximate theoretical bounds on the number of projections required to accurately preserve the geometry of these manifolds to a prescribed level of accuracy .
Edit intent: clarity
Original:  In doing so, we find explicitly computable, approximate theoretical bounds on the number of projections required to preserve the geometric structure of these manifolds to a prescribed level of accuracy .
Revised:  In doing so, we find explicitly computable, approximate theoretical bounds on the number of projections required to preserve the geometric structure of these manifolds .
Edit intent: clarity
Original:  Our bounds, while approximate, can only be violated with a probability that is exponentially small in the ambient dimension, and therefore they hold with high probability in most cases of practical interest.
Revised:  Our bounds, while approximate, can only be violated with a probability that is exponentially small in the ambient dimension, and therefore they hold with high probability in cases of practical interest.
Edit intent: clarity
Original:  Through this comparison, we find our bounds are tighter than previous results by several orders of magnitude.
Revised:  We find our bounds are tighter than previous results by several orders of magnitude.
Edit intent: clarity
Original:  It uses several approximation methods to quickly and accurately calculate the probability distributions describing the times that tasks start and finish.
Revised:  It uses several approximation methods to quickly and accurately calculate the probability distributions describing the times at which the tasks start and finish.
Edit intent: clarity
Original:  Specific contributions include a method for calculating the probability of a set of independent normally distributed random events occurring in a given order, an upper bound on that probability, and a method for calculating the most likely and n-th most likely orders of occurrence for a set of independent normally distributed random events that have equal standard deviations  .
Revised:  Specific contributions include a method for calculating the probability of a set of independent normally distributed random events occurring in a given order, a method for calculating the most likely and n-th most likely orders of occurrence for a set of independent normally distributed random events that have equal standard deviations .
Edit intent: clarity
Original:  The complete framework is shown to be much faster than a Monte Carlo approach for the same accuracy in two multi-robot task allocation problems.
Revised:  The complete framework is shown to be faster than a Monte Carlo approach for the same accuracy in two multi-robot task allocation problems.
Edit intent: clarity
Original:   This is a general framework that is agnostic to the optimisation method and objective function used, and is applicable to a wide range of robotics and non-robotics problems.
Revised:  This is a general framework that is agnostic to the optimisation method and objective function used, and is applicable to a wide range of problems.
Edit intent: clarity
Original:  In this work , we present a novel model for Cloze-style reading comprehension tasks, called attention-over-attention reader .
Revised:  In this paper , we present a novel model for Cloze-style reading comprehension tasks, called attention-over-attention reader .
Edit intent: clarity
Original:  In this work , we present a novel model for Cloze-style reading comprehension tasks, called attention-over-attention reader .
Revised:  In this work , we present a novel model called attention-over-attention reader for the Cloze-style reading comprehension tasks, called attention-over-attention reader .
Edit intent: fluency
Original:  In this work , we present a novel model for Cloze-style reading comprehension tasks, called attention-over-attention reader .
Revised:  In this work , we present a novel model for Cloze-style reading comprehension task .
Edit intent: coherence
Original: Motivated by growing interest in evolutionary network theory, we construct the first examples of undirected graph structures acting as reducers of selection .
Revised: Motivated by growing interest in evolutionary network theory, we construct the first examples of undirected structures acting as reducers of selection .
Edit intent: clarity
Original:  In particular, processes to check for, and certify, various matrix properties of black-box matrices are presented.
Revised:  In particular, processes to check for, and certify, various matrix properties of black box matrices are presented.
Edit intent: fluency
Original:  In the diagnosis system , the data analysis is performed by the diagnosis application.
Revised:  With DiaSys , the data analysis is performed by the diagnosis application.
Edit intent: clarity
Original:  We evaluate the concept using an FPGA and software based prototype on two use cases: finding a functional software bug, and creating a lock contention profile .
Revised:  We evaluate the concept using an FPGA and software based prototype on two use cases: finding a functional software bug, and the creation of a lock contention profile .
Edit intent: fluency
Original:  A two-point jump-diffusion model with fast mean-reverting stochastic volatility is employed to describe the dynamics of the underlying stock price.
Revised:  A two-point jump-diffusion model with fast mean-reverting stochastic volatility is employed to describe the dynamics of the fundamental stock price.
Edit intent: clarity
Original: In this paper, we generalize the work in Almgren-Chriss  to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal execution problem in a security market.
Revised: In this paper, we generalize the Almgren-Chriss to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal execution problem in a security market.
Edit intent: clarity