wanyu/IteraTeR_v2 huggingface dataset:
Original:  Moreover, 97.96\% of books have been cited fewer than 10 times.
Revised:  Moreover, 97.96\% of books have been cited fewer than ten times.
Edit intent: fluency
Original: Classical planning frameworks are built on first-order languages.
Revised: Many classical planning frameworks are built on first-order languages.
Edit intent: clarity
Original:  The first-order expressive power is desirable for compactly representing actions via schemas, and for specifying goal formulas such as \neg\exists xblocks\_door(x).
Revised:  The first-order expressive power is desirable for compactly representing actions via schemas, and for specifying quantified conditions such as \neg\exists xblocks\_door(x).
Edit intent: clarity
Original:  In contrast, several recent epistemic planning frameworks build on propositional modal logic.
Revised:  In contrast, several recent epistemic planning frameworks are built on propositional epistemic logic.
Edit intent: clarity
Original:  The modal expressive power is desirable for investigating planning problems with epistemic goals such as K_{a}\negproblem.
Revised:  The epistemic language is useful to describe planning problems involving higher-order reasoning or epistemic goals such as K_{a}\negproblem.
Edit intent: clarity
Original:  The present paper presents an epistemic planning framework with first-order expressiveness of classical planning, but extending fully to the epistemic operators .
Revised:  This paper develops a first-order expressiveness of classical planning, but extending fully to the epistemic operators .
Edit intent: clarity
Original:  In this framework, e.g. \exists xK_{x}\exists yblocks\_door(y) is a formula.
Revised:  In this framework, for example, \exists xK_{x}\exists yblocks\_door(y) is a formula.
Edit intent: clarity
Original:  Our result strengthens previous result of Lokshtanov [arXiv, 2015] that Optimal Linear Arrangement is in FPT when parameterized by the vertex cover size, and we use a similar approach of reducing the problem to a tractable instance of Integer Quadratic Programming as in Lokshtanov's paper.
Revised:  Our result can be viewed as a strengthening of a previous result of Lokshtanov [arXiv, 2015] that Optimal Linear Arrangement is in FPT when parameterized by the vertex cover size, and we use a similar approach of reducing the problem to a tractable instance of Integer Quadratic Programming as in Lokshtanov's paper.
Edit intent: clarity
Original:  When the conditions are met, i.e.  when the graphs are connected , with distinct edges, and have at least three edges, we give an efficient algorithm for learning the weights of both graphs with almost optimal sample complexity (up to log factors).
Revised:  When the conditions are met, i.e. , when the graphs are connected , with distinct edges, and have at least three edges, we give an efficient algorithm for learning the weights of both graphs with almost optimal sample complexity (up to log factors).
Edit intent: fluency
Original:  When the conditions are met, i.e.  when the graphs are connected , with distinct edges, and have at least three edges, we give an efficient algorithm for learning the weights of both graphs with almost optimal sample complexity (up to log factors).
Revised:  When the conditions are met, i.e. when the graphs are connected with at least three edges, we give an efficient algorithm for learning the weights of both graphs with almost optimal sample complexity (up to log factors).
Edit intent: coherence
Original:  When the conditions are met, i.e.  when the graphs are connected , with distinct edges, and have at least three edges, we give an efficient algorithm for learning the weights of both graphs with almost optimal sample complexity (up to log factors).
Revised:  When the conditions are met, i.e. when the graphs are connected , with distinct edges, and have at least three edges, we give an efficient algorithm for learning the weights of both graphs with optimal sample complexity (up to log factors).
Edit intent: clarity
Original:  In particular, we obtain the following four classical Gray codes as special cases: the Steinhaus-Johnson-Trotter algorithm to generate all permutations of an n-element set by adjacent transpositions;
Revised:  In particular, we obtain four classical Gray codes as special cases: the Steinhaus-Johnson-Trotter algorithm to generate all permutations of an n-element set by adjacent transpositions;
Edit intent: clarity
Original:  The first main application of our framework are permutation patterns , yielding new Gray codes for different pattern-avoiding permutations , such as vexillary, skew-merged, separable, Baxter and twisted Baxter permutations, 2-stack sortable permutations, geometric grid classes, and many others.
Revised:  The first main application is the generation of pattern-avoiding permutations , yielding new Gray codes for different pattern-avoiding permutations , such as vexillary, skew-merged, separable, Baxter and twisted Baxter permutations, 2-stack sortable permutations, geometric grid classes, and many others.
Edit intent: clarity
Original:  We also obtain new Gray codes for many combinatorial objects that are in bijection to these permutations, in particular for five different types of geometric rectangulations, also known as floorplans, which are divisions of a square into n rectangles subject to certain restrictions.
Revised:  We also obtain new Gray codes for all the combinatorial objects that are in bijection to these permutations, in particular for five different types of geometric rectangulations, also known as floorplans, which are divisions of a square into n rectangles subject to certain restrictions.
Edit intent: clarity
Original: An improvement of membrane behaviour of the four-node shell element with 24 degrees of freedom DKMQ24 proposed by Katili et .al (2015) is presented.
Revised: An approach to improve the membrane behaviour of the four-node shell element with 24 degrees of freedom DKMQ24 proposed by Katili et .al (2015) is presented.
Edit intent: clarity
Original: An improvement of membrane behaviour of the four-node shell element with 24 degrees of freedom DKMQ24 proposed by Katili et .al (2015) is presented.
Revised: An improvement of membrane behaviour of the four-node shell element with 24 degrees of freedom DKMQ24 proposed by Katili et al. (2015) is presented.
Edit intent: fluency
Original:  This improvement is based on the different approximation of drilling rotations  based on Allman's shape functions.
Revised:  This improvement is based on a different approximation of drilling rotations based on Allman's shape functions.
Edit intent: fluency
Original:  This improvement is based on the different approximation of drilling rotations  based on Allman's shape functions.
Revised:  This improvement is based on the different approximation of drilling rotations , based on Allman's shape functions.
Edit intent: fluency
Original:  The element is free of shear and membrane locking and exhibits lower numerical error for the membrane and the membrane-dominated problems.
Revised:  The element is free of shear and membrane locking and shows lower numerical errors for membrane and membrane-dominated problems.
Edit intent: clarity
Original: Software is essential for a lot of research, but it is not featured in citation graphs which have the potential to assign credit for software contributions.
Revised: Following the widespread digitalization of scholarship, software has become essential for research, but it is not featured in citation graphs which have the potential to assign credit for software contributions.
Edit intent: clarity
Original:  I also give an outlook on future work to implement transitive credit, which is at the core of a fair system of academic citation which accounts for software on par with other research products .
Revised:  I also give an outlook of useful applications of research citation graphs, including transitive credit .
Edit intent: clarity
Original: Musical scales are used in cultures throughout the world, but the question as to how they evolved remains open.
Revised: Musical scales are used throughout the world, but the question as to how they evolved remains open.
Edit intent: clarity
Original: Musical scales are used in cultures throughout the world, but the question as to how they evolved remains open.
Revised: Musical scales are used in cultures throughout the world, but the question of how they evolved remains open.
Edit intent: coherence
Original:  Some suggest that scales based on the harmonic series are inherently pleasant, while others propose that scales are chosen that are easy to sing, hear and reproduce accurately .
Revised:  Some suggest that scales based on the harmonic series are inherently pleasant, while others propose that scales are chosen that are easy to communicate .
Edit intent: clarity
Original:  Here, to enable such examination, we assimilate data from diverse ethnomusicological sources into a cross-cultural database of scales.
Revised:  Here, we assimilate data from diverse ethnomusicological sources into a cross-cultural database of scales.
Edit intent: clarity
Original:  We generate populations of scales based on proposed and alternative theories and assess their similarity to empirical distributions from the database.
Revised:  We generate populations of scales based on multiple theories and assess their similarity to empirical distributions from the database.
Edit intent: clarity
Original:  Most scales can be explained as tending to include intervals roughly corresponding to perfect fifths ( "imperfect fifths" ), and packing arguments explain the salient features of the distributions.
Revised:  Most scales tend to include intervals roughly corresponding to perfect fifths ( "imperfect fifths" ), and packing arguments explain the salient features of the distributions.
Edit intent: clarity
Original:  Most scales can be explained as tending to include intervals roughly corresponding to perfect fifths ( "imperfect fifths" ), and packing arguments explain the salient features of the distributions.
Revised:  Most scales can be explained as tending to include intervals which are close in size to perfect fifths ( "imperfect fifths" ), and packing arguments explain the salient features of the distributions.
Edit intent: clarity
Original:  Most scales can be explained as tending to include intervals roughly corresponding to perfect fifths ( "imperfect fifths" ), and packing arguments explain the salient features of the distributions.
Revised:  Most scales can be explained as tending to include intervals roughly corresponding to perfect fifths ( ``imperfect fifths'' ), and packing arguments explain the salient features of the distributions.
Edit intent: fluency
Original:  Scales are also preferred if their intervals are compressible, which could facilitate efficient communication and memory of melodies.
Revised:  Scales are also preferred if their intervals are compressible, which may facilitate efficient communication and memory of melodies.
Edit intent: fluency
Original:  While no single theory can explain all scales , which appear to evolve according to different selection pressures, the simplest harmonicity-based, imperfect-fifths packing model best fits the empirical data.
Revised:  While scales appear to evolve according to different selection pressures, the simplest harmonicity-based, imperfect-fifths packing model best fits the empirical data.
Edit intent: clarity
Original:  While no single theory can explain all scales , which appear to evolve according to different selection pressures, the simplest harmonicity-based, imperfect-fifths packing model best fits the empirical data.
Revised:  While no single theory can explain all scales , which appear to evolve according to different selection pressures, the simplest h imperfect-fifths packing model best fits the empirical data.
Edit intent: clarity
Original:  In this paper we propose to fit topics directly to the co-occurances data of the corpus.
Revised:  In this approach, topics are learned directly from the co-occurrence data of the corpus.
Edit intent: clarity
Original:  In particular, we introduce an extension of a mixture model, the Full Dependence Mixture (FDM), which arises naturally as a model of a second moment under general generative assumptions on the data.
Revised:  In particular, we introduce a novel mixture model, the Full Dependence Mixture (FDM), which arises naturally as a model of a second moment under general generative assumptions on the data.
Edit intent: clarity
Original:  While there is some previous work on topic modeling using second moments, we develop a direct stochastic optimization procedure for fitting an FDM with a single Kullback Leibler objective.
Revised:  While there is previous work on topic modeling using second moments, we develop a direct stochastic optimization procedure for fitting an FDM with a single Kullback Leibler objective.
Edit intent: coherence
Original:  While moment methods in general have the benefit that an iteration no longer needs to scale with the size of the corpus  , our approach also allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Revised:  Moment methods in general have the benefit that an iteration no longer needs to scale with the size of the corpus , our approach also allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Edit intent: coherence
Original:  While moment methods in general have the benefit that an iteration no longer needs to scale with the size of the corpus  , our approach also allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Revised:  While moment methods in general have the benefit that an iteration no longer needs to scale with the size of the corpus . However , our approach also allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Edit intent: coherence
Original:  We evaluate the approach on synthetic and semi-synthetic data, as well as on the SOTU and Neurips Papers corpora, and show that the approach outperforms LDA, where LDA is run on both full and sub-sampled data .
Revised:  In particular, we evaluate the approach on synthetic and semi-synthetic data, as well as on the SOTU and Neurips Papers corpora, and show that the approach outperforms LDA, where LDA is run on both full and sub-sampled data .
Edit intent: coherence
Original:  We evaluate the approach on synthetic and semi-synthetic data, as well as on the SOTU and Neurips Papers corpora, and show that the approach outperforms LDA, where LDA is run on both full and sub-sampled data .
Revised:  We evaluate the approach on synthetic and semi-synthetic data, as well as on the SOTU and Neurips Papers corpora, and show that the approach significantly outperforms the standard benchmarks .
Edit intent: clarity
Original: In this paper we introduce a new approach to topic modelling that scales to large datasets by using a compact representation of the data and by leveraging GPUs . In this approach, topics are learned directly from the co-occurrence data of the corpus.
Revised: In this paper we introduce a new approach to topic modelling that scales to large datasets by using a compact representation of the data and by leveraging the GPU architecture . In this approach, topics are learned directly from the co-occurrence data of the corpus.
Edit intent: clarity
Original:  In particular, we introduce a novel mixture model , the Full Dependence Mixture (FDM) , which arises naturally as a modelof a second moment under general generative assumptions on the data.
Revised:  In particular, we introduce a novel mixture model which we term the Full Dependence Mixture (FDM) , which arises naturally as a modelof a second moment under general generative assumptions on the data.
Edit intent: clarity
Original:  In particular, we introduce a novel mixture model , the Full Dependence Mixture (FDM) , which arises naturally as a modelof a second moment under general generative assumptions on the data.
Revised:  In particular, we introduce a novel mixture model , the Full Dependence Mixture (FDM) model. FDMs model second moment under general generative assumptions on the data.
Edit intent: coherence
Original:  However, our approach also allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Revised:  Our approach allows us to leverage standard optimizers and GPUs for the problem of topic modeling.
Edit intent: clarity
Original:  In particular, we evaluate the approach on two large datasets, NeurIPS papers and a Twitter corpus, with a large number of topics, and show that the approach significantly outperforms the standard benchmarks.
Revised:  In particular, we evaluate the approach on two large datasets, NeurIPS papers and a Twitter corpus, with a large number of topics, and show that the approach performs comparably or better than the the standard benchmarks.
Edit intent: clarity
Original:  However, most of  current transport protocols do not match the requirements of video streaming applications or are not designed to address relevant issues, such as delay constraints, networks heterogeneity, and head-of-line blocking issues.
Revised:  However, most of the current transport protocols do not match the requirements of video streaming applications or are not designed to address relevant issues, such as delay constraints, networks heterogeneity, and head-of-line blocking issues.
Edit intent: fluency
Original:  This article provides a holistic survey of multipath wireless video streaming, shedding light on the different alternatives from an end-to-end layered stack perspective, unveiling trade-offs of each approach  and presenting a suitable taxonomy to classify the state-of-the-art.
Revised:  This survey provides a holistic survey of multipath wireless video streaming, shedding light on the different alternatives from an end-to-end layered stack perspective, unveiling trade-offs of each approach and presenting a suitable taxonomy to classify the state-of-the-art.
Edit intent: clarity
Original:  This article provides a holistic survey of multipath wireless video streaming, shedding light on the different alternatives from an end-to-end layered stack perspective, unveiling trade-offs of each approach  and presenting a suitable taxonomy to classify the state-of-the-art.
Revised:  This article provides a holistic survey of multipath wireless video streaming, shedding light on the different alternatives from an end-to-end layered stack perspective, unveiling trade-offs of each approach , and presenting a suitable taxonomy to classify the state-of-the-art.
Edit intent: fluency
Original:  It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either a vertex, an edge or a triangle, the neighborhood of which has an odd hole as its boundary  .
Revised:  It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either a vertex, an edge or a triangle, the neighbourhood of which has an odd hole as its boundary .
Edit intent: fluency
Original: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { { {  the optimal basis.
Revised: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I { { { the optimal basis.
Edit intent: coherence
Original: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { { {  the optimal basis.
Revised: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) {\mathcal O { { the optimal basis.
Edit intent: fluency
Original: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { { {  the optimal basis.
Revised: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { {\mathcal I { the optimal basis.
Edit intent: fluency
Original: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { { {  the optimal basis.
Revised: Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system \mathcal I given that for sets from \mathcal O\subseteq \mathcal I we care in particular about the qualitiy of approximation as we assume, that \mathcal O contains (frequently) { { {\mathcal O the optimal basis.
Edit intent: fluency
Original:  It is based on finding an `inner matroid', one contained in the independence system.
Revised:  The heuristic is based on finding an `inner matroid', one contained in the independence system.
Edit intent: clarity
Original:  We show that without additional assumptions on \mathcal Obeing different from \mathcal I } }  the worst-case performance of this new heuristic is no better than that of the classical greedy algorithm.
Revised:  We show that without additional assumptions on \mathcal Obeing different from \mathcal I } } the worst-case performance of this new heuristic can be better than that of the classical greedy algorithm.
Edit intent: clarity
Original: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically,  two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Revised: This work proposes an extension of phase change and latent heat models for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically, two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Edit intent: clarity
Original: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on macroscale with a focus on phase change and latent heat effects . Specifically,  two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Revised: This work proposes a thermal finite element model for the simulation of metal powder bed fusion additive manufacturing processes on the macroscale and compares different models with respect to accuracy and numerical efficiency . Specifically, two well-known existing schemes for the numerical treatment of phase change and latent heat, namely the apparent capacity and the so-called heat integration scheme, are critically reviewed and compared with respect to numerical efficiency and overall accuracy.
Edit intent: clarity