wanyu/IteraTeR_v2 huggingface dataset:
Original: Query expansion (QE) is a well known technique to enhance the effectiveness of information retrieval (IR) . QE reformulates the initial query by adding similar terms that helps in retrieving more relevant results.
Revised: Query expansion (QE) is a well known technique to enhance the effectiveness of information retrieval (IR) . QE reformulates the initial query by adding similar terms that help in retrieving more relevant results.
Edit intent: fluency
Original:  One of the main reasons for this is the use of the same data source while expanding both the individual and the phrase query terms.
Revised:  One of the main reasons for this is the use of the same kind of data sources and weighting scheme while expanding both the individual and the phrase query terms.
Edit intent: clarity
Original:  We have also proposed novel schemes for weighting expanded terms: inlink score (for terms extracted from Wikipedia) and a tfidf based scheme (for terms extracted from WordNet).
Revised:  We have also proposed novel weighting schemes for expansion terms: in-link score (for terms extracted from Wikipedia) and a tfidf based scheme (for terms extracted from WordNet).
Edit intent: fluency
Original:  We have also proposed novel schemes for weighting expanded terms: inlink score (for terms extracted from Wikipedia) and a tfidf based scheme (for terms extracted from WordNet).
Revised:  We have also proposed novel schemes for weighting expanded terms: inlink score (for terms extracted from Wikipedia) and a tf-idf based scheme (for terms extracted from WordNet).
Edit intent: fluency
Original:  In the proposed Wikipedia WordNet based QE technique (WWQE), we weigh the expansion terms twice: first, they are scored by the weighting scheme individually, and then, the weighting scheme scores the selected expansion terms in relation to the entire query using correlation score.
Revised:  In the proposed Wikipedia-WordNet-based QE technique (WWQE), we weigh the expansion terms twice: first, they are scored by the weighting scheme individually, and then, the weighting scheme scores the selected expansion terms in relation to the entire query using correlation score.
Edit intent: fluency
Original:  In the proposed Wikipedia WordNet based QE technique (WWQE), we weigh the expansion terms twice: first, they are scored by the weighting scheme individually, and then, the weighting scheme scores the selected expansion terms in relation to the entire query using correlation score.
Revised:  In the proposed Wikipedia WordNet based QE technique (WWQE), we weigh the expansion terms twice: first, they are scored by the weighting scheme individually, and then, the weighting scheme scores the selected expansion terms concerning the entire query using correlation score.
Edit intent: clarity
Original:  Moreover, the line search that guarantees the convergence of the inexact procedure to a stabilizing solution turns out to be exact in our setting  .
Revised:  Moreover, the line search turns out to be exact in our setting .
Edit intent: clarity
Original:  Applying our method to a set of 93 time-series classification datasets (containing over 147\,000 time series) and using a filtered version of the hctsa feature library (4791 features), we introduce a generically useful set of 22 CAnonical Time-series CHaracteristics, catch22.
Revised:  Applying our method to a set of 93 time-series classification datasets (containing over 147000 time series) and using a filtered version of the hctsa feature library (4791 features), we introduce a generically useful set of 22 CAnonical Time-series CHaracteristics, catch22.
Edit intent: fluency
Original: We describe techniques for training high-quality image denoising models that require only single instances of corrupted images as training data.
Revised: We describe a novel method for training high-quality image denoising models that require only single instances of corrupted images as training data.
Edit intent: clarity
Original: We describe techniques for training high-quality image denoising models that require only single instances of corrupted images as training data.
Revised: We describe techniques for training high-quality image denoising models based on unorganized collections of corrupted images as training data.
Edit intent: clarity
Original:  Inspired by a recent technique that removes the need for supervision through image pairs by employing networks with a "blind spot" in the receptive field, we address two of its shortcomings: inefficient training and somewhat disappointing final denoising performance.
Revised:  Inspired by a recent technique that removes the need for reference data by employing networks with a "blind spot" in the receptive field, we address two of its shortcomings: inefficient training and somewhat disappointing final denoising performance.
Edit intent: clarity
Original:  Furthermore, based on the Bartels' work SIAM J. Numer.
Revised:  Furthermore, SIAM J. Numer.
Edit intent: coherence
Original:  Anal. (2012)%DIFDELCMD < ]%%% , we have proposed an algorithm to stably solve the minimization problem.
Revised:  Anal. (2012)%DIFDELCMD < ]%%% we have proposed an algorithm to stably solve the minimization problem.
Edit intent: fluency
Original:  We prove the iteration sequence generated by the derived algorithm conversing to a minimizer of the regularization problem, and a convergence measurement is also established.
Revised:  We prove the iterate sequence generated by the derived algorithm conversing to a minimizer of the regularization problem, and a convergence measurement is also established.
Edit intent: fluency
Original:  We prove the iteration sequence generated by the derived algorithm conversing to a minimizer of the regularization problem, and a convergence measurement is also established.
Revised:  We prove the iteration sequence generated by the derived algorithm converging to a minimizer of the regularization problem, and a convergence measurement is also established.
Edit intent: fluency
Original:  We prove the iteration sequence generated by the derived algorithm conversing to a minimizer of the regularization problem, and a convergence measurement is also established.
Revised:  We prove the iteration sequence generated by the derived algorithm conversing to a minimizer of the regularization problem, and that convergence measurement is also established.
Edit intent: coherence
Original: This paper considers the  general nonlinear stochastic fractional integro--differential equations with weakly singular kernels under the local Lipschitz condition.
Revised: This paper considers the general nonlinear stochastic fractional integro-differential equations with weakly singular kernels under the local Lipschitz condition.
Edit intent: fluency
Original:  First of all, the existence, uniqueness and stability results of the problem under studying are derived in detail.
Revised:  First of all, the existence, uniqueness and stability results of the problems under studying are derived in detail.
Edit intent: fluency
Original:  Second, the modified Euler--Maruyama approximation is presented for solving numerically the equation, and then its strong convergence is proven.
Revised:  Second, the modified Euler-Maruyama approximation is presented for solving numerically the equation, and then its strong convergence is proven.
Edit intent: fluency
Original:  Finally, several numerical tests are reported for verification of our theoretical results .
Revised:  Finally, several numerical tests are reported for verification of the theoretical findings .
Edit intent: clarity
Original: This paper considers the initial value problems of general nonlinear stochastic fractional integro-differential equations with weakly singular kernels under the local Lipschitz condition.
Revised: This paper considers the initial value problem of general nonlinear stochastic fractional integro-differential equations with weakly singular kernels under the local Lipschitz condition.
Edit intent: fluency
Original:  Second, the modified Euler-Maruyama approximation is presented for solving numerically the equation, and then its strong convergence is proven  . Moreover, we investigate the convergence rate of this method to show its computational efficiency.
Revised:  Secondly, the Euler--Maruyama method is developed for solving numerically the equation, and then its strong convergence is proven . Moreover, we investigate the convergence rate of this method to show its computational efficiency.
Edit intent: clarity
Original:  Second, the modified Euler-Maruyama approximation is presented for solving numerically the equation, and then its strong convergence is proven  . Moreover, we investigate the convergence rate of this method to show its computational efficiency.
Revised:  Second, the modified Euler-Maruyama approximation is presented for solving numerically the equation, and then its strong convergence is proven . Moreover, we obtain the accurate convergence rate of this method to show its computational efficiency.
Edit intent: clarity
Original:  The difficulty of obtaining an NC perfect matching algorithm has led researchers to study matching vis-a-vis clever relaxations of the class NC.
Revised:  The difficulty of obtaining an NC perfect matching algorithm led researchers to study matching vis-a-vis clever relaxations of the class NC.
Edit intent: fluency
Original:  In this vein, recently [GG15] gave a pseudo-deterministic RNC algorithm for finding a perfect matching in a bipartite graph, i.e., an RNC algorithm with the additional requirement that on the same graph, it should return the same unique perfect matching for almost all choices of random bits.
Revised:  In this vein, recently [GG15] gave a pseudo-deterministic RNC algorithm for finding a perfect matching in a bipartite graph, i.e., an RNC algorithm with the additional requirement that on the same graph, it should return the same (i.e., unique) perfect matching for almost all choices of random bits.
Edit intent: clarity
Original:  Our algorithm builds on [AV18], whose result used planarity of input graphs critically;
Revised:  Our algorithm builds on [AV18], whose result used planarity of the input graph critically;
Edit intent: fluency
Original:  The main challenge was to adapt these steps to general graphs by exploiting the leeway that  seeking a pseudo-deterministic RNC algorithm and not an NCalgorithm gives us .
Revised:  The main challenge was to adapt these steps to general graphs by exploiting the leeway that we are seeking a pseudo-deterministic RNC algorithm and not an NCalgorithm gives us .
Edit intent: coherence
Original:  The main challenge was to adapt these steps to general graphs by exploiting the leeway that  seeking a pseudo-deterministic RNC algorithm and not an NCalgorithm gives us .
Revised:  The main challenge was to adapt these steps to general graphs by exploiting the leeway that seeking a pseudo-deterministic RNC , rather than an NC, algorithm .
Edit intent: clarity
Original:  Our reduction and algorithm build on [AV18], whose result used planarity of the input graph critically;
Revised:  Our reduction and algorithm build on [AV18], which used planarity of the input graph critically;
Edit intent: clarity
Original:  Our result is built on the work of AV18%DIFDELCMD < ]%%% , which used planarity of the input graph critically;
Revised:  Our result is built on the work of %DIFDELCMD < ]%%% , which used planarity of the input graph critically;
Edit intent: clarity
Original:  All known efficient matching algorithms for general graphs follow one of two approaches: given by  [ Edmonds65 ] and  [ Lovasz79 ].
Revised:  All known efficient matching algorithms for general graphs follow one of two approaches: given by Edmonds [ Edmonds65 ] and [ Lovasz79 ].
Edit intent: fluency
Original:  All known efficient matching algorithms for general graphs follow one of two approaches: given by  [ Edmonds65 ] and  [ Lovasz79 ].
Revised:  All known efficient matching algorithms for general graphs follow one of two approaches: given by [ Edm65 ] and [ Lovasz79 ].
Edit intent: fluency
Original:  All known efficient matching algorithms for general graphs follow one of two approaches: given by  [ Edmonds65 ] and  [ Lovasz79 ].
Revised:  All known efficient matching algorithms for general graphs follow one of two approaches: given by [ Edmonds65 ] and [ Lov79 ].
Edit intent: fluency
Original:  Our oracle-based algorithm follows a new approach and uses many of  ideas discovered in the last five years.
Revised:  Our oracle-based algorithm follows a new approach and uses many of the ideas discovered in the last five years.
Edit intent: fluency
Original: Network sharing has become a key feature of various enablers of the next generation network, such as network slicing, network function virtualization , and fog computing architectures.
Revised: Network sharing has become a key feature of various enablers of the next generation network, such as network function virtualization and fog computing architectures.
Edit intent: clarity
Original:  To tackle these issues, we propose the DeNUM Mechanism and the DyDeNUM Mechanism, the first mechanisms for solving decomposable NUM Problems considering private utility and constraint information.
Revised:  To tackle these issues, we propose the Decomposable NUM (DeNUM) Mechanism and the DyDeNUM Mechanism, the first mechanisms for solving decomposable NUM Problems considering private utility and constraint information.
Edit intent: clarity
Original:  To tackle these issues, we propose the DeNUM Mechanism and the DyDeNUM Mechanism, the first mechanisms for solving decomposable NUM Problems considering private utility and constraint information.
Revised:  To tackle these issues, we propose the DeNUM Mechanism and the DyDeNUM Mechanism, the first mechanisms in the literature for solving NUM Problems considering private utility and constraint information.
Edit intent: clarity
Original:  We further establish the connection between the equilibrium structure and that of the primal-dual solution to a related optimization problem, based on which we prove the convergence of the DeNUM Algorithm to an equilibrium.
Revised:  We further establish the connection between the equilibrium structure and the primal-dual solution to a related optimization problem, based on which we prove the convergence of the DeNUM Algorithm to an equilibrium.
Edit intent: clarity
Original:  When the agents' influences to the network are not monitorable, we propose the DyDeNUM Mechanism that yields the network-utility maximizing solution at the cost of the balanced budget.
Revised:  When the agents' influences are not monitorable, we propose the DyDeNUM Mechanism that yields the network-utility maximizing solution at the cost of the balanced budget.
Edit intent: clarity
Original: We propose a new fast randomized algorithm for interpolative decomposition of matrices utilizing the CountSketchtechnique .
Revised: We propose a new fast randomized algorithm for interpolative decomposition of matrices which utilizes CountSketch .
Edit intent: clarity
Original:  We then extend our method to the recently proposed tensor interpolative decomposition problem .
Revised:  We then extend this approach to the tensor interpolative decomposition problem .
Edit intent: clarity
Original:  Numerical experiments on both synthetic and real sparse data demonstrate that our algorithms maintain the accuracy of competing methods, while running in less time, achieving at least an order of magnitude speed-up on large matrices and tensors.
Revised:  Numerical experiments on both synthetic and real data demonstrate that our algorithms maintain the accuracy of competing methods, while running in less time, achieving at least an order of magnitude speed-up on large matrices and tensors.
Edit intent: clarity
Original: A maximal repeat , or run, in a string, is a periodically maximal substring whose smallest period is at most half the length of the substring.
Revised: A maximal repetition , or run, in a string, is a periodically maximal substring whose smallest period is at most half the length of the substring.
Edit intent: fluency
Original: A maximal repetition, or run, in a string, is a periodically maximal substring whose smallest period is at most half the length of the substring.
Revised: A maximal repetition, or run, in a string, is a maximal periodic substring whose smallest period is at most half the length of the substring.
Edit intent: clarity
Original:  We further show an O(n \sqrt{\log n\log ^2} \log  n) time and O(n) space algorithm for finding both endpoints of all runs.
Revised:  We further show an O(n \sqrt{\log n\log ^2} \log \log n) time and O(n) space algorithm for finding both endpoints of all runs.
Edit intent: fluency
Original:  We further show an O(n \sqrt{\log n\log ^2} \log  n) time and O(n) space algorithm for finding both endpoints of all runs.
Revised:  We further show an O(n \sqrt{\log n\log ^2} \log n) time and O(n) space algorithm for finding all runs.
Edit intent: clarity
Original:  Ixy focuses on the bare essentials of user space packet processing: a packet forwarder including the whole NIC driver uses less than 1000 lines of C code.
Revised:  ixy focuses on the bare essentials of user space packet processing: a packet forwarder including the whole NIC driver uses less than 1000 lines of C code.
Edit intent: fluency
Original:  Ixy focuses on the bare essentials of user space packet processing: a packet forwarder including the whole NIC driver uses less than 1000 lines of C code.
Revised:  Ixy focuses on the bare essentials of user space packet processing: a packet forwarder including the whole NIC driver uses less than 1,000 lines of C code.
Edit intent: fluency
Original:  Manacher J. ACM 1975%DIFDELCMD < ] %%% proposed a seminal algorithm that computes the longest substring palindromes (LSPals ) of a given string  in O(n) time , where n is the length of the string.
Revised:  J. ACM 1975%DIFDELCMD < ] %%% proposed a seminal algorithm that computes the longest substring palindromes (LSPals ) of a given string in O(n) time , where n is the length of the string.
Edit intent: clarity
Original:  Manacher J. ACM 1975%DIFDELCMD < ] %%% proposed a seminal algorithm that computes the longest substring palindromes (LSPals ) of a given string  in O(n) time , where n is the length of the string.
Revised:  Manacher %DIFDELCMD < ] %%% proposed a seminal algorithm that computes the longest substring palindromes (LSPals ) of a given string in O(n) time , where n is the length of the string.
Edit intent: coherence
Original:  Manacher J. ACM 1975%DIFDELCMD < ] %%% proposed a seminal algorithm that computes the longest substring palindromes (LSPals ) of a given string  in O(n) time , where n is the length of the string.
Revised:  Manacher J. ACM 1975%DIFDELCMD < ] %%% It is known that the length of the longest palindromic substrings (LPSs ) of a given string in O(n) time , where n is the length of the string.
Edit intent: clarity
Original:  ] In this paper, we consider the problem of finding the LSPal after the string is edited.
Revised:  ]. In this paper, we consider the problem of finding the LSPal after the string is edited.
Edit intent: fluency
Original:  ] In this paper, we consider the problem of finding the LSPal after the string is edited.
Revised:  ] In this paper, we consider the problem of finding the LPS after the string is edited.
Edit intent: fluency
Original:  We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O( \ell + \log \log n) time, after a substring in Tis replaced by a string of arbitrary length \ell.
Revised:  We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O( \log n) time, after a substring in Tis replaced by a string of arbitrary length \ell.
Edit intent: clarity
Original:  To this end, we combine an encoder based on causal dilated convolutions with a  triplet loss employing time-based negative sampling, obtaining general-purpose representations for variable length and multivariate time series.
Revised:  To this end, we combine an encoder based on causal dilated convolutions with a novel triplet loss employing time-based negative sampling, obtaining general-purpose representations for variable length and multivariate time series.
Edit intent: coherence
Original:  We reduce the original problem to a limiting transmission problem whereby each thin membrane is replaced by an effective interface, and we develop a formal asymptotic method  to derive a set of biophysically consistent transmission conditions to close the limiting problem.
Revised:  We reduce the original problem to a limiting transmission problem whereby each thin membrane is replaced by an effective interface, and we develop a formal asymptotic method that enables us to derive a set of biophysically consistent transmission conditions to close the limiting problem.
Edit intent: clarity
Original: We consider a continuum mechanical model of cell invasion through thin membranes , which consists of a transmission problem for a system of nonlinear partial differential equations for the cell volume fraction complemented with continuity of stresses and mass flux across the surfaces of the membranes.
Revised: We consider a continuum mechanical model of cell invasion through thin membranes . The model consists of a transmission problem for a system of nonlinear partial differential equations for the cell volume fraction complemented with continuity of stresses and mass flux across the surfaces of the membranes.
Edit intent: clarity
Original: We consider a continuum mechanical model of cell invasion through thin membranes , which consists of a transmission problem for a system of nonlinear partial differential equations for the cell volume fraction complemented with continuity of stresses and mass flux across the surfaces of the membranes.
Revised: We consider a continuum mechanical model of cell invasion through thin membranes , which consists of a transmission problem for cell volume fraction complemented with continuity of stresses and mass flux across the surfaces of the membranes.
Edit intent: clarity
Original:  We reduce the original problem to a limiting transmission problem whereby each thin membrane is replaced by an effective interface, and we develop a formal asymptotic method that enables us to derive a set of biophysically consistent transmission conditions to close the limiting problem.
Revised:  We reduce the original problem to a limiting transmission problem whereby each thin membrane is replaced by an effective interface, and we develop a formal asymptotic method that enables the derivation of a set of biophysically consistent transmission conditions to close the limiting problem.
Edit intent: clarity
Original:  In order to illustrate the potential application of our effective interface conditions, we employ the limiting transmission problem to mathematically describe cancer cell invasion through the basement membrane and , in particular, to model the metastatic spread of ovarian carcinoma.
Revised:  In order to show potential applications of our effective interface conditions, we employ the limiting transmission problem to mathematically describe cancer cell invasion through the basement membrane and , in particular, to model the metastatic spread of ovarian carcinoma.
Edit intent: clarity
Original:  In order to illustrate the potential application of our effective interface conditions, we employ the limiting transmission problem to mathematically describe cancer cell invasion through the basement membrane and , in particular, to model the metastatic spread of ovarian carcinoma.
Revised:  In order to illustrate the potential application of our effective interface conditions, we employ the limiting transmission problem to model cancer cell invasion through the basement membrane and , in particular, to model the metastatic spread of ovarian carcinoma.
Edit intent: clarity