wanyu/IteraTeR_full_sent huggingface dataset:
Original:  To account for environmental and sensing uncertainty, we extend  Linear Temporal Logic (LTL) by including sensor-based predicates allowing us to incorporate uncertainty and probabilistic satisfaction requirements directly into the task specification.
Revised:  To account for environmental and sensing uncertainty, we extend Linear Temporal Logic (LTL) by including sensor-based predicates allowing us to incorporate uncertainty-wise and probabilistic satisfaction requirements directly into the task specification.
Edit intent: meaning-changed
Original:  The sensor-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that can be updated online to adapt to the map that is continuously learned by existing semantic SLAM methods .
Revised:  The perception-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that can be updated online to adapt to the map that is continuously learned by existing semantic SLAM methods .
Edit intent: clarity
Original:  The sensor-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that can be updated online to adapt to the map that is continuously learned by existing semantic SLAM methods .
Revised:  The sensor-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that are updated online to adapt to the map that is continuously learned by existing semantic SLAM methods .
Edit intent: coherence
Original:  The sensor-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that can be updated online to adapt to the map that is continuously learned by existing semantic SLAM methods .
Revised:  The sensor-based LTL planning problem gives rise to an optimal control problem, solved by a novel sampling-based algorithm, that generates open-loop control policies that can be updated online to adapt to a continuously learned semantic map .
Edit intent: clarity
Original:  It learns tiny domain-specific subnetworks for tuning. During adaptation to a new domain, we only tune its corresponding subnetwork. PRUNE-TUNE alleviates the over-fitting and the degradation problem without model modification.
Revised:  It learns tiny domain-specific sub-networks during fine-tuning on new domains. Prune-Tune alleviates the over-fitting and the degradation problem without model modification.
Edit intent: clarity
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Furthermore, Prune-Tune is able to sequentially learn a single network with multiple disjoint domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without the quality degradation of the general domain in both single and multiple domain settings.
Edit intent: meaning-changed
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Additionally, with no overlapping between domain-specific sub-networks for multiple domains . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without the quality degradation of the general domain in both single and multiple domain settings.
Edit intent: clarity
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that Prune-Tune outperforms several strong competitors in the target domain test set without the quality degradation of the general domain in both single and multiple domain settings.
Edit intent: fluency
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without sacrificing the quality on the quality degradation of the general domain in both single and multiple domain settings.
Edit intent: clarity
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without the general domain in both single and multiple domain settings.
Edit intent: clarity
Original:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without  the quality degradation of the general domain in both single and multiple domain settings.
Revised:  Additionally, with no overlapping between domain-specific subnetworks, PRUNE-TUNE is also capable of sequential multi-domain learning . Empirical experiment results show that PRUNE-TUNE outperforms several strong competitors in the target domain test set without the quality degradation of the general domain in both single and multi-domain settings. The source code and data are available at URL
Edit intent: meaning-changed
Original: Type 2 diabetes (T2D) is a challenging metabolic disorder characterized by a substantial loss of \beta-cell mass via progressive programmed cell death and alteration of \beta-cell function in the islets of Langerhans, disrupting insulin secretion and glucose homeostasis.
Revised: Type 2 diabetes (T2D) is a challenging metabolic disorder characterized by a substantial loss of \beta-cell mass and alteration of \beta-cell function in the islets of Langerhans, disrupting insulin secretion and glucose homeostasis.
Edit intent: clarity
Original:  We further predict that varying the conductance gating of delayed rectifier K^{+} channels modifies oscillatory activity patterns of \beta-cell population lacking intercellular coupling, which significantly affect Ca^{2+} concentration and insulin secretion.
Revised:  We further predict that varying the whole-cell conductance of delayed rectifier K^{+} channels modifies oscillatory activity patterns of \beta-cell population lacking intercellular coupling, which significantly affect Ca^{2+} concentration and insulin secretion.
Edit intent: clarity
Original:  However, in real-world environments, a human usually only has a general goal (e.g., general direction or area in motion planning) at the beginning of the cooperation  which needs to be clarified to a specific goal (e.g., an exact position) during cooperation.
Revised:  However, in real-world environments, a human usually only has a general goal (e.g., general direction or area in motion planning) at the beginning of the cooperation , which needs to be clarified to a specific goal (e.g., an exact position) during cooperation.
Edit intent: fluency
Original:  We present  Evolutionary Value Learning (EVL) approach  which uses a State-based Multivariate Bayesian Inference method to model the dynamics of  goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Revised:  We present the Evolutionary Value Learning (EVL) approach which uses a State-based Multivariate Bayesian Inference method to model the dynamics of goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Edit intent: fluency
Original:  We present  Evolutionary Value Learning (EVL) approach  which uses a State-based Multivariate Bayesian Inference method to model the dynamics of  goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Revised:  We present Evolutionary Value Learning (EVL) approach , which uses a State-based Multivariate Bayesian Inference method to model the dynamics of goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Edit intent: fluency
Original:  We present  Evolutionary Value Learning (EVL) approach  which uses a State-based Multivariate Bayesian Inference method to model the dynamics of  goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Revised:  We present Evolutionary Value Learning (EVL) approach which uses a State-based Multivariate Bayesian Inference method to model the dynamics of the goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Edit intent: fluency
Original:  We present  Evolutionary Value Learning (EVL) approach  which uses a State-based Multivariate Bayesian Inference method to model the dynamics of  goal specification process in HRC , and an Evolutionary Value Updating method to actively enhance the process of goal specification and cooperation formation.
Revised:  We present Evolutionary Value Learning (EVL) approach which uses a State-based Multivariate Bayesian Inference method to model the dynamics of goal specification process in HRC . EVL can actively enhance the process of goal specification and cooperation formation.
Edit intent: coherence
Original: A new method of analyzing rule continuity in computations with shape grammars is presented. By building on recent results in topology for shapes in algebras U_i, the paper provides, (1) a general formulation of continuous rule applications based on the  continuity of the mappings that describe these rule applications, (2) conditions that a mapping must satisfy to be suitable for analyzing rule continuity , and (3) procedures for computing continuous topologies in a given computation .
Revised: The rules in a shape grammar apply in terms of embedding to take advantage of the parts that emerge visually in the continuity of the mappings that describe these rule applications, (2) conditions that a mapping must satisfy to be suitable for analyzing rule continuity , and (3) procedures for computing continuous topologies in a given computation .
Edit intent: meaning-changed
Original:  By building on recent results in topology for shapes in algebras U_i, the paper provides, (1) a general formulation of continuous rule applications based on the  continuity of the mappings that describe these rule applications, (2) conditions that a mapping must satisfy to be suitable for analyzing rule continuity , and (3) procedures for computing continuous topologies in a given computation .
Revised:  By building on recent results in topology for shapes in algebras U_i, the paper provides, (1) a general formulation of continuous rule applications based on the appearance of shapes. While the shapes are kept unanalyzed throughout a computation, their descriptions can be defined retrospectively based on how the rules are applied. An important outcome of this is that continuity for rules is not built-in but it is "fabricated" retrospectively to explain a computation as a continuous process. An aspect of continuity analysis that has not been addressed in the literature is how to decide which mapping forms to use to study the continuity of rule applications. This is addressed in this paper in a new approach to continuity of the mappings that describe these rule applications, (2) conditions that a mapping must satisfy to be suitable for analyzing rule continuity , and (3) procedures for computing continuous topologies in a given computation .
Edit intent: meaning-changed
Original:  By building on recent results in topology for shapes in algebras U_i, the paper provides, (1) a general formulation of continuous rule applications based on the  continuity of the mappings that describe these rule applications, (2) conditions that a mapping must satisfy to be suitable for analyzing rule continuity , and (3) procedures for computing continuous topologies in a given computation .
Revised:  By building on recent results in topology for shapes in algebras U_i, the paper provides, (1) a general formulation of continuous rule applications based on the continuity analysis, which uses recent results on shape topology and continuous mappings. A characterization is provided that distinguishes the suitable mapping forms from those that are inherently discontinuous or practically inconsequential for continuity analysis. It is also shown that certain inherent properties of shape topologies and continuous mappings provide an effective method of computing topologies algorithmically .
Edit intent: coherence
Original: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection  : Given a (corrupted) long-form narrative, decide whether there exists some semantic discrepancy in the narrative flow.
Revised: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection as a new arena for inter-sentential semantic understanding : Given a (corrupted) long-form narrative, decide whether there exists some semantic discrepancy in the narrative flow.
Edit intent: meaning-changed
Original: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection  : Given a (corrupted) long-form narrative, decide whether there exists some semantic discrepancy in the narrative flow.
Revised: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection : Given a multi-sentence narrative, decide whether there exists some semantic discrepancy in the narrative flow.
Edit intent: meaning-changed
Original: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection  : Given a (corrupted) long-form narrative, decide whether there exists some semantic discrepancy in the narrative flow.
Revised: Motivated by the increasing popularity of intelligent editing assistant, we introduce and investigate the task of narrative incoherence detection : Given a (corrupted) long-form narrative, decide whether there exist any semantic discrepancies in the narrative flow.
Edit intent: fluency
Original:  In this paper, I argue that the new test (i.e. the Antigen test) describes ambiguous information and therefore allows for a phenomenon called dilation -- an extreme form of non-informativeness.
Revised:  In this paper, I argue that the new test can be described as producing ambiguous information when the pre-established is imperfect. This allows for a phenomenon called dilation -- an extreme form of non-informativeness.
Edit intent: meaning-changed
Original: We study the dynamic geometry, loci , and invariants of three Poncelet families associated with three distinct concentric Ellipse pairs: with-incircle, with-circumcircle, and homothetic.
Revised: We compare loci types and invariants across Poncelet families interscribed in three distinct concentric Ellipse pairs: with-incircle, with-circumcircle, and homothetic.
Edit intent: clarity
Original: We study the dynamic geometry, loci , and invariants of three Poncelet families associated with three distinct concentric Ellipse pairs: with-incircle, with-circumcircle, and homothetic. Most of their properties run parallel to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism , allowing us URLanize them in three "similar" groups.
Revised: We study the dynamic geometry, loci , and invariants of three Poncelet families associated with three distinct concentric Ellipse pairs: (i) ellipse-incircle, (ii) circumcircle-inellipse, and (iii) homothetic. Their metric properties are mostly identical to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism , allowing us URLanize them in three "similar" groups.
Edit intent: clarity
Original:  Most of their properties run parallel to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism , allowing us URLanize them in three "similar" groups.
Revised:  Most of their properties run parallel to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism . We URLanized them in three "similar" groups.
Edit intent: coherence
Original:  Most of their properties run parallel to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism , allowing us URLanize them in three "similar" groups.
Revised:  Most of their properties run parallel to those of 3 well-studied families: elliptic billiard (confocal pair), Chapple's poristic triangles, and the Brocard porism , allowing us URLanize them in three related groups.
Edit intent: fluency
Original:  Moreover, we show the impact of CSKG as a source for reasoning evidence retrieval, and for pre-training language models for generalizable downstream reasoning . CSKG and all its embeddings are made publicly available to support further research on commonsense knowledge integration and reasoning.
Revised:  We demonstrate how CSKG can provide evidence for generalizable downstream reasoning and for pre-training language models for generalizable downstream reasoning . CSKG and all its embeddings are made publicly available to support further research on commonsense knowledge integration and reasoning.
Edit intent: clarity
Original:  Moreover, we show the impact of CSKG as a source for reasoning evidence retrieval, and for pre-training language models for generalizable downstream reasoning . CSKG and all its embeddings are made publicly available to support further research on commonsense knowledge integration and reasoning.
Revised:  Moreover, we show the impact of CSKG as a source for reasoning evidence retrieval, and for pre-training of language models . CSKG and all its embeddings are made publicly available to support further research on commonsense knowledge integration and reasoning.
Edit intent: clarity
Original:  We introduce semantic audio-visual navigation, where objects in the environment make sounds consistent with their semantic meanings (e.g., toilet flushing, door creaking) and acoustic envents are sporadic or short in duration.
Revised:  We introduce semantic audio-visual navigation, where objects in the environment make sounds consistent with their semantic meaning (e.g., toilet flushing, door creaking) and acoustic envents are sporadic or short in duration.
Edit intent: fluency
Original:  We introduce semantic audio-visual navigation, where objects in the environment make sounds consistent with their semantic meanings (e.g., toilet flushing, door creaking) and acoustic envents are sporadic or short in duration.
Revised:  We introduce semantic audio-visual navigation, where objects in the environment make sounds consistent with their semantic meanings (e.g., toilet flushing, door creaking) and acoustic events are sporadic or short in duration.
Edit intent: fluency
Original:  This view permits to define , in a single formal framework,  "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Revised:  This approach permits to specify , in a single formal framework, "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Edit intent: clarity
Original:  This view permits to define , in a single formal framework,  "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Revised:  This view permits to define , in a single formal framework, both "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Edit intent: meaning-changed
Original:  This view permits to define , in a single formal framework,  "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Revised:  This view permits to define , in a single formal framework, "pointwise" and "distributional" constraints over the target LM -- to our knowledge, the first model with such generality -- while minimizing KL divergence with the initial LM distribution.
Edit intent: clarity
Original:  This view permits to define , in a single formal framework,  "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence with the initial LM distribution.
Revised:  This view permits to define , in a single formal framework, "pointwise" and "distributional" constraints over the target LM -- to our knowledge, this is the first approach with such generality -- while minimizing KL divergence from the initial LM distribution.
Edit intent: fluency
Original:  We conduct a first set of experiments over pointwise constraints showing the advantages of our approach over a set of baselines, in terms of obtaining a controlled LM balancing constraint satisfaction with divergence from the initial LM (GPT-2) .
Revised:  We conduct a first set of experiments over pointwise constraints showing the advantages of our approach over a set of baselines, in terms of obtaining a controlled LM balancing constraint satisfaction with divergence from the initial LM .
Edit intent: clarity