wanyu/IteraTeR_v2 huggingface dataset:
Original:  Moreover,%DIFDELCMD < \ebdjoin%%% \ scales very well up to 20%DIFDELCMD < \\%%% %DIF < errors which is critical in applications such as bioinformatics, and is far beyond the reach of existing algorithms .
Revised:  Moreover,%DIFDELCMD < \ebdjoin%%% %DIFDELCMD < \\%%% %DIF < errors which is critical in applications such as bioinformatics, and is far beyond the reach of existing algorithms .
Edit intent: coherence
Original:  Moreover,%DIFDELCMD < \ebdjoin%%% \ scales very well up to 20%DIFDELCMD < \\%%% %DIF < errors which is critical in applications such as bioinformatics, and is far beyond the reach of existing algorithms .
Revised:  Moreover,%DIFDELCMD < \ebdjoin%%% \ scales very well up to 20%DIFDELCMD < \\%%% %DIF < errors which is .
Edit intent: coherence
Original:  We characterize finite-state independence of normal words in three different ways, using three different kinds of finite automata running on infinite words (B\"uchi automata): finite automata with two input tapes , selectors and shufflers.
Revised:  We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous deterministic finite automata with two input tapes , selectors and shufflers.
Edit intent: clarity
Original:  Although the noncooperative model intuitively seems to lack the complexity and power of the cooperative model it has been exceedingly hard to prove this.
Revised:  Although the noncooperative model intuitively seems to lack the complexity and power of the cooperative model it was not obvious how to prove this.
Edit intent: clarity
Original: In this paper we propose an anisotropic extension of the isotropic exponentiated Hencky en- ergy , based on logarithmic strain invariants.
Revised: In this paper we propose an anisotropic extension of the isotropic exponentiated Hencky energy , based on logarithmic strain invariants.
Edit intent: fluency
Original:  We formally extend this approach towards anisotropy by defining additional anisotropic logarith- mic strain invariants with the help of suitable structural tensors and consider our findings for biomechanical applications .
Revised:  We formally extend this approach towards anisotropy by defining additional anisotropic logarithmic strain invariants with the help of suitable structural tensors and consider our findings for biomechanical applications .
Edit intent: fluency
Original:  We formally extend this approach towards anisotropy by defining additional anisotropic logarith- mic strain invariants with the help of suitable structural tensors and consider our findings for biomechanical applications .
Revised:  We formally extend this approach towards anisotropy by defining additional anisotropic logarith- mic strain invariants with the help of suitable structural tensors and consider our findings for selected case studies .
Edit intent: clarity
Original:  This problem has a long history, but it is currently motivated by social and biological networks.
Revised:  This problem has a long history, but it is undergoing a resurgence of interest due to the need to analyze social and biological networks.
Edit intent: clarity
Original:  While there are many ways to formalize it, one of the most popular is as an inference problem, where there is a planted "ground truth" community structure around which the graph is generated probabilistically.
Revised:  While there are many ways to formalize it, one of the most popular is as an inference problem, where there is a "ground truth" community structure around which the graph is generated probabilistically.
Edit intent: coherence
Original:  in between, there is a regime in which community detection is possible, but conjectured to be exponentially hard .
Revised:  in between, there is a regime in which community detection is possible, but conjectured to require exponential time .
Edit intent: clarity
Original:  Scientists measure rate constants associated with these reactions  in an optical biosensor: an instrument in which ligand molecules are convected through a flow cell, over a surface on which receptors are immobilized.
Revised:  Scientists measure rate constants associated with these reactions in which ligand molecules are convected through a flow cell, over a surface on which receptors are immobilized.
Edit intent: clarity
Original:  Scientists measure rate constants associated with these reactions  in an optical biosensor: an instrument in which ligand molecules are convected through a flow cell, over a surface on which receptors are immobilized.
Revised:  Scientists measure rate constants associated with these reactions in an optical biosensor: an instrument in which ligand molecules are convected through a fluid-filled volume over a surface on which receptors are immobilized.
Edit intent: clarity
Original:  Scientists measure rate constants associated with these reactions  in an optical biosensor: an instrument in which ligand molecules are convected through a flow cell, over a surface on which receptors are immobilized.
Revised:  Scientists measure rate constants associated with these reactions in an optical biosensor: an instrument in which ligand molecules are convected through a flow cell, over a surface to which receptors are immobilized.
Edit intent: clarity
Original:  In each case, the estimated odds multiplier is around 1.5\times , so the result is quite strong .
Revised:  In each case, the estimated odds multiplier is around 1.5\times , so the result is tangible .
Edit intent: clarity
Original: In this paper we study the implications for conference program committees of adopting single-blind reviewing, in which committee members are aware of the names and affiliations of paper authors, versus double-blind reviewing, in which this information is not visible to committee members.
Revised: In this paper we study the implications for conference program committees of using single-blind reviewing, in which committee members are aware of the names and affiliations of paper authors, versus double-blind reviewing, in which this information is not visible to committee members.
Edit intent: clarity
Original:  However, a meta-analysis places this value in line with that of other experiments, and in the context of this larger aggregate the gender effect is  statistically significant.
Revised:  However, a meta-analysis places this value in line with that of other experiments, and in the context of this larger aggregate the gender effect is also statistically significant.
Edit intent: clarity
Original: Many scenarios require computing the join of databases held by two or more parties that do not trust one another.
Revised: Private record linkage is the problem of identifying pairs of records that are similar as per an input matching rule from databases that are held by two or more parties that do not trust one another.
Edit intent: clarity
Original: Many scenarios require computing the join of databases held by two or more parties that do not trust one another.
Revised: Many scenarios require computing the join of databases held by two parties that do not trust one another.
Edit intent: clarity
Original:  We propose a novel privacy model, called output constrained differential privacy, that shares the strong privacy protection of differential privacy , but allows for the truthful release of the output of a certain function on the data.
Revised:  We propose a novel privacy model, called output constrained differential privacy, that shares the strong privacy protection of DP , but allows for the truthful release of the output of a certain function on the data.
Edit intent: clarity
Original:  We propose a novel privacy model, called output constrained differential privacy, that shares the strong privacy protection of differential privacy , but allows for the truthful release of the output of a certain function on the data.
Revised:  We propose a novel privacy model, called output constrained differential privacy, that shares the strong privacy protection of differential privacy , but allows for the truthful release of the output of a certain function applied to the data.
Edit intent: clarity
Original:  We apply this to private record linkage , and show that algorithms satisfying this privacy model permit the disclosure of the true matching records, but their execution is insensitive to the presence or absence of a single non-matching record.
Revised:  We apply this to PRL , and show that algorithms satisfying this privacy model permit the disclosure of the true matching records, but their execution is insensitive to the presence or absence of a single non-matching record.
Edit intent: clarity
Original:  We apply this to private record linkage , and show that algorithms satisfying this privacy model permit the disclosure of the true matching records, but their execution is insensitive to the presence or absence of a single non-matching record.
Revised:  We apply this to private record linkage , and show that protocols satisfying this privacy model permit the disclosure of the true matching records, but their execution is insensitive to the presence or absence of a single non-matching record.
Edit intent: clarity
Original:  We identify three key desiderata that a PRL solution must ensure: a proof of end-to-end privacy, communication and computational costs that scale sub-quadratically in the number of input records, perfect precision and high recall of matching pairs.
Revised:  We identify three key desiderata that a PRL solution must ensure: a proof of end-to-end privacy, communication and computational costs that scale subquadratically in the number of input records, perfect precision and high recall of matching pairs.
Edit intent: fluency
Original: Private record linkage  is the problem of identifying pairs of records that are similar as per an input matching rule from databases that are held by two parties that do not trust one another.
Revised: Private record linkage is the problem of identifying pairs of records that are similar as per an input matching rule from databases held by two parties that do not trust one another.
Edit intent: fluency
Original:  We identify three key desiderata that a PRL solution must ensure:  a proof of end-to-end privacy,  communication and computational costs that scale subquadratically in the number of input records , perfect precision and high recall of matching pairs .
Revised:  We identify three key desiderata that a PRL solution must ensure: a proof of end-to-end privacy, communication and computational costs that scale subquadratically in the number of input records .
Edit intent: coherence
Original:  We show that all of the existing solutions for PRL -- including secure 2-party computation (S2PC), and their variants that use non-private or differentially private (DP) blocking -- violate at least one of the three desiderata.
Revised:  We show that all of the existing solutions for PRL - including secure 2-party computation (S2PC), and their variants that use non-private or differentially private (DP) blocking -- violate at least one of the three desiderata.
Edit intent: fluency
Original:  We  develop novel protocols that satisfy this end-to-end privacy guarantee and permit a tradeoff between recall, privacy and efficiency.
Revised:  We develop novel protocols that provably achieve this end-to-end privacy guarantee and permit a tradeoff between recall, privacy and efficiency.
Edit intent: clarity
Original:  In this work we promote transcript length as a further key determinant of translation efficiency.
Revised:  In this work we propose transcript length as a further key determinant of translation efficiency.
Edit intent: clarity
Original:  We also demonstrate how this process might be involved in shaping the experimental ribosome density-gene length dependence.
Revised:  We also demonstrate how this process may be involved in shaping the experimental ribosome density-gene length dependence.
Edit intent: fluency
Original: Word equations are an important problem on the intersection of formal languages and algebra . Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Revised: Satisfiability of word equations is an important problem on the intersection of formal languages and algebra . Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Edit intent: clarity
Original: Word equations are an important problem on the intersection of formal languages and algebra . Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Revised: Word equations are an important problem in the intersection of formal languages and algebra . Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Edit intent: fluency
Original: Word equations are an important problem on the intersection of formal languages and algebra . Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Revised: Word equations are an important problem on the intersection of formal languages and algebra : Given two sequences consisting of letters and variables we are to decide whether there is a substitution for the variables that turns this equation into true equality of strings.
Edit intent: fluency
Original:  The  computational complexity of this problem remains unknown, with the best lower and upper bounds being  NP and PSPACE.
Revised:  The exact computational complexity of this problem remains unknown, with the best lower and upper bounds being NP and PSPACE.
Edit intent: clarity
Original:  Recently, a novel technique of recompression was applied to this problem, simplifying the known proofs and lowering the space complexity to (nondeterministic) O(n log n).
Revised:  Recently, the novel technique of recompression was applied to this problem, simplifying the known proofs and lowering the space complexity to (nondeterministic) O(n log n).
Edit intent: fluency
Original:  In this paper we show that word equations are in nondeterministic linear space, thus the language of satisfiable word equations is  context-sensitive.
Revised:  In this paper we show that satisfiability of word equations is in nondeterministic linear space, thus the language of satisfiable word equations is context-sensitive.
Edit intent: clarity
Original:  Experienced human drivers are generally able to analyze the environment and choose driving strategies that will help them avoid crashes.
Revised:  Experienced human drivers are able to analyze the environment and choose driving strategies that will help them avoid crashes.
Edit intent: coherence
Original:  By interpreting a communications system as an autoencoder, we develop a fundamental new way to think about radio communications system design as an end-to-end reconstruction optimization task that seeks to jointly optimize transmitter and receiver components in a single process.
Revised:  By interpreting a communications system as an autoencoder, we develop a fundamental new way to think about communications system design as an end-to-end reconstruction optimization task that seeks to jointly optimize transmitter and receiver components in a single process.
Edit intent: clarity
Original:  By interpreting a communications system as an autoencoder, we develop a fundamental new way to think about radio communications system design as an end-to-end reconstruction optimization task that seeks to jointly optimize transmitter and receiver components in a single process.
Revised:  By interpreting a communications system as an autoencoder, we develop a fundamental new way to think about radio communications system design as an end-to-end reconstruction task that seeks to jointly optimize transmitter and receiver components in a single process.
Edit intent: clarity
Original:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Revised:  We further present the concept of radio transformer networks as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Edit intent: clarity
Original:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Revised:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the machine learning model. Lastly, we demonstrate the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Edit intent: clarity
Original:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Revised:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks on raw IQ time-series data for modulation classification .
Edit intent: clarity
Original:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ time-series data for modulation classification .
Revised:  We further present the concept of Radio Transformer Networks (RTNs) as a means to incorporate expert domain knowledge in the ML modeland study the application of convolutional neural networks (CNNs) on raw IQ samples for modulation classification .
Edit intent: clarity
Original:  This presents a challenge especially when the user responses to be predicted is rare, because each feature will only have very few positive examples.
Revised:  This presents a challenge especially when the user responses to be predicted are rare, because each feature will only have very few positive examples.
Edit intent: fluency
Original: We show how faceted search using a combination of traditional classification systems and mixed-membership models can move beyond keyword search to inform resource discovery, hypothesis formulation, and argument extraction for interdisciplinary research.
Revised: We show how faceted search using a combination of traditional classification systems and mixed-membership topic models can go beyond keyword search to inform resource discovery, hypothesis formulation, and argument extraction for interdisciplinary research.
Edit intent: clarity
Original:  We show how a combination of classification systems and mixed-membership models trained over large digital libraries can inform resource discovery in this domain , using methods that can be generalized to other interdisciplinary research questions .
Revised:  We show how a combination of classification systems and mixed-membership models trained over large digital libraries can inform resource discovery in this domain .
Edit intent: clarity
Original:  Through a novel approach of  drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Revised:  Through a novel approach of " drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Edit intent: fluency
Original:  Through a novel approach of  drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Revised:  Through a novel approach of drill-down topic modeling, we are able to reduce a large collection of fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Edit intent: clarity
Original:  Through a novel approach of  drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Revised:  Through a novel approach of drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear among the first ten search results in the HathiTrust digital library .
Edit intent: clarity
Original:  Through a novel approach of  drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten search results in the HathiTrust digital library .
Revised:  Through a novel approach of drill-down topic modeling, we are able to reduce a collection of 1,315 fulltext volumes to 6 focal volumes that did not appear in the first ten results of the keyword search in the HathiTrust digital library .
Edit intent: clarity
Original:  This ultimately supports a system for semi-automatic identification of argument structures to augment the kind of "close reading" that leads to novel interpretations at the heart of scholarly work in the humanities , drilling down from massive quantities of text to very specific passages.
Revised:  This ultimately supports a system for semi-automatic identification of argument structures to augment the kind of "close reading" needed to generate original interpretations that is the heart of scholarly work in the humanities , drilling down from massive quantities of text to very specific passages.
Edit intent: clarity
Original: Comparing alternatives in pairs are the well-known method of ranking creation.
Revised: Comparing alternatives in pairs is a well-known method of ranking creation.
Edit intent: coherence
Original:  The experts are asked to perform a series of binary comparisons then using the mathematical methods the final ranking is prepared.
Revised:  Experts are asked to perform a series of binary comparisons then using the mathematical methods the final ranking is prepared.
Edit intent: clarity
Original:  The experts are asked to perform a series of binary comparisons then using the mathematical methods the final ranking is prepared.
Revised:  The experts are asked to perform a series of binary comparisons and then, using mathematical methods, the final ranking is prepared.
Edit intent: coherence
Original:  As experts do the individual assessments, they may not always be consistent.
Revised:  As experts conduct the individual assessments, they may not always be consistent.
Edit intent: clarity
Original:  One way to determine the level of inconsistency among the paired comparisons is to calculate the value of  inconsistency index.
Revised:  One way to determine the level of inconsistency among the paired comparisons is to calculate the value of the inconsistency index.
Edit intent: fluency
Original:  One of the earliest and most widespread inconsistency indexes is  consistency coefficient defined by Kendall and Babington Smith.
Revised:  One of the earliest and most widespread inconsistency indexes is the consistency coefficient defined by Kendall and Babington Smith.
Edit intent: fluency
Original:  The presented work extends the Kendall and Babington Smith index to the set of paired comparison with ties.
Revised:  The presented work extends the Kendall and Babington Smith index to sets of paired comparisons with ties.
Edit intent: fluency