wanyu/IteraTeR_v2 huggingface dataset:
Original:  While words need to rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering process and the matching process, to reflect the contextual dependencies between words . Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and keywords are then selected by applying PageRank on this graph.
Revised:  While words need to rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering process and the matching process, to well capture the critical word-level matching signals . Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and keywords are then selected by applying PageRank on this graph.
Edit intent: clarity
Original:  While words need to rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering process and the matching process, to reflect the contextual dependencies between words . Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and keywords are then selected by applying PageRank on this graph.
Revised:  While words need to rely on their contexts to express concrete meanings, so we propose to jointly learn the filtering process and the matching process, to reflect the contextual dependencies between words . Specifically, a word graph is first built based on the attention scores in each self-attention block of Transformer, and key words are then selected by applying PageRank on this graph.
Edit intent: clarity
Original:  Experimental results show that Match-Ignition outperforms both traditional text matching models for short text and recent long-form text matching models.
Revised:  Experimental results show that Match-Ignition outperforms both traditional text matching models and recent long-form text matching models.
Edit intent: clarity
Original:  We also conduct detailed analysis to show that Match-Ignition can efficiently capture important sentences or words, which are helpful for long-form text matching  .
Revised:  We also conduct detailed analysis to show that Match-Ignition efficiently captures important sentences and words, to facilitate the long-form text matching .
Edit intent: clarity
Original:  We also conduct detailed analysis to show that Match-Ignition can efficiently capture important sentences or words, which are helpful for long-form text matching  .
Revised:  We also conduct detailed analysis to show that Match-Ignition can efficiently capture important sentences or words, which are helpful for long-form text matching process .
Edit intent: clarity
Original:  With such a dynamically changing environment spanning several boundaries, geographic and organizational, there is little awareness about the changes that are flowing in through other active pull requests in the system leading to complex merge conflicts, hard-to-detect logical bugs or duplication of work  and wasted developer productivity.
Revised:  With such a dynamically changing environment spanning several boundaries, geographic and organizational, there is little awareness about the changes that are flowing in through other active pull requests in the system leading to complex merge conflicts, logical bugs that are difficult to detect, duplication of work and wasted developer productivity.
Edit intent: clarity
Original:  With such a dynamically changing environment spanning several boundaries, geographic and organizational, there is little awareness about the changes that are flowing in through other active pull requests in the system leading to complex merge conflicts, hard-to-detect logical bugs or duplication of work  and wasted developer productivity.
Revised:  With such a dynamically changing environment spanning several boundaries, geographic and organizational, there is little awareness about the changes that are flowing in through other active pull requests in the system leading to complex merge conflicts, hard-to-detect logical bugs or duplication of work , and wasted developer productivity.
Edit intent: fluency
Original:  In order to address thisproblem, we studied changes produced in eight very large repositories , in Microsoft to understand the extent of concurrent edits and their relation to subsequent bugsand bug fixes . Motivated by our findings, we developed a system called ConE (Concurrent Edit Detector) that proactively detects concurrent edits to help mitigate the problems caused by them.
Revised:  In order to address thisproblem, we studied changes produced in eight very large repositories , in Microsoft to understand the extent of concurrent edits and their relation to subsequent bugsand bug fixes . Motivated by these findings, we developed a system called ConE (Concurrent Edit Detector) that proactively detects concurrent edits to help mitigate the problems caused by them.
Edit intent: fluency
Original:  In order to address thisproblem, we studied changes produced in eight very large repositories , in Microsoft to understand the extent of concurrent edits and their relation to subsequent bugsand bug fixes . Motivated by our findings, we developed a system called ConE (Concurrent Edit Detector) that proactively detects concurrent edits to help mitigate the problems caused by them.
Revised:  In order to address thisproblem, we studied changes produced in eight very large repositories , in Microsoft to understand the extent of concurrent edits and their relation to subsequent bugsand bug fixes . Motivated by our findings, we design, implement, and deploy a service named ConE (Concurrent Edit Detector) that proactively detects concurrent edits to help mitigate the problems caused by them.
Edit intent: clarity
Original:  Current work in image simulation either fail to be photorealistic or do not model the 3D environment and the dynamic objects within, losing high-level control and physical realism.
Revised:  Current works in image simulation either fail to be photorealistic or do not model the 3D environment and the dynamic objects within, losing high-level control and physical realism.
Edit intent: fluency
Original:  The resulting synthetic images are photorealistic , traffic-aware, and geometrically consistent, allowing image simulation to scale to complex use cases.
Revised:  The resulting synthetic images are realistic , traffic-aware, and geometrically consistent, allowing image simulation to scale to complex use cases.
Edit intent: clarity
Original:  The resulting synthetic images are photorealistic , traffic-aware, and geometrically consistent, allowing image simulation to scale to complex use cases.
Revised:  The resulting synthetic images are photorealistic , traffic-aware, and geometrically consistent, allowing our approach to scale to complex use cases.
Edit intent: clarity
Original: In this paper, we propose a  method to discover multiscale chemical reactions governed by the law of mass action from data .
Revised: In this paper, we propose a data-driven method to discover multiscale chemical reactions governed by the law of mass action from data .
Edit intent: clarity
Original: In this paper, we propose a  method to discover multiscale chemical reactions governed by the law of mass action from data .
Revised: In this paper, we propose a method to discover multiscale chemical reactions governed by the law of mass action .
Edit intent: clarity
Original:  First, we use one matrix to represent the stoichiometric coefficients for both the reactants and products in a system without catalysis reactions.
Revised:  First, we use a single matrix to represent the stoichiometric coefficients for both the reactants and products in a system without catalysis reactions.
Edit intent: fluency
Original:  The negative entries in the matrix denote the stoichiometric coefficients for the reactants and the positive ones denote the products.
Revised:  The negative entries in the matrix denote the stoichiometric coefficients for the reactants and the positive ones for the products.
Edit intent: fluency
Original:  Second, we find that the conventional optimization methods usually get stuck in the local minima and could not find the true solution in learning  multiscale chemical reactions.
Revised:  Second, we find that the conventional optimization methods usually get stuck in the local minima and could not find the true solution in learning the multiscale chemical reactions.
Edit intent: fluency
Original:  To overcome this difficulty, we propose to perform a round operation on the stoichiometric coefficients which are closed to integersand do not update them in the afterwards training .
Revised:  To overcome this difficulty, we propose a partial-parameters-freezing (PPF) technique to progressively determine the network parameters by using the fact that the stoichiometric coefficients are integers .
Edit intent: clarity
Original:  With such a treatment , the dimension of the searching space is greatly reduced and the global mimina is eventually obtained.
Revised:  With such a technique , the dimension of the searching space is greatly reduced and the global mimina is eventually obtained.
Edit intent: clarity
Original:  With such a treatment , the dimension of the searching space is greatly reduced and the global mimina is eventually obtained.
Revised:  With such a treatment , the dimension of the searching space is gradually reduced in the training process and the global mimina is eventually obtained.
Edit intent: clarity
Original:  With such a treatment , the dimension of the searching space is greatly reduced and the global mimina is eventually obtained.
Revised:  With such a treatment , the dimension of the searching space is greatly reduced and the global mimina can be eventually obtained.
Edit intent: clarity
Original:  Several numerical experiments including the classical Michaelis-Menten kinetics and the hydrogen oxidation reactions verify the good performance of our algorithm in learning  multiscale chemical reactions.
Revised:  Several numerical experiments including the classical Michaelis-Menten kinetics and the hydrogen oxidation reactions verify the good performance of our algorithm in learning the multiscale chemical reactions.
Edit intent: fluency
Original:  Several numerical experiments including the classical Michaelis-Menten kinetics and the hydrogen oxidation reactions  verify the good performance of our algorithm in learning the multiscale chemical reactions.
Revised:  Several numerical experiments including the classical Michaelis-Menten kinetics , the hydrogen oxidation reactions verify the good performance of our algorithm in learning the multiscale chemical reactions.
Edit intent: fluency
Original:  This particular class of graphs received a significant attention in the past, mainly due to a number of potential applications it provides.
Revised:  This particular class of graphs received significant attention in the past, mainly due to a number of potential applications it provides.
Edit intent: fluency
Original: Self-supervised acoustic pre-training has achieved impressive results on low-resource speech recognition tasks .
Revised: End-to-end models have achieved impressive results on low-resource speech recognition tasks .
Edit intent: clarity
Original:  It indicates that the pretrain-and-finetune paradigm is a promising direction.
Edit intent: coherence
Original:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) .
Revised:  In this work, we fuse a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) .
Edit intent: coherence
Original:  A fully connected layer is introduced for  hidden mapping between speech and language modalities.
Revised:  A fully connected layer is introduced for the hidden mapping between speech and language modalities.
Edit intent: fluency
Original:  Our model achieves approaching recognition performance in CALLHOME corpus ( 15h) as the SOTA pipeline modeling .
Revised:  Our model achieves better recognition performance on CALLHOME corpus ( 15h) as the SOTA pipeline modeling .
Edit intent: clarity
Original:  Our model achieves approaching recognition performance in CALLHOME corpus ( 15h) as the SOTA pipeline modeling .
Revised:  Our model achieves approaching recognition performance in CALLHOME corpus ( 15 hours) than other end-to-end models .
Edit intent: clarity
Original:  Alavi, Malde, Schwenk, and Erd{\"o}s conjectured that for trees the independence polynomial  is unimodal.
Revised:  Alavi, Malde, Schwenk, and Erd{\"o}s conjectured that the independence polynomial is unimodal.
Edit intent: clarity
Original:  In this paper , we provide support to this assertion .
Revised:  In what follows , we provide support to this assertion .
Edit intent: clarity
Original:  We therefore propose a optimization strategy, with better empirical and theoretical convergence, based on accelerated proximal gradients.
Revised:  We therefore propose an optimization strategy, with better empirical and theoretical convergence, based on accelerated proximal gradients.
Edit intent: fluency
Original: Deep-predictive-coding networks (DPCNs) are hierarchical, generative models that rely on feed-forward and feed-back connections to modulate latent feature representations of stimuli in a dynamic and context-sensitive manner.
Revised: Deep-predictive-coding networks (DPCNs) are hierarchical, generative models . They rely on feed-forward and feed-back connections to modulate latent feature representations of stimuli in a dynamic and context-sensitive manner.
Edit intent: coherence
Original:  A crucial element of DPCNs is a forward-backward inference procedure to uncover sparse states of a dynamic model, which are used for invariant feature extraction .
Revised:  A crucial element of DPCNs is a forward-backward inference procedure to uncover sparse , invariant features .
Edit intent: clarity
Original:  We demonstrate that the ability to construct deeper DPCNs leads to receptive fields that capture well the entire notions of objects on which the networks are trained.
Revised:  We demonstrate that the ability to construct deeper DPCNs leads to receptive fields that capture well the entire classes of objects on which the networks are trained.
Edit intent: clarity
Original:  It yields completely unsupervised classifiers that surpass convolutional and convolutional-recurrent autoencoders and are on par with convolutional networks trained in a supervised manner .
Revised:  It yields unsupervised object recognition that surpass convolutional and convolutional-recurrent autoencoders and are on par with convolutional networks trained in a supervised manner .
Edit intent: clarity
Original:  It yields completely unsupervised classifiers that surpass convolutional and convolutional-recurrent autoencoders and are on par with convolutional networks trained in a supervised manner .
Revised:  It yields completely unsupervised classifiers that surpass convolutional autoencoders and are on par with convolutional networks trained in a supervised manner .
Edit intent: clarity
Original:  In the search for motile organisms, it is therefore valuable to have rough estimates for the number of such microbes that one might expect to find in a given area or volume.
Revised:  In the search for motile organisms, it is therefore valuable to have rough estimates for the number of such microbes that one may expect to find in a given area or volume.
Edit intent: fluency
Original:  We consequently demonstrate that the resultant densities  might be potentially comparable to, or much lower than, those documented in various extreme environments on Earth.
Revised:  We consequently demonstrate that the resultant densities of motile organisms might be potentially comparable to, or much lower than, those documented in various extreme environments on Earth.
Edit intent: clarity
Original: Motility is a ubiquitous feature of microbial life on Earth  and is widely regarded as a promising biosignature candidate.
Revised: Motility is a ubiquitous feature of microbial life on Earth , and is widely regarded as a promising biosignature candidate.
Edit intent: fluency
Original:  Then using a new lemma, we fix Long's proof to show that for all M > 3 and infinitely many k, there exists a set F of functions from a set X to a set Y of size k such that opt_{std(F) = M and opt_{bandit}(F) }%DIFDELCMD < \ge %%% (1 - o(1))(|Y|\ln{|Y| .
Revised:  Then using a new lemma, we fix Long's proof (F) = M and opt_{bandit}(F) }%DIFDELCMD < \ge %%% (1 - o(1))(|Y|\ln{|Y| .
Edit intent: coherence
Original: Contrastive learning has been applied successfully to learn numerical vector representations of various forms of data, such as texts and images.
Revised: Contrastive learning has been applied successfully to learn vector representations of various forms of data, such as texts and images.
Edit intent: clarity
Original:  This paper introduces a re-computation technique that decouples back propagation between contrastive loss and the encoder, removing encoder backward pass data dependency along the batch dimension.
Revised:  This paper introduces a re-computation technique that decouples backpropagation between contrastive loss and the encoder, removing encoder backward pass data dependency along the batch dimension.
Edit intent: fluency
Original:  As a result, gradients can be computed for one subset of the batch at a time, leading to an almost constant peak GPU memory usagefor batches of different sizes .
Revised:  As a result, gradients can be computed for one subset of the batch at a time, leading to almost constant memory usage .
Edit intent: clarity
Original:  However, they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  However, they didn} their paper doesn 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: clarity
Original:  However, they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  However, they didn} 't provide an explicit bound on the running time , as it indirectly relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: clarity
Original:  However, they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  However, they didn} 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: fluency
Original:  However, they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{ courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  However, they didn} 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{ marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem . Motivated by this, we design and present an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: coherence
Original: In this study optical flow method is used for soil  deformation measurement in laboratory tests.
Revised: In this study optical flow method was used for soil deformation measurement in laboratory tests.
Edit intent: fluency
Original:  The main objective was to observe how the deformation distributes along the whole height of cylindrical soil sample subjected to torsional shearing (TS test).
Revised:  The main objective was to observe how the deformation distributes along the whole height of cylindrical soil specimen subjected to torsional shearing (TS test).
Edit intent: fluency
Original:  The experiments were conducted on dry non-cohesive soil samples under two different values of isotropic pressure.
Revised:  The experiments were conducted on dry non-cohesive soil specimens under two values of isotropic pressure.
Edit intent: clarity
Original:  Samples were loaded with low-amplitude cyclic torque to analyze the deformation within the small strain range (0.001-0.01\%).
Revised:  Specimens were loaded with low-amplitude cyclic torque to analyze the deformation within the small strain range (0.001-0.01\%).
Edit intent: clarity
Original:  Optical flow method variant developed by Ce Liu (2009) was used for motion estimation from time-ordered series of images.
Revised:  Optical flow method variant by Ce Liu (2009) was used for motion estimation from time-ordered series of images.
Edit intent: clarity
Original:  Optical flow method variant developed by Ce Liu (2009) was used for motion estimation from time-ordered series of images.
Revised:  Optical flow method variant developed by Ce Liu (2009) was used for motion estimation from series of images.
Edit intent: clarity
Original:  We show how to preserve high order accuracy in this case through the use of a harmonic correction which involves solving a simple Laplace equation with smooth boundary data.
Revised:  We show how to preserve spectral accuracy in this case through the use of a harmonic correction which involves solving a simple Laplace equation with smooth boundary data.
Edit intent: clarity
Original: We introduce the first end-to-end Deep Reinforcement Learning  based framework for active high frequency trading.
Revised: We introduce the first end-to-end Deep Reinforcement Learning (DRL) based framework for active high frequency trading.
Edit intent: clarity
Original:  We train DRL agents to to trade one unit of Intel Corporation stocks by employing the Proximal Policy Optimization algorithm.
Revised:  We train DRL agents to trade one unit of Intel Corporation stocks by employing the Proximal Policy Optimization algorithm.
Edit intent: fluency
Original:  We train DRL agents to to trade one unit of Intel Corporation stocks by employing the Proximal Policy Optimization algorithm.
Revised:  We train DRL agents to to trade one unit of Intel Corporation stock by employing the Proximal Policy Optimization algorithm.
Edit intent: fluency
Original:  We consider three different state characterizations, which differ in the LOB-based meta-features they include.
Revised:  We consider three different state characterizations, which differ in their LOB-based meta-features they include.
Edit intent: fluency
Original: Over the past few years, there is a heated debate and serious public concerns regarding online content moderation, censorship, and the basic principle of free speech on the Web.
Revised: Over the past few years, there is a heated debate and serious public concerns regarding online content moderation, censorship, and the principle of free speech on the Web.
Edit intent: clarity