wanyu/IteraTeR_v2 huggingface dataset:
Original:  We obtain second order accuracy for solutions of a variety of equations, including surface diffusion determined by the Laplace-Beltrami operator and the shallow water equations on a sphere.
Revised:  We obtain second order accuracy in examples with a variety of equations, including surface diffusion determined by the Laplace-Beltrami operator and the shallow water equations on a sphere.
Edit intent: clarity
Original:  We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have also been implemented and tested in practice.
Revised:  We now count with several algorithms that are optimal in the worst case, and many of them have also been implemented and tested in practice.
Edit intent: clarity
Original:  We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have also been implemented and tested in practice.
Revised:  We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have been implemented and tested in practice.
Edit intent: clarity
Original:  We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have also been implemented and tested in practice.
Revised:  We now count with several different algorithms that have all been shown to be optimal in the worst case, and many of them have also been implemented and validated in practice.
Edit intent: clarity
Original:  In this paper we show that optimal algorithms can be obtained directly from a representation that regards the relations as point sets in variable-dimensional grids, without the need of extra storage.
Revised:  We show that optimal algorithms can be obtained directly from a representation that regards the relations as point sets in variable-dimensional grids, without the need of extra storage.
Edit intent: coherence
Original:  Our representation is a compact quadtree for the static indexes  and a dynamic quadtree sharing subtrees (which we dub a Qdag ) for intermediate results.
Revised:  Our representation is a compact quad tree for the static indexes and a dynamic quadtree sharing subtrees (which we dub a Qdag ) for intermediate results.
Edit intent: fluency
Original:  Our representation is a compact quadtree for the static indexes  and a dynamic quadtree sharing subtrees (which we dub a Qdag ) for intermediate results.
Revised:  Our representation is a compact quadtree for the static indexes , and a dynamic quadtree sharing subtrees (which we dub a Qdag ) for intermediate results.
Edit intent: fluency
Original:  Our representation is a compact quadtree for the static indexes  and a dynamic quadtree sharing subtrees (which we dub a Qdag ) for intermediate results.
Revised:  Our representation is a compact quadtree for the static indexes and a dynamic quadtree sharing subtrees (which we dub a qdag ) for intermediate results.
Edit intent: fluency
Original:  We develop a compositional algorithm to process full join queries when data is stored in said structures, and then show that the running time of this algorithm is worst-case optimal in data complexity.
Revised:  We develop a compositional algorithm to process full join queries under this representation, and show that the running time of this algorithm is worst-case optimal in data complexity.
Edit intent: clarity
Original:  Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Revised:  Remarkably, we can extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Edit intent: coherence
Original:  Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Revised:  Remarkably, we can even extend our framework to evaluate more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Edit intent: clarity
Original:  Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Revised:  Remarkably, we can even extend our framework to compute more expressive queries from relational algebra by introducing a lazy version of Qdags .
Edit intent: coherence
Original:  Although Persian is a language with more than 110 million speakers, to the best of our knowledge, there is not any public dataset on aspect-based sentiment analysis in Persian.
Revised:  Although Persian is a language with more than 110 million speakers, to the best of our knowledge, there is a lack of public dataset on aspect-based sentiment analysis in Persian.
Edit intent: clarity
Original:  Although Persian is a language with more than 110 million speakers, to the best of our knowledge, there is not any public dataset on aspect-based sentiment analysis in Persian.
Revised:  Although Persian is a language with more than 110 million speakers, to the best of our knowledge, there is not any public dataset on aspect-based sentiment analysis for Persian.
Edit intent: clarity
Original:  The dataset consists of 5114 positive, 3061 negative and 1827 neutral data samples from 5602 unique reviews.
Revised:  The dataset consists of 5114 positive, 3061 negative and 1827 neutral data samples from 5,602 unique reviews.
Edit intent: style
Original: Electronic health record (EHR) data contains most of the important patient health information and is typically stored in a relational database with multiple tables.
Revised: Electronic medical records (EMR) contain comprehensive patient information and are typically stored in a relational database with multiple tables.
Edit intent: clarity
Original:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate  SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Revised:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL (TREQS) , which adopts the sequence-to-sequence model to directly generate SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Edit intent: fluency
Original:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate  SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Revised:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) generation, which adapts the widely used sequence-to-sequence model to directly generate SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Edit intent: clarity
Original:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate  SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Revised:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate the SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Edit intent: fluency
Original:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate  SQL query for a given question, and further edits it with an attentive-copying mechanism and task-specific look-up tables.
Revised:  To address the challenge of generating queries on multi-relational databases from natural language questions, we propose a TRanslate-Edit Model for Question-to-SQL query (TREQS) , which adopts the sequence-to-sequence model to directly generate SQL query for a given question, and further performs the required edits using an attentive-copying mechanism and task-specific look-up tables.
Edit intent: clarity
Original: The paperpresents circuit solutions based on a switch element with  S-type I-V characteristic implemented on the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Revised: In this paper, we present circuit solutions based on a switch element with S-type I-V characteristic implemented on the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Edit intent: fluency
Original: The paperpresents circuit solutions based on a switch element with  S-type I-V characteristic implemented on the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Revised: The paperpresents circuit solutions based on a switch element with the S-type I-V characteristic implemented on the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Edit intent: fluency
Original: The paperpresents circuit solutions based on a switch element with  S-type I-V characteristic implemented on the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Revised: The paperpresents circuit solutions based on a switch element with S-type I-V characteristic implemented using the classic FitzHugh-Nagumo and FitzHugh-Rinzel models.
Edit intent: fluency
Original:  Proposed simplified electrical circuits allow modeling the integrate-and-fire neuron and burst oscillation mode with emulation of mammalian cold receptor patterns.
Revised:  Using the proposed simplified electrical circuits allow modeling the integrate-and-fire neuron and burst oscillation mode with emulation of mammalian cold receptor patterns.
Edit intent: coherence
Original:  Proposed simplified electrical circuits allow modeling the integrate-and-fire neuron and burst oscillation mode with emulation of mammalian cold receptor patterns.
Revised:  Proposed simplified electrical circuits allows the modeling of the integrate-and-fire neuron and burst oscillation mode with emulation of mammalian cold receptor patterns.
Edit intent: fluency
Original:  Proposed simplified electrical circuits allow modeling the integrate-and-fire neuron and burst oscillation mode with emulation of mammalian cold receptor patterns.
Revised:  Proposed simplified electrical circuits allow modeling the integrate-and-fire neuron and burst oscillation modes with the emulation of the mammalian cold receptor patterns.
Edit intent: fluency
Original:  The circuits are studied using experimental I-V characteristic of an NbO2 switch with a stable section of negative differential resistance (NDR) and a VO2 switch with an unstable NDR, considering the temperature dependences of the threshold characteristics.
Revised:  The circuits were studied using the experimental I-V characteristic of an NbO2 switch with a stable section of negative differential resistance (NDR) and a VO2 switch with an unstable NDR, considering the temperature dependences of the threshold characteristics.
Edit intent: fluency
Original:  The proposed systems of differential equations with  piecewise linear approximation of the S-type I-V characteristic may be of scientific interest for further analytical and numerical research and development of neural networks with artificial intelligence.
Revised:  The proposed systems of differential equations with the piecewise linear approximation of the S-type I-V characteristic may be of scientific interest for further analytical and numerical research and development of neural networks with artificial intelligence.
Edit intent: fluency
Original:  And moreover , for further maintaining the statistical undetectability of the stego, an exponential model is then introduced to facilitate the construction of domain transformation function.
Revised:  Moreover , for further maintaining the statistical undetectability of the stego, an exponential model is then introduced to facilitate the construction of domain transformation function.
Edit intent: coherence
Original:  With the aid of the proposed domain transformation function , the JPEG embedding cost can be easily obtained through weighting the spatial embedding costs by the spatial embedding changes .
Revised:  Then , the JPEG embedding cost can be easily obtained through weighting the spatial embedding costs by the spatial embedding changes .
Edit intent: clarity
Original:  Experimental results show that the proposed BCT has a more comprehensive performance improvement than UERD with the same computational complexity, and is superior to  J-UNIWARD  and GUED in resisting the detection of  GFR and SCA-GFR . In addition, it can also rival BET with an order of magnitude lower computational complexity  .
Revised:  Experimental results show that the proposed BCT has a more comprehensive performance improvement than UERD with the same computational complexity, and is superior to J-UNIWARD , and GUED in resisting the detection of GFR and SCA-GFR . In addition, it can also rival BET with an order of magnitude lower computational complexity .
Edit intent: fluency
Original:  This notion of conjugation even yields a more general Fenchel conjugate for the case where the manifold is a vector space.
Edit intent: coherence
Original:  We investigate its properties, e.g., the Fenchel-Young inequality and the characterization of the convex subdifferential using the analogue of the Fenchel-Moreau Theorem.
Revised:  We investigate its properties, e.g., ~the Fenchel--Young inequality and the characterization of the convex subdifferential using the analogue of the Fenchel-Moreau Theorem.
Edit intent: fluency
Original:  We investigate its properties, e.g., the Fenchel-Young inequality and the characterization of the convex subdifferential using the analogue of the Fenchel-Moreau Theorem.
Revised:  We investigate its properties, e.g., the Fenchel-Young inequality and the characterization of the convex subdifferential using the analogue of the Fenchel--Moreau Theorem.
Edit intent: fluency
Original:  Numerical results illustrate the performance of the algorithm, which competes with the recently derived Douglas-Rachford algorithm on manifolds of nonpositive curvature.
Revised:  Numerical results illustrate the performance of the algorithm, which competes with the recently derived Douglas--Rachford algorithm on manifolds of nonpositive curvature.
Edit intent: fluency
Original:  Furthermore  we show numerically that our novel algorithm even converges on manifolds of positive curvature.
Revised:  Furthermore , we show numerically that our novel algorithm even converges on manifolds of positive curvature.
Edit intent: fluency
Original: Generation of hybrid synthetic data resembling real data to some criteria is an important methodological and thematic issue in most disciplines which study complex systems .
Revised: The generation of synthetic data is an essential tool to study complex systems .
Edit intent: clarity
Original: We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and eval for the execution of programs dynamically generated by the code manipulation.
Revised: We study a dependently typed extension of a multi-stage programming language \`a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and eval for the execution of programs dynamically generated by the code manipulation.
Edit intent: fluency
Original: We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and eval for the execution of programs dynamically generated by the code manipulation.
Revised: We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and an evaluation construct for execution of programs dynamically generated by the code manipulation.
Edit intent: clarity
Original: We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and eval for the execution of programs dynamically generated by the code manipulation.
Revised: We study a dependently typed extension of a multi-stage programming language a la MetaOCaml, which supports quasi-quotation and cross-stage persistence for manipulation of code fragments as first-class values and eval for the execution of programs dynamically generated by this code manipulation.
Edit intent: fluency
Original:  Dependent types are expected to bring to multi-stage programming enforcement of strong invariants---beyond simple type safety---on the behavior of dynamically generated code.
Revised:  Dependent types are expected to bring to multi-stage programming enforcement of strong invariant---beyond simple type safety---on the behavior of dynamically generated code.
Edit intent: fluency
Original:  An extension is, however, not trivial because  a type system would have to take stages---roughly speaking, the number of surrounding quotations---of types into account.
Revised:  An extension is, however, not trivial because such a type system would have to take stages---roughly speaking, the number of surrounding quotations---of types into account.
Edit intent: clarity
Original:  An extension is, however, not trivial because  a type system would have to take stages---roughly speaking, the number of surrounding quotations---of types into account.
Revised:  An extension is, however, not trivial because a type system would have to take stages of types ---roughly speaking, the number of surrounding quotations---of types into account.
Edit intent: fluency
Original:  An extension is, however, not trivial because  a type system would have to take stages---roughly speaking, the number of surrounding quotations---of types into account.
Revised:  An extension is, however, not trivial because a type system would have to take stages---roughly speaking, the number of surrounding quotations---into account.
Edit intent: clarity
Original:  To rigorously study properties of such an extension, we develop lambda ^{MD}, which is an extension of Hanada and Igarashi's typed calculus lambda ^{\triangleright\\%} with dependent types, and prove its properties including preservation, confluence, strong normalization for full reduction, and progress for staged reduction.
Revised:  To rigorously study properties of such an extension, we develop \lambda ^{MD}, which is an extension of Hanada and Igarashi's typed calculus lambda ^{\triangleright\\%} with dependent types, and prove its properties including preservation, confluence, strong normalization for full reduction, and progress for staged reduction.
Edit intent: fluency
Original:  Motivated by code generators such that the type of generated code depends on a value from outside of  quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalence that is not directly derived from reduction rules.
Revised:  Motivated by code generators that generate code whose type depends on a value from outside of quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalence that is not directly derived from reduction rules.
Edit intent: clarity
Original:  Motivated by code generators such that the type of generated code depends on a value from outside of  quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalence that is not directly derived from reduction rules.
Revised:  Motivated by code generators such that the type of generated code depends on a value from outside of the quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalence that is not directly derived from reduction rules.
Edit intent: fluency
Original:  Motivated by code generators such that the type of generated code depends on a value from outside of  quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalence that is not directly derived from reduction rules.
Revised:  Motivated by code generators such that the type of generated code depends on a value from outside of quotations, we argue the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalences that are not directly derived from reduction rules.
Edit intent: fluency
Original:  Dependent types are expected to bring to multi-stage programming enforcement of strong invariant---beyond simple type safety---on the behavior of dynamically generated code.
Revised:  Dependent types are expected to bring to multi-stage programming enforcement of strong invariant -- beyond simple type safety -- on the behavior of dynamically generated code.
Edit intent: fluency
Original:  An extension is, however, not trivial because such a type system would have to take stages of types ---roughly speaking, the number of surrounding quotations---into account.
Revised:  An extension is, however, not trivial because such a type system would have to take stages of types -- roughly speaking, the number of surrounding quotations---into account.
Edit intent: fluency
Original:  An extension is, however, not trivial because such a type system would have to take stages of types ---roughly speaking, the number of surrounding quotations---into account.
Revised:  An extension is, however, not trivial because such a type system would have to take stages of types ---roughly speaking, the number of surrounding quotations -- into account.
Edit intent: fluency
Original:  WSEmail offers an alternative vision of how IM and email services could have evolved, offering security, extensibility, and openness in a distributed environment instead of the hardened walled gardens that today's rich messaging systems have become.
Revised:  WSEmail offers an alternative vision of how instant messaging and email services could have evolved, offering security, extensibility, and openness in a distributed environment instead of the hardened walled gardens that today's rich messaging systems have become.
Edit intent: clarity
Original:  We demonstrate the flexibility of WSEmail using three business use cases: secure channel IM , business workflows with routed forms, and on-demand attachments.
Revised:  We demonstrate the flexibility of WSEmail using three business use cases: secure channel instant messaging , business workflows with routed forms, and on-demand attachments.
Edit intent: clarity
Original:  We also provide performance measures for the basic WSEmail functions in a prototype we implemented using .
Revised:  We provide performance measurements for WSEmail functions in a prototype we implemented using .
Edit intent: clarity