wanyu/IteraTeR_full_sent huggingface dataset:
Original:   ]  ]  Our algorithms are based on the idea of using recursion as in Savitch's theorem \mbox{%DIFAUXCMD \cite{Savitch70}\hspace{0pt}%DIFAUXCMD }  , and a careful modification of previous techniques to make the recursion work.
Revised:  ] ] Our algorithms are based on the idea of using recursion as in Savitch's theorem }\hspace{0pt}%DIFAUXCMD } , and a careful modification of previous techniques to make the recursion work.
Edit intent: coherence
Original:   ]  ]  Our algorithms are based on the idea of using recursion as in Savitch's theorem \mbox{%DIFAUXCMD \cite{Savitch70}\hspace{0pt}%DIFAUXCMD }  , and a careful modification of previous techniques to make the recursion work.
Revised:  ] ] Our algorithms are based on the idea of using recursion as in Savitch's theorem \mbox{%DIFAUXCMD \cite{Savitch70}\hspace{0pt}%DIFAUXCMD } Sav70 , and a careful modification of previous techniques to make the recursion work.
Edit intent: meaning-changed
Original:   ]  ]  Our algorithms are based on the idea of using recursion as in Savitch's theorem \mbox{%DIFAUXCMD \cite{Savitch70}\hspace{0pt}%DIFAUXCMD }  , and a careful modification of previous techniques to make the recursion work.
Revised:  ] ] Our algorithms are based on the idea of using recursion as in Savitch's theorem \mbox{%DIFAUXCMD \cite{Savitch70}\hspace{0pt}%DIFAUXCMD } , and a careful adaption of previous techniques to make the recursion work.
Edit intent: clarity
Original: We propose FrameAxis, a method of characterizing the framing of a given text by identifying the most relevant semantic axes ("microframes") defined by antonym word pairs .
Revised: Framing is a process of emphasizing a certain aspect of an issue over the others, nudging readers or listeners towards different positions on the issue even without making a biased argument. Here, we propose FrameAxis, a method of characterizing the framing of a given text by identifying the most relevant semantic axes ("microframes") defined by antonym word pairs .
Edit intent: coherence
Original:  In contrast to the traditional framing analysis, which has been constrained by a small number of manually annotated general frames, our unsupervised approach provides much more detailed insights , by considering a host of semantic axes.
Revised:  In contrast to the traditional framing analysis, which tends to be constrained by a small number of manually annotated general frames, our unsupervised approach provides much more detailed insights , by considering a host of semantic axes.
Edit intent: clarity
Original:  In contrast to the traditional framing analysis, which has been constrained by a small number of manually annotated general frames, our unsupervised approach provides much more detailed insights , by considering a host of semantic axes.
Revised:  In contrast to the traditional framing analysis, which has been constrained by a small number of manually annotated general frames, our unsupervised approach can be readily applied to large datasets because it does not require manual annotations. It can also provide more nuanced insights by considering a host of semantic axes.
Edit intent: meaning-changed
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is designed to quantitatively tease out two important dimensions of framing: -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Edit intent: clarity
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is capable of quantitatively teasing out framing biasframing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Edit intent: meaning-changed
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is capable of quantitatively teasing out framing bias -- how biased an argument is -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Edit intent: clarity
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Edit intent: clarity
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{framing intensity -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Edit intent: meaning-changed
Original:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing.
Revised:  Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \textit{ -- how much a particular aspect over another is highlighted -- from the text, offering a nuanced characterization of framing.
Edit intent: clarity
Original:  We evaluate our approach using SemEval datasets as well as three other datasets and human evaluations, demonstrating that FrameAxis can reliably characterize documents with relevant microframes .
Revised:  We demonstrate how FrameAxis successfully captures framing bias and intensity in a variety of text data from restaurant reviews to news media. The existing domain knowledge can be directly incorporated into FrameAxis by guiding candidate microframes to test and fine-tune automatically discovered microframes. We propose methods for explaining the results of FrameAxis at the level of individual words and documents.
Edit intent: meaning-changed
Original: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Revised: Towards the realization of a sustainable, fair and inclusive society, we proposed a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Edit intent: fluency
Original: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Revised: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism . We proposed a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Edit intent: coherence
Original: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Revised: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function that increases with actions and social norm function decreasing with actions.
Edit intent: clarity
Original: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions.
Revised: Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function that decreases with actions.
Edit intent: clarity
Original:  Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions , and elucidate the interaction between the both functions to lead actions from current to target .
Revised:  Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions and elucidate the interaction between the both functions to lead actions from current to target .
Edit intent: fluency
Original:  Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions , and elucidate the interaction between the both functions to lead actions from current to target .
Revised:  Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions , and elucidate the interaction between the both functions that led from current status to target actions .
Edit intent: clarity
Original:  Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis , and intervention of social systems (individual action, inter-individual interaction, and institution) by IT systems.
Revised:  Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis and intervention of social systems (individual action, inter-individual interaction, and institution) by IT systems.
Edit intent: fluency
Original:  Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis , and intervention of social systems (individual action, inter-individual interaction, and institution) by IT systems.
Revised:  Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis , and intervention of social systems by IT systems.
Edit intent: clarity
Original: Graph clustering objective functions with tunable resolution parameters make it possible to detect different types of clustering structure in the same graph. These objectives also provide a unifying view of other non-parametric objectives, which often can be captured as special cases.
Revised: Motivated by applications in community detection and dense subgraph discovery, we consider new clustering objectives in hypergraphs and bipartite graphs. These objectives are parameterized by one or more resolution parameters in order to enable diverse knowledge discovery in complex data. For both hypergraph and bipartite objectives, which often can be captured as special cases.
Edit intent: meaning-changed
Original:  These objectives also provide a unifying view of other non-parametric objectives, which often can be captured as special cases. Previous research has largely focused on parametric objectives for standard graphs, in which all nodes are of the same type, and edges model pairwise relationships. In our work, we introduced parameterized objective functions and approximation algorithms specifically for clustering bipartite graphs and hypergraphs, based on correlation clustering. This enables us to develop principled approaches for clustering datasets with different node types (bipartite graphs) or multiway relationships (hypergraphs). Our hypergraph objective is related to higher-order notions of modularity and normalized cut , and is amenable to approximation algorithms via hypergraph expansion techniques.
Revised:  These objectives also provide a unifying view of other non-parametric objectives, we identify parameter regimes that are equivalent to existing objectives and share their (polynomial-time) approximation algorithms. We first show that our parameterized hypergraph correlation clustering objective is related to higher-order notions of modularity and normalized cut , and is amenable to approximation algorithms via hypergraph expansion techniques.
Edit intent: coherence
Original:  Our bipartite objective generalizes standard  bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques.
Revised:  Our parameterized bipartite correlation clustering objective generalizes standard bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques.
Edit intent: clarity
Original:  Our bipartite objective generalizes standard  bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques.
Revised:  Our bipartite objective generalizes standard unweighted bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques.
Edit intent: meaning-changed
Original:  Our bipartite objective generalizes standard  bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques. The problem in general is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem , meaning that it is polynomial timesolvable in this regime .
Revised:  Our bipartite objective generalizes standard bipartite correlation clustering, as well as bicluster deletion. For a certain choice of parameters it is also related to our hypergraph objective. Although in general it is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem , meaning that it is polynomial timesolvable in this regime .
Edit intent: meaning-changed
Original:  The problem in general is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem , meaning that it is polynomial timesolvable in this regime .
Revised:  The problem in general is NP-hard, we highlight a parameter regime for the bipartite objective where the problem reduces to the bipartite matching problem , meaning that it is polynomial timesolvable in this regime .
Edit intent: meaning-changed
Original:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in  product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Revised:  This includes clustering bipartite graphs across a range of parameters, detecting motif-rich clusters in an email network based on higher-order motif structure, detecting clusters of retail products in product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Edit intent: clarity
Original:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in  product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Revised:  This includes clustering a food web and an email network and a food web, and forming clusters of retail products in product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Edit intent: clarity
Original:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in  product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Revised:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in a product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Edit intent: fluency
Original:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in  product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .
Revised:  This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in product review hypergraph, that are highly correlated with known product categories .
Edit intent: meaning-changed
Original:  We prove that finding the optimal advertising strategy is hard, even in the simple case that the buyer typeis known. Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function  . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve  the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Revised:  We study the problem in two settings. 1. The seller targets the buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Edit intent: meaning-changed
Original:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function  . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve  the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Revised:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function , which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Edit intent: meaning-changed
Original:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function  . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve  the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Revised:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Edit intent: clarity
Original:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function  . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve  the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases).
Revised:  Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve the optimal mechanism by a convex program ( of exponential size in general, polynomial size for special cases).
Edit intent: clarity
Original: When selling information , sometimes the seller can increase the revenue by giving away some partial information to change the buyers'belief about the information product, so the buyers may be more willing to purchase. This work studies the general problem of advertising information products by revealing some partial information.
Revised: When selling information , sometimes the seller can increase the revenue by giving away some partial information to change the buyers'belief about the information product, so the general problem of advertising information products by revealing some partial information.
Edit intent: clarity
Original:  In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function, which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program (of exponential size in general, polynomial size for special cases).
Revised:  In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a simple function. The function is a product of two quantities, the likelihood ratio and the cost of uncertainty . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program (of exponential size in general, polynomial size for special cases).
Edit intent: meaning-changed