wanyu/IteraTeR_v2 huggingface dataset:
Original:  However for{\em   a constant number of alternatives, we show that the stable manipulation problem is polynomial time solvable for every anonymous and efficient voting rules.
Revised:  In contrast,{\em a constant number of alternatives, we show that the stable manipulation problem is polynomial time solvable for every anonymous and efficient voting rules.
Edit intent: coherence
Original:  It is shown that counting perfect matchings, and a host of other graph properties naturally defined as Holant problems (edge models), cannot be expressed by graph homomorphism functions over the complex numbers (or even  more general fields).
Revised:  It is shown that counting perfect matchings, and a host of other graph properties naturally defined as Holant problems (edge models), cannot be expressed by graph homomorphism functions over the complex numbers (or even from more general fields).
Edit intent: fluency
Original:  The key properties that make these systems mathematically tractable is that the noise appears linearly in the dynamical equations  and it is assumed Gaussian and white.
Revised:  The key properties that make these systems mathematically tractable are that the noise appears linearly in the dynamical equations and it is assumed Gaussian and white.
Edit intent: fluency
Original:  The key properties that make these systems mathematically tractable is that the noise appears linearly in the dynamical equations  and it is assumed Gaussian and white.
Revised:  The key properties that make these systems mathematically tractable is that the noise appears linearly in the dynamical equations , and it is assumed Gaussian and white.
Edit intent: fluency
Original: High frequency noise has  been difficult to cancel actively at a person's ears, particularly for active headrest systems aiming to free the listener from noise cancellation headphones.
Revised: High frequency noise has generally been difficult to cancel actively at a person's ears, particularly for active headrest systems aiming to free the listener from noise cancellation headphones.
Edit intent: coherence
Original: High frequency noise has  been difficult to cancel actively at a person's ears, particularly for active headrest systems aiming to free the listener from noise cancellation headphones.
Revised: High frequency noise has been difficult to be cancelled actively at a person's ears, particularly for active headrest systems aiming to free the listener from noise cancellation headphones.
Edit intent: clarity
Original:  One of the main issues is to measure the noise precisely at the ears.
Revised:  One of the main challenges is to measure the noise precisely at the ears.
Edit intent: clarity
Original:  It can determine the noise accurately for active noise cancellation (ANC ) without any obstructions at the listener's ears.
Revised:  It can measure the noise accurately for active noise cancellation (ANC ) without any obstructions at the listener's ears.
Edit intent: clarity
Original:  It can determine the noise accurately for active noise cancellation (ANC ) without any obstructions at the listener's ears.
Revised:  It can determine the noise accurately for ANC without any obstructions at the listener's ears.
Edit intent: clarity
Original:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise  up to 6000 Hz  inside the ears in a complicated sound field.
Revised:  The demonstrated system, or virtual ANC headphone as we call it, is shown to provide more than 10 dB attenuation for the ultra-broadband noise up to 6000 Hz inside the ears in a complicated sound field.
Edit intent: clarity
Original:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise  up to 6000 Hz  inside the ears in a complicated sound field.
Revised:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for ultra-broadband noise up to 6000 Hz inside the ears in a complicated sound field.
Edit intent: fluency
Original:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise  up to 6000 Hz  inside the ears in a complicated sound field.
Revised:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise - up to 6000 Hz inside the ears in a complicated sound field.
Edit intent: fluency
Original:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise  up to 6000 Hz  inside the ears in a complicated sound field.
Revised:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise up to 6000 Hz - inside the ears in a complicated sound field.
Edit intent: fluency
Original:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise  up to 6000 Hz  inside the ears in a complicated sound field.
Revised:  The demonstrated system, or virtual ANC headphone as we call it, can provide more than 10 dB attenuation for the ultra-broadband noise up to 6000 Hz inside the ears in a complex sound field.
Edit intent: fluency
Original:  It has the potential to lead the next generation of personal hearing protection systems and open a whole new area of noise control research.
Revised:  It has the potential to lead the next generation of personal hearing protection system and can open up a whole new area of noise control research.
Edit intent: clarity
Original:  It has the potential to lead the next generation of personal hearing protection systems and open a whole new area of noise control research.
Revised:  It has the potential to lead the next generation of personal hearing protection systems and open a whole new area of sound control research.
Edit intent: clarity
Original: In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time.
Revised:  Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time.
Edit intent: clarity
Original:  Line graphs of bipartite graphs are perfect graphs, and are known to be precisely the class of (claw, \,diamond, \, odd hole)-free graphs.
Revised:  Line graphs of bipartite graphs are perfect graphs, and are known to be precisely the class of (claw, diamond, odd hole)-free graphs.
Edit intent: fluency
Original:  We first show that it extends to (claw, \, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, \, odd hole)-free graphs.
Revised:  We first show that it extends to (claw, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, \, odd hole)-free graphs.
Edit intent: fluency
Original:  We first show that it extends to (claw, \, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, \, odd hole)-free graphs.
Revised:  We first show that it extends to (claw, \, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, odd hole)-free graphs.
Edit intent: fluency
Original:  Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chv\'atal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milani\v{c (2008).
Revised:  Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chvatal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milani\v{c (2008).
Edit intent: fluency
Original:  Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chv\'atal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milani\v{c (2008).
Revised:  Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chv\'atal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milanic (2008).
Edit intent: fluency
Original:  Two popular approaches for this problem include matrix factorization andrandom walk -based models.
Revised:  Two popular approaches for this problem include andrandom walk -based models.
Edit intent: clarity
Original:  Two popular approaches for this problem include matrix factorization andrandom walk -based models.
Revised:  Two popular approaches for this problem include matrix factorization random walk -based models.
Edit intent: fluency
Original:  Two popular approaches for this problem include matrix factorization andrandom walk -based models.
Revised:  Two popular approaches for this problem include matrix factorization and -based models.
Edit intent: clarity
Original:  Two popular approaches for this problem include matrix factorization andrandom walk -based models.
Revised:  Two popular approaches for this problem include matrix factorization andrandom walk matrix factorization and random walk-based models.
Edit intent: clarity
Original:  That is, we assume that, since the initial time, the information flow is altered by adding the knowledge of an additional random variable including future information.
Revised:  That is, we. We assume that, since the initial time, the information flow is altered by adding the knowledge of an additional random variable including future information.
Edit intent: clarity
Original: The time-ordered exponential is defined as the function that solves any system of coupled first order linear differential equations with constant or non-constant coefficients.
Revised: The time-ordered exponential is defined as the function that solves a system of coupled first order linear differential equations with constant or non-constant coefficients.
Edit intent: clarity
Original: The time-ordered exponential is defined as the function that solves any system of coupled first order linear differential equations with constant or non-constant coefficients.
Revised: The time-ordered exponential is defined as the function that solves any system of coupled first-order linear differential equations with constant or non-constant coefficients.
Edit intent: fluency
Original: The time-ordered exponential is defined as the function that solves any system of coupled first order linear differential equations with constant or non-constant coefficients.
Revised: The time-ordered exponential is defined as the function that solves any system of coupled first order linear differential equations with generally non-constant coefficients.
Edit intent: clarity
Original:  In spite of it being at the heart of much system dynamics, control theory  and model reduction problems, the time-ordered exponential function remains elusively difficult to evaluate.
Revised:  In spite of being at the heart of much system dynamics, control theory and model reduction problems, the time-ordered exponential function remains elusively difficult to evaluate.
Edit intent: fluency
Original:  In spite of it being at the heart of much system dynamics, control theory  and model reduction problems, the time-ordered exponential function remains elusively difficult to evaluate.
Revised:  In spite of it being at the heart of much system dynamics, control theory , and model reduction problems, the time-ordered exponential function remains elusively difficult to evaluate.
Edit intent: fluency
Original:  Nevertheless, a natural strategy for its numerical implementation is also outlined and will form the basis of a future work .
Revised:  Nevertheless, a strategy for its numerical implementation is also outlined and will form the basis of a future work .
Edit intent: clarity
Original:  Nevertheless, a natural strategy for its numerical implementation is also outlined and will form the basis of a future work .
Revised:  Nevertheless, a natural strategy for its numerical implementation is also outlined and will be subject of future investigation .
Edit intent: clarity
Original:  Nevertheless, a strategy for its numerical implementation is also outlined and will be subject of future investigation.
Revised:  A strategy for its numerical implementation is also outlined and will be subject of future investigation.
Edit intent: coherence
Original:  This dataset is  challenging because commonly used neural architectures for  QA are prohibitively expensive for a task of this scale.
Revised:  This dataset is especially challenging because commonly used neural architectures for QA are prohibitively expensive for a task of this scale.
Edit intent: coherence
Original:  This dataset is  challenging because commonly used neural architectures for  QA are prohibitively expensive for a task of this scale.
Revised:  This dataset is challenging because commonly used neural architectures for reasoning and QA are prohibitively expensive for a task of this scale.
Edit intent: clarity
Original:  It then uses a scalable neural information retrieval (IR) module to subselect a set of potential entities from the large candidate set.
Revised:  It then uses a scalable neural information retrieval (IR) module to select a set of potential entities from the large candidate set.
Edit intent: clarity
Original: In a recent publication, explicit constants have been provided in a priori error estimates for approximation with spline spaces of maximal smoothness defined on arbitrary grids.
Revised: In this paper we provide a priori error estimates for approximation with spline spaces of maximal smoothness defined on arbitrary grids.
Edit intent: clarity
Original: In a recent publication, explicit constants have been provided in a priori error estimates for approximation with spline spaces of maximal smoothness defined on arbitrary grids.
Revised: In a recent publication, explicit constants have been provided in a priori error estimates for approximation with spline spaces of arbitrary smoothness defined on arbitrary grids.
Edit intent: clarity
Original:  In this paper, we consider the general case of approximation with spline spaces of arbitrary smoothnessdefined on arbitrary grids, and provide explicit constants in a priori error estimates for both the L^2-projection and the Ritz projection .
Revised:  This extends and completes the results recently obtained for spline spaces of arbitrary smoothnessdefined on arbitrary grids, and provide explicit constants in a priori error estimates for both the L^2-projection and the Ritz projection .
Edit intent: clarity
Original:  This extends and completes the results recently obtained for spline spaces of maximal smoothness.
Revised:  This extends the results recently obtained for spline spaces of maximal smoothness.
Edit intent: clarity
Original: Nonzero-sum stochastic differential games with impulse controls offer a realistic and far-reaching modelling framework for applications within finance, energy markets  and other areas, but the difficulty in solving such problems has hindered their proliferation.
Revised: Nonzero-sum stochastic differential games with impulse controls offer a realistic and far-reaching modelling framework for applications within finance, energy markets , and other areas, but the difficulty in solving such problems has hindered their proliferation.
Edit intent: fluency
Original:  Semi-analytical approaches make strong assumptions pertaining  very particular cases.
Revised:  Semi-analytical approaches make strong assumptions pertaining to very particular cases.
Edit intent: fluency
Original:  Focusing on symmetric games, this paper presents a simpler and more efficient fixed-point policy-iteration-type algorithm which removes the strong dependence on the initial guess and the relaxation scheme of the previous method.
Revised:  Focusing on symmetric games, this paper presents a simpler , more precise and efficient fixed-point policy-iteration-type algorithm which removes the strong dependence on the initial guess and the relaxation scheme of the previous method.
Edit intent: clarity
Original:  A  provably convergent single-player impulse control solver , often outperforming classical policy iteration, is also provided.
Revised:  A novel provably convergent single-player impulse control solver , often outperforming classical policy iteration, is also provided.
Edit intent: clarity
Original:  A  provably convergent single-player impulse control solver , often outperforming classical policy iteration, is also provided.
Revised:  A provably convergent single-player impulse control solver is also provided.
Edit intent: clarity
Original:  The main algorithm is used to compute with high precision equilibrium payoffs and Nash equilibria of otherwise too challenging problems, and even some for which results go beyond the scope of all the currently available theory.
Revised:  The main algorithm is used to compute with high precision equilibrium payoffs and Nash equilibria of otherwise too challenging problems, and even some which go beyond the scope of all the currently available theory.
Edit intent: clarity
Original:  The main algorithm is used to compute with high precision equilibrium payoffs and Nash equilibria of otherwise too challenging problems, and even some for which results go beyond the scope of all the currently available theory.
Revised:  The main algorithm is used to compute with high precision equilibrium payoffs and Nash equilibria of otherwise too challenging problems, and even some for which results go beyond the scope of the currently available theory.
Edit intent: clarity
Original: Reverberation time (T60) and the direct-to-reverberant ratio (DRR) are two commonly used parameters to characterize acoustic environments.
Revised: The reverberation time (T60) and the direct-to-reverberant ratio (DRR) are two commonly used parameters to characterize acoustic environments.
Edit intent: fluency
Original:  Both parameters are useful for various speech processing applications and can be measured from an acoustic impulse response (AIR) . In many scenarios, however, AIRs are not available, motivating blind estimation methods that operate directly from recorded speech.
Revised:  Both parameters can be measured from an acoustic impulse response (AIR) . In many scenarios, however, AIRs are not available, motivating blind estimation methods that operate directly from recorded speech.
Edit intent: clarity
Original:  Both parameters are useful for various speech processing applications and can be measured from an acoustic impulse response (AIR) . In many scenarios, however, AIRs are not available, motivating blind estimation methods that operate directly from recorded speech.
Revised:  Both parameters are useful for various speech processing applications and can be measured from an acoustic impulse response (AIR) or using blind estimation methods that operate directly from recorded speech.
Edit intent: coherence
Original:  Such methods , however, require large , balanced amounts of realistic training data (i.e. AIRs) , which is expensive and time consuming to collect.
Revised:  Such methods , however, a large realistic dataset is needed , which is expensive and time consuming to collect.
Edit intent: clarity
Original:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Revised:  To address this , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Edit intent: coherence
Original:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Revised:  To address this problem , we propose an AIR augmentation method that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Edit intent: clarity
Original:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Revised:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Edit intent: clarity
Original:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a large balanced dataset that is orders of magnitude larger.
Revised:  To address this problem , we propose an AIR augmentation procedure that can parametrically control the T60 and DRR of real AIRs , allowing us to expand a small dataset of real AIRs into a balanced dataset orders of magnitude larger.
Edit intent: clarity
Original:  To show the validity of the method, we train a baseline convolutional neural network to predict both T60 and DDR from speech convolved with our augmented AIRs.
Revised:  Using this method, we train a baseline convolutional neural network to predict both T60 and DDR from speech convolved with our augmented AIRs.
Edit intent: clarity
Original:  Results suggest our baseline estimators outperform past single- and multi-channel state-of-the-art T60 and DRR algorithms in terms of the Pearson correlation coefficient and bias, and are either better or comparable in terms of MSE .
Revised:  Results suggest our baseline estimators outperform past single- and multi-channel state-of-the-art T60 and DRR algorithms in terms of the Pearson correlation coefficient and bias, and are either better or comparable to all previously reported single- and multi-channel state-of-the-art methods .
Edit intent: clarity
Original:  Stated in the language of binary relational structures in this paper [ 13 ], Lov\'asz proved a fundamental theorem that  the graph homomorphism function G \mapsto \hom(G, H) for 0-1 valued H (as the adjacency matrix of a graph) determines the isomorphism type of H. In the past 50 years various extensions have been proved by Lov\'asz and others [ 14, 9 , 1, 18, 16 ].
Revised:  Stated in the language of binary relational structures in that paper [ 13 ], Lov\'asz proved a fundamental theorem that the graph homomorphism function G \mapsto \hom(G, H) for 0-1 valued H (as the adjacency matrix of a graph) determines the isomorphism type of H. In the past 50 years various extensions have been proved by Lov\'asz and others [ 14, 9 , 1, 18, 16 ].
Edit intent: clarity
Original:  Stated in the language of binary relational structures in this paper [ 13 ], Lov\'asz proved a fundamental theorem that  the graph homomorphism function G \mapsto \hom(G, H) for 0-1 valued H (as the adjacency matrix of a graph) determines the isomorphism type of H. In the past 50 years various extensions have been proved by Lov\'asz and others [ 14, 9 , 1, 18, 16 ].
Revised:  Stated in the language of binary relational structures in this paper [ 13 ], Lov\'asz proved a fundamental theorem that the graph homomorphism function G \mapsto \hom(G, H) determines the isomorphism type of H. In the past 50 years various extensions have been proved by Lov\'asz and others [ 14, 9 , 1, 18, 16 ].
Edit intent: coherence