wanyu/IteraTeR_v2 huggingface dataset:
Original:  Using character-level language models as an interpretable testbed, we aim to bridge this gap by providing a comprehensive analysis of their representations, predictions and error types.
Revised:  Using character-level language models as an interpretable testbed, we aim to bridge this gap by providing an analysis of their representations, predictions and error types.
Edit intent: clarity
Original:  Moreover, an extensive analysis with finite horizon n-gram models suggest that these dependencies are actively discovered and utilized by the networks .
Revised:  Moreover, our comparative analysis with finite horizon n-gram models suggest that these dependencies are actively discovered and utilized by the networks .
Edit intent: clarity
Original:  Finally, we provide detailed error analysis that suggests areas for further study.
Revised:  Finally, we provide analysis of the remaining errors and suggests areas for further study.
Edit intent: clarity
Original:  It is order-preserving if the edges to children appear in prescribed order around each vertex . Chan showed that any tree has an upward order-preserving drawing with width O( \log n).
Revised:  It is order-preserving if the edges to children appear in prescribed order around each node . Chan showed that any tree has an upward order-preserving drawing with width O( \log n).
Edit intent: clarity
Original:  It is order-preserving if the edges to children appear in prescribed order around each vertex . Chan showed that any tree has an upward order-preserving drawing with width O( \log n).
Revised:  It is order-preserving if the edges to children appear in prescribed order around each vertex . Chan showed that any tree has an upward order-preserving drawing with width O( log n).
Edit intent: coherence
Original:  We present a linear-time algorithm that finds such drawings with instance-optimal width, i.e., the width is the minimum-possible for the input tree.
Revised:  We present a linear-time algorithms that finds upward with instance-optimal width, i.e., the width is the minimum-possible for the input tree.
Edit intent: clarity
Original:  We  also briefly study order-preserving upward straight-line drawings, and show that some trees require larger width if drawings must additionally be straight-line.
Revised:  We also briefly study order-preserving upward straight-line drawings, and show that some trees require larger width if drawings must be straight-line.
Edit intent: clarity
Original: For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognise this language with a non-deterministic, alternating, or weak alternating parity automaton.
Revised: For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognize this language with a non-deterministic, alternating, or weak alternating parity automaton.
Edit intent: fluency
Original:  Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognisable by deterministic automata (the alternating variant trivialises ).
Revised:  Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognizable by deterministic automata (the alternating variant trivialises ).
Edit intent: fluency
Original:  Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognisable by deterministic automata (the alternating variant trivialises ).
Revised:  Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognisable by deterministic automata (the alternating variant trivializes ).
Edit intent: fluency
Original:  We investigate a wider class of regular languages, recognisable by so-called game automata, which can be seen as the closure of deterministic ones under complementation and composition.
Revised:  We investigate a wider class of regular languages, recognizable by so-called game automata, which can be seen as the closure of deterministic ones under complementation and composition.
Edit intent: fluency
Original:  Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy , i.e., the alternating index problem does not trivialise any more.
Revised:  Game automata are known to recognize languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy , i.e., the alternating index problem does not trivialise any more.
Edit intent: fluency
Original:  Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy , i.e., the alternating index problem does not trivialise any more.
Revised:  Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy ; that is, the alternating index problem does not trivialise any more.
Edit intent: coherence
Original:  Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy , i.e., the alternating index problem does not trivialise any more.
Revised:  Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy , i.e., the alternating index problem does not trivialize any more.
Edit intent: fluency
Original:  Our main contribution is that all three index problems are decidable for languages recognisable by game automata.
Revised:  Our main contribution is that all three index problems are decidable for languages recognizable by game automata.
Edit intent: fluency
Original:  Additionally, we show that it is decidable whether a given regular language can be recognised by a game automaton.
Revised:  Additionally, we show that it is decidable whether a given regular language can be recognized by a game automaton.
Edit intent: fluency
Original:  Although it is intuitive that visual objects that appear similar may share similar underlying patterns of neural activation , a direct mapping between perceptual similarity and representational distance has not been demonstrated .
Revised:  Although it is intuitive that visual objects that appear similar also share similar underlying patterns of neural activation , a direct mapping between perceptual similarity and representational distance has not been demonstrated .
Edit intent: clarity
Original:  Although it is intuitive that visual objects that appear similar may share similar underlying patterns of neural activation , a direct mapping between perceptual similarity and representational distance has not been demonstrated .
Revised:  Although it is intuitive that visual objects that appear similar may share similar underlying patterns of neural activation .
Edit intent: coherence
Original:  Here we explore the  relationship between the human brain's time-varying representation of visual patterns and behavioral judgments of perceptual similarity.
Revised:  Here we explore the temporal relationship between the human brain's time-varying representation of visual patterns and behavioral judgments of perceptual similarity.
Edit intent: fluency
Original:  Overall the strongest predictor of the brain's representation was a model based on human judgments of perceptual similarity, which reached the theoretical limits of the maximum correlation with the neural data defined by the 'noise ceiling'.
Revised:  Overall the strongest predictor of the brain's representation was a model based on human judgments of perceptual similarity, which reached the limits of the maximum correlation with the neural data defined by the 'noise ceiling'.
Edit intent: clarity
Original:  In contrast to single-source distances (and " forward " ranks), which can be computed in near-linear time by Dijkstra's algorithm, we show that {\em exact } reverse ranks for a single source are, in the worst-case, as hard to compute as all-pairs shortest paths, and thus can not be scalably computed even on a medium size graph.
Revised:  In contrast to single-source computation of reverse-ranks and design a " forward " ranks), which can be computed in near-linear time by Dijkstra's algorithm, we show that {\em exact } reverse ranks for a single source are, in the worst-case, as hard to compute as all-pairs shortest paths, and thus can not be scalably computed even on a medium size graph.
Edit intent: clarity
Original:  Our main contribution is the first scalable algorithm to compute%DIFDELCMD < {\em %DIFDELCMD < %%% approximate reverse ranks within a small relative error.
Revised:  Our main contribution is the first scalable algorithm to compute%DIFDELCMD < {\em %DIFDELCMD < %%% reverse ranks within a small relative error.
Edit intent: clarity
Original:  Another contribution we make that is of independent interest is a novel algorithm for computing all-distances sketches, which we use for preprocessing , on multi-core architectures.
Revised:  Another contribution we make that is of independent interest , we present a novel algorithm for computing all-distances sketches, which we use for preprocessing , on multi-core architectures.
Edit intent: clarity
Original:  Another contribution we make that is of independent interest is a novel algorithm for computing all-distances sketches, which we use for preprocessing , on multi-core architectures.
Revised:  Another contribution we make that is of independent interest is a novel algorithm for computing these sketches, which we use for preprocessing , on multi-core architectures.
Edit intent: clarity
Original:  We {\em  {\em   conduct an experimental evaluation on graphs with hundreds of millions of edges, demonstrating both scalability and accuracy .
Revised:  We {\em {\em exact conduct an experimental evaluation on graphs with hundreds of millions of edges, demonstrating both scalability and accuracy .
Edit intent: fluency
Original:  Finally, we define reverse-rank influence, which naturally extends reverse nearest neighbors influence Korn and Muthukrishnan 2000%DIFDELCMD < ] %%% and show how our reverse-rank single-source computation facilitates scalable greedy reverse-rank influence maximization .
Revised:  Finally, we define reverse-rank influence, which naturally extends reverse nearest neighbors influence %DIFDELCMD < ] %%% and show how our reverse-rank single-source computation facilitates scalable greedy reverse-rank influence maximization .
Edit intent: coherence
Original:  Finally, we define reverse-rank influence, which naturally extends reverse nearest neighbors influence Korn and Muthukrishnan 2000%DIFDELCMD < ] %%% and show how our reverse-rank single-source computation facilitates scalable greedy reverse-rank influence maximization .
Revised:  Finally, we define reverse-rank influence, which naturally extends reverse nearest neighbors influence Korn and Muthukrishnan 2000%DIFDELCMD < ] %%% .
Edit intent: coherence
Original:  The resulting prints show tremendous detail and realism .
Revised:  The resulting prints faithfully reproduce colors, color gradients and fine-scale details .
Edit intent: clarity
Original:  This allows to automatically identify events as Twitter volume peaks, to compute the prevailing sentiment (positive or negative) expressed in tweets at these peaks, and finally to apply the "event study" methodology to relate them to stock returns.
Revised:  The procedure allows to automatically identify events as Twitter volume peaks, to compute the prevailing sentiment (positive or negative) expressed in tweets at these peaks, and finally to apply the "event study" methodology to relate them to stock returns.
Edit intent: clarity
Original:  In classic engineering literature simplified mathematical models and simulation are widely used for its study.
Revised:  In classic engineering literature simplified mathematical models and simulation are widely used for their study.
Edit intent: fluency
Original:  In this work the limitations of classic engineering analysis are demonstrated , e.g. , hidden oscillations cannot be found by simulation.
Revised:  In this work the limitations of numerical approach is discussed and it is shown that , e.g. , hidden oscillations cannot be found by simulation.
Edit intent: clarity
Original:  In this work the limitations of classic engineering analysis are demonstrated , e.g. , hidden oscillations cannot be found by simulation.
Revised:  In this work the limitations of classic engineering analysis are demonstrated , e.g. hidden oscillations may not be found by simulation.
Edit intent: fluency
Original:  It is shown that simple simulation in SPICE and MATLAB may lead to wrong conclusions concerning the operability of PLL-based circuits  .
Revised:  Corresponding examples in SPICE and MATLAB may lead to wrong conclusions concerning the operability of PLL-based circuits .
Edit intent: clarity
Original:  It is shown that simple simulation in SPICE and MATLAB may lead to wrong conclusions concerning the operability of PLL-based circuits  .
Revised:  It is shown that simple simulation in SPICE and MatLab, which may lead to wrong conclusions concerning the operability of PLL-based circuits .
Edit intent: coherence
Original: We present a fresh and general yet simple approach towards information retrieval in general and diagnostics in particular by applying the theory of complex networks on multidimensional  images.
Revised: We present a fresh and broad yet simple approach towards information retrieval in general and diagnostics in particular by applying the theory of complex networks on multidimensional images.
Edit intent: clarity
Original:  We demonstrate a successful use of our method with the time series generated from high content thermal imaging videos of patients suffering from  aqueous deficient dry eye (ADDE) disease.
Revised:  We demonstrate a successful use of our method with the time series generated from high content thermal imaging videos of patients suffering from the aqueous deficient dry eye (ADDE) disease.
Edit intent: fluency
Original:  The approach is scalable to a device where fluctuation derived network parameters serve as diagnostic markers.
Edit intent: coherence
Original:  Remarkably, network analysis of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibits pronounced similarities with results obtained from ADDE patients.
Revised:  Remarkably, network analyses of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibits pronounced similarities with results obtained from ADDE patients.
Edit intent: fluency
Original:  Remarkably, network analysis of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibits pronounced similarities with results obtained from ADDE patients.
Revised:  Remarkably, network analysis of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibit pronounced similarity with results obtained from ADDE patients.
Edit intent: fluency
Original:  We also propose a general framework for  transformation of multidimensional images to networks for futuristic biometry  .
Revised:  We also propose a general framework for the transformation of multidimensional images to networks for futuristic biometry .
Edit intent: fluency
Original:  To address these limitations, we describe a method to reduce the storage and computation required by neural networks by an order of magnitude without affecting their accuracy , by learning only the important connections.
Revised:  To address these limitations, we describe a method to reduce the storage and computation required by neural networks by an order of magnitude without affecting their accuracy by learning only the important connections.
Edit intent: fluency
Original:  Similar experiments with VGG16 found that the network as a whole can be reduced by 13x  , again with no loss of accuracy.
Revised:  Similar experiments with VGG-16 found that the network as a whole can be reduced by 13x , again with no loss of accuracy.
Edit intent: fluency
Original:  Similar experiments with VGG16 found that the network as a whole can be reduced by 13x  , again with no loss of accuracy.
Revised:  Similar experiments with VGG16 found that the number of parameters can be reduced by 13x , again with no loss of accuracy.
Edit intent: clarity
Original: This paper is a continuation of Ishitani and Kato (2015), in which we derive a continuous-time value function corresponding to an optimal execution problem with uncertain market impact as a limit of a discrete-time value function.
Revised: This paper is a continuation of Ishitani and Kato (2015), in which we derived a continuous-time value function corresponding to an optimal execution problem with uncertain market impact as a limit of a discrete-time value function.
Edit intent: fluency
Original: This paper is a continuation of Ishitani and Kato (2015), in which we derive a continuous-time value function corresponding to an optimal execution problem with uncertain market impact as a limit of a discrete-time value function.
Revised: This paper is a continuation of Ishitani and Kato (2015), in which we derive a continuous-time value function corresponding to an optimal execution problem with uncertain market impact as the limit of a discrete-time value function.
Edit intent: fluency
Original:  In this paper , we investigate  properties of the  value function.
Revised:  Here , we investigate properties of the value function.
Edit intent: coherence
Original:  In this paper , we investigate  properties of the  value function.
Revised:  In this paper , we investigate some properties of the value function.
Edit intent: coherence
Original:  Especially , we show continuity and the semigroup property, which are strongly related with the Hamilton-Jacobi-Bellman quasi-variational inequality.
Revised:  In particular , we show continuity and the semigroup property, which are strongly related with the Hamilton-Jacobi-Bellman quasi-variational inequality.
Edit intent: coherence
Original:  Especially , we show continuity and the semigroup property, which are strongly related with the Hamilton-Jacobi-Bellman quasi-variational inequality.
Revised:  Especially , we show that the function is continuous and has the semigroup property, which are strongly related with the Hamilton-Jacobi-Bellman quasi-variational inequality.
Edit intent: clarity
Original:  Especially , we show continuity and the semigroup property, which are strongly related with the Hamilton-Jacobi-Bellman quasi-variational inequality.
Revised:  Especially , we show continuity and the semigroup property, which is strongly related to the Hamilton-Jacobi-Bellman quasi-variational inequality.
Edit intent: fluency
Original:  Moreover, we show that noise in market impact will cause a risk-neutral trader to underestimate the impact cost.
Revised:  Moreover, we show that noise in market impact causes risk-neutral trader to underestimate the impact cost.
Edit intent: clarity
Original:  Moreover, we show that noise in market impact will cause a risk-neutral trader to underestimate the impact cost.
Revised:  Moreover, we show that noise in market impact will cause a risk-neutral assessment to underestimate the impact cost.
Edit intent: clarity
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{mact /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: fluency
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m act/m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: fluency
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m =\limsup k_{m/m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: fluency
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. ~of an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: clarity
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of /m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: clarity
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } act \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Edit intent: fluency
Original:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp.  an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m }  \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the infinite Fibonacci word.
Revised:  Starting from these results, if k_{m /m=\limsup k'_{m}/m, where k_{m} } (resp. k'_{m}) denotes the maximal exponent of an abelian power (resp. an abelian repetition) of period m, we prove that \limsup k_{m/m=\limsup k'_{m}/m } \geq 5 for any Sturmian word s_{\alpha , and the equality holds for the Fibonacci word.
Edit intent: clarity