wanyu/IteraTeR_v2 huggingface dataset:
Original:  Comparison of published objective measures and subjective scores shows the objective measures to be poor indicators of subjective quality.
Revised:  A comparison of published objective measures and subjective scores shows the objective measures to be poor indicators of subjective quality.
Edit intent: fluency
Original:  A modified version of PEAQ Basic was retrained using the subjective results and achieved root mean squared error loss of 0.668 and Pearson correlation of 0.719 for all files.
Revised:  Initial results for a retrained objective measure of quality are presented with results approaching average root mean squared error loss of 0.668 and Pearson correlation of 0.719 for all files.
Edit intent: clarity
Original:  A modified version of PEAQ Basic was retrained using the subjective results and achieved root mean squared error loss of 0.668 and Pearson correlation of 0.719 for all files.
Revised:  A modified version of PEAQ Basic was retrained using the subjective results and achieved root mean squared error loss and Pearson correlation of 0.719 for all files.
Edit intent: clarity
Original: Building natural language  interfaces for databases has been a long-standing challenge for several decades.
Revised: Building natural language (NL) interfaces for databases has been a long-standing challenge for several decades.
Edit intent: clarity
Original:  The major advantage of these so-called text-to-SQL systems is that end-users can query complex databases without the need to know SQL or the underlying database schema.
Revised:  The major advantage of these so-called NL-to-SQL systems is that end-users can query complex databases without the need to know SQL or the underlying database schema.
Edit intent: fluency
Original:  Several recent text-to-SQL systems achieve promising results on this dataset.
Revised:  Several recent NL-to-SQL systems achieve promising results on this dataset.
Edit intent: fluency
Original:  In this paper we propose ValueNet light and ValueNet -- the first end-to-end text-to-SQL system incorporating values on the challenging Spider dataset.
Revised:  In this paper we propose ValueNet light and ValueNet -- the first end-to-end NL-to-SQL systems that incorporate values using the challenging Spider dataset.
Edit intent: clarity
Original:  The main idea of our approach is to use not only metadata information about the underlying database but also information on the base data as input for our neural network architecture.
Revised:  The main idea of our approach is to use not only metadata information from the underlying database but also information on the base data as input for our neural network architecture.
Edit intent: clarity
Original:  We demonstrate how  performance can be further improved by training an ensemble of policy networks with shared parameters, each network conditioned on a different autoregressive factorization order.
Revised:  We demonstrate how the algorithm's performance can be further improved by training an ensemble of policy networks with shared parameters, each network conditioned on a different autoregressive factorization order.
Edit intent: clarity
Original:  We demonstrate how  performance can be further improved by training an ensemble of policy networks with shared parameters, each network conditioned on a different autoregressive factorization order.
Revised:  We demonstrate how performance can be further improved by training an ensemble of policy networks with shared parameters, each block conditioned on a different autoregressive factorization order.
Edit intent: clarity
Original:  We demonstrate how  performance can be further improved by training an ensemble of policy networks with shared parameters, each network conditioned on a different autoregressive factorization order.
Revised:  We demonstrate how performance can be further improved by training an ensemble of policy networks with shared parameters, each network conditioned on a different auto-regressive factorization order.
Edit intent: fluency
Original:  In particular, it outperforms RL methods based on policy gradients that use alternate architectures to specify the policy network, underscoring the importance of using masked attention in this setting.
Revised:  In particular, it outperformed RL based methods that use alternate architectures to specify the policy network, underscoring the importance of using masked attention in this setting.
Edit intent: clarity
Original:  In particular, it outperforms RL methods based on policy gradients that use alternate architectures to specify the policy network, underscoring the importance of using masked attention in this setting.
Revised:  In particular, it outperforms RL methods based on policy gradients that use alternate architectures to model the policy network, underscoring the importance of using masked attention in this setting.
Edit intent: clarity
Original:  In particular, it outperforms RL methods based on policy gradients that use alternate architectures to specify the policy network, underscoring the importance of using masked attention in this setting.
Revised:  In particular, it outperforms RL methods based on policy gradients that use alternate architectures to specify the policy network, underlining the value of using attention-based networks in this setting.
Edit intent: clarity
Original:   We have adhered to guidelines listed in Lindauer Hutter (2019) while designing experiments and reporting results.
Revised:  We have adhered to guidelines listed in Lindauer and Hutter while designing experiments and reporting results.
Edit intent: clarity
Original:  By exploiting our background, we debunk the alleged health effects of 5G exposure and critically review the latest works that are often referenced to support the health concerns from 5G.
Revised:  By exploiting our background, we analyze the alleged health effects of 5G exposure and critically review the latest works that are often referenced to support the health concerns from 5G.
Edit intent: clarity
Original: Artificial neural networks (ANNs) are essential tools in machine learning that are increasingly used for building computational models in neuroscience.
Revised: Artificial neural networks (ANNs) are essential tools in machine learning that have drawn increasing attention in neuroscience.
Edit intent: clarity
Original:  In this pedagogical Primer, we introduce conventional ANNs and demonstrate how they have been  deployed to study neuroscience questions.
Revised:  In this pedagogical Primer, we introduce ANNs and demonstrate how they have been deployed to study neuroscience questions.
Edit intent: clarity
Original:  In this paper, we propose a root-aware approach to quantify the virality of cascades with proper consideration of the root node in a diffusion tree.
Revised:  In this paper, we propose a root-aware approach to quantifying the virality of cascades with proper consideration of the root node in a diffusion tree.
Edit intent: fluency
Original:  With applications on synthetic and empirical cascades, we show the property and potential utility of the proposed virality measure.
Revised:  With applications on synthetic and empirical cascades, we show the properties and potential utility of the proposed virality measure.
Edit intent: fluency
Original:  Based on preferential attachment mechanism , we further introduce a model to mimic the growth of cascades.
Revised:  Based on preferential attachment mechanisms , we further introduce a model to mimic the growth of cascades.
Edit intent: fluency
Original:  Through numerical simulations, we show the effectiveness of the proposed model in characterizing the virality of growing cascades.
Revised:  Through numerical simulations, we demonstrate the effectiveness of the proposed model in characterizing the virality of growing cascades.
Edit intent: clarity
Original:  Our work contributes to the scientific understanding of cascade virality and growth, and could offer practical implications in a range of policy domains including viral marketing, infectious disease and information diffusion.
Revised:  Our work contributes to the understanding of cascade virality and growth, and could offer practical implications in a range of policy domains including viral marketing, infectious disease and information diffusion.
Edit intent: clarity
Original: We introduce the concept of dynamical score networks for the representation and analysis of tonal compositions: a score can always be interpreted as a dynamical network where every chord is a node and each progression links successive chords.
Revised: We introduce the concept of dynamical score networks for the representation and analysis of tonal compositions: a score is interpreted as a dynamical network where every chord is a node and each progression links successive chords.
Edit intent: clarity
Original:  We then consider a simple setting in which introducing contingent convertible bonds improves financial stability, as well as specific networks for which contingent convertible bonds do not provide uniformly improved system performance.
Revised:  We then introduce stylized networks to study when introducing contingent convertible bonds improves financial stability, as well as specific networks for which contingent convertible bonds do not provide uniformly improved system performance.
Edit intent: clarity
Original:  These devices are programmed in a domain-specific language such as P4, using a compiler to translate packet-processing programs into instructions for different targets.
Revised:  These devices are configured in a domain-specific language such as P4, using a compiler to translate packet-processing programs into instructions for different targets.
Edit intent: clarity
Original:  As networks with programmable devices become widespread, it is critical that these compilers are dependable.
Revised:  As networks with programmable devices become widespread, it is critical that these compilers be dependable.
Edit intent: fluency
Original:  We apply these techniques to (1) the open-source P4 compiler (P4C) infrastructure, which serves as a  base for different P4 back ends;
Revised:  We apply these techniques to (1) the open-source P4 compiler (P4C) infrastructure, which serves as a common base for different P4 back ends;
Edit intent: clarity
Original:  44 have been fixed ( 27 crash and 17 semantic);
Revised:  54 have been fixed ( 27 crash and 17 semantic);
Edit intent: fluency
Original: Artificial neural networks ( ANNS have shown much empirical success in solving perceptual tasks across various cognitive modalities.
Revised: Artificial neural networks ( ANNs) have shown much empirical success in solving perceptual tasks across various cognitive modalities.
Edit intent: fluency
Original:  While they are only loosely inspired by the biological brain, recent studies report considerable similarities between representation extracted from task-optimized ANNS and neural populations in the brain.
Revised:  While they are only loosely inspired by the biological brain, recent studies report considerable similarities between representation extracted from task-optimized ANNs and neural populations in the brain.
Edit intent: fluency
Original:  While they are only loosely inspired by the biological brain, recent studies report considerable similarities between representation extracted from task-optimized ANNs and neural populations in the brain.
Revised:  While they are only loosely inspired by the biological brain, recent studies report considerable similarities between representations extracted from task-optimized ANNs and neural populations in the brain.
Edit intent: fluency
Original:  In this work, we utilize mean-field theoretic manifold analysis, a recent technique from computational neuroscience  , to analyze the high dimensional geometry of language representations from large-scale contextual embedding models.
Revised:  In this work, we utilize mean-field theoretic manifold analysis, a recent technique from computational neuroscience , to analyze language representations from large-scale contextual embedding models.
Edit intent: coherence
Original:  In addition, we find that the emergence of linear separability in these manifolds is driven by a combined reduction of manifolds  radius, dimensionality and inter-manifold correlations.
Revised:  In addition, we find that the emergence of linear separability in these manifolds is driven by a combined reduction of manifolds ' radius, dimensionality and inter-manifold correlations.
Edit intent: fluency
Original:  Our intended aim is to discover  decomposable flows as they originate in sensor given outputs for time-varying matrix problems and thereby  reduce the complexities of their numerical treatment .
Revised:  Our intended aim is to discover decomposable flows as they originate in sensor driven outputs for time-varying matrix problems and thereby reduce the complexities of their numerical treatment .
Edit intent: clarity
Original:  Our intended aim is to discover  decomposable flows as they originate in sensor given outputs for time-varying matrix problems and thereby  reduce the complexities of their numerical treatment .
Revised:  Our intended aim is to discover decomposable flows as they originate in sensor given outputs for time-varying matrix problems and thereby help to reduce the complexities of their numerical treatment .
Edit intent: clarity
Original:  In  case of matrices (2-ordered tensor)  our online row sampling algorithm guarantees (1 \pm \epsilon) relative error spectral approximation.
Revised:  In the case of matrices (2-ordered tensor) our online row sampling algorithm guarantees (1 \pm \epsilon) relative error spectral approximation.
Edit intent: fluency
Original:  In  case of matrices (2-ordered tensor)  our online row sampling algorithm guarantees (1 \pm \epsilon) relative error spectral approximation.
Revised:  In case of matrices (2-ordered tensor) , our online row sampling algorithm guarantees (1 \pm \epsilon) relative error spectral approximation.
Edit intent: fluency
Original: The Coronavirus Disease 2019 (COVID-19) pandemic has infected >5.5 million people globally and carries a relatively high mortality rate.
Revised: The Coronavirus Disease 2019 (COVID-19) pandemic has infected >5.5 million people globally with a relatively high mortality rate.
Edit intent: coherence
Original:  Currently, there is no effective vaccine or therapy approved for the treatment COVID-19, though many such therapeutics are being evaluated in clinical trials.
Revised:  There are many therapeutics undergoing clinical trials, but there is no effective vaccine or therapy approved for the treatment COVID-19, though many such therapeutics are being evaluated in clinical trials.
Edit intent: coherence
Original:  Finally it saves the convex hull of all intermediate field of values boundary curves in order to plot the field of values of Aproperly .
Revised:  The convex hull of all intermediate field of values boundary curves in order to plot the field of values of Aproperly .
Edit intent: coherence
Original:  Finally it saves the convex hull of all intermediate field of values boundary curves in order to plot the field of values of Aproperly .
Revised:  Finally it saves the convex hull of all intermediate field of values boundary points then determines the field of values of Aproperly .
Edit intent: clarity
Original:  The convex hull of all sub field of values boundary points then determines the field of values boundary curve correctly for decomposing and non-decomposing matrices A.
Revised:  The convex hull of all sub-fields of values boundary points then determines the field of values boundary curve correctly for decomposing and non-decomposing matrices A.
Edit intent: fluency
Original: The dream of machine learning in materials science is for a machine learned model to learn the underlying physics of an atomic system, allowing the model to move beyond interpolation of the training set to the prediction of properties that were not present in the original training data.
Revised: The dream of machine learning in materials science is for a model to learn the underlying physics of an atomic system, allowing the model to move beyond interpolation of the training set to the prediction of properties that were not present in the original training data.
Edit intent: clarity
Original: The dream of machine learning in materials science is for a machine learned model to learn the underlying physics of an atomic system, allowing the model to move beyond interpolation of the training set to the prediction of properties that were not present in the original training data.
Revised: The dream of machine learning in materials science is for a machine learned model to learn the underlying physics of an atomic system, allowing it to move beyond interpolation of the training set to the prediction of properties that were not present in the original training data.
Edit intent: clarity
Original:  Curation of high-quality literature values for the infectious period duration or household secondary attack rate, for example, is especially pressing right now because these numbers inform decisions about how and when to lockdown or reopen societies.
Revised:  Curation of high-quality literature values for the infectious period duration or household secondary attack rate, for example, is especially pressing currently because these numbers inform decisions about how and when to lockdown or reopen societies.
Edit intent: coherence
Original:  For each property, we provide a concise definition, description of measurement and inference methods  and associated caveats.
Revised:  For each property, we provide a concise definition, description of measurement and inference methods , and associated caveats.
Edit intent: fluency
Original:  In turn, the proposed online mechanisms are shown to be incentive-compatible in the dynamic sense and computationally efficient .
Revised:  In turn, the proposed online mechanisms are shown to be incentive-compatible in the dynamic sense .
Edit intent: clarity
Original:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: coherence
Original:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( ``may a pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specificspecific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that sparse instances can be solved in O(n^{3/2 even on-demand APA ( "may a specific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  This formally establishes the long-conjectured "cubic bottleneck" of APA, and shows that our O(n^3)-time algorithm is optimal.
Revised:  This formally establishes the long-conjectured ``cubic bottleneck'' of APA, and shows that our O(n^3)-time algorithm is optimal.
Edit intent: fluency
Original:  Fourth , we show that under mild restrictions, APA is solvable in O(n^{\omega}) time, where \omega<2.
Revised:  Third , we show that under mild restrictions, APA is solvable in O(n^{\omega}) time, where \omega<2.
Edit intent: fluency
Original:  Fifth , we show that even under such restrictions, even the on-demand problem has an \Omega(n^2) lower bound under standard complexity-theoretic hypotheses , and hence our algorithm is optimal when \omega=2+o(1)  .
Revised:  Fourth , we show that even under such restrictions, even the on-demand problem has an \Omega(n^2) lower bound under standard complexity-theoretic hypotheses , and hence our algorithm is optimal when \omega=2+o(1) .
Edit intent: fluency
Original:  Fifth , we show that even under such restrictions, even the on-demand problem has an \Omega(n^2) lower bound under standard complexity-theoretic hypotheses , and hence our algorithm is optimal when \omega=2+o(1)  .
Revised:  Fifth , we show that even under such restrictions, even the on-demand problem has an \Omega(n^2) lower bound , and hence our algorithm is optimal when \omega=2+o(1) .
Edit intent: clarity
Original:  Besides this simple bound, the complexity of the problem has remained poorly understood.
Edit intent: coherence
Original:  Second, we show that even on-demand APA ( ``may aspecific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that even on-demand APA ( specific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: clarity
Original:  Second, we show that even on-demand APA ( ``may aspecific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that even on-demand APA ( ``may aspecific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  Second, we show that even on-demand APA ( ``may aspecific pointer a point to a specific location b? '' ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Revised:  Second, we show that even on-demand APA ( ``may aspecific pointer a point to a specific location b? " ) has an \Omega(n^3) (combinatorial) lower bound under standard complexity-theoretic hypotheses.
Edit intent: fluency
Original:  This formally establishes the long-conjectured ``cubic bottleneck'' of APA, and shows that our O(n^3)-time algorithm is optimal.
Revised:  This formally establishes the long-conjectured "cubic bottleneck" of APA, and shows that our O(n^3)-time algorithm is optimal.
Edit intent: fluency
Original: 373 is the matrix-multiplication coefficient .
Revised: 373 is the matrix-multiplication exponent .
Edit intent: clarity