wanyu/IteraTeR_v2 huggingface dataset:
Original:  Since it is impossible to test neural program analyzers on all unforeseen programs, in this paper, we propose to evaluate the generalizability of neural program analyzers with respect to semantic-preserving transformations: a generalizable neural program analyzer should perform equally well on programs that are of the same semantics but of different lexical appearances and syntactical structures.
Revised:  Since it is impossible to test neural program analyzers on all unforeseen programs, in this paper, we propose to evaluate the generalizability of neural program models with respect to semantic-preserving transformations: a generalizable neural program analyzer should perform equally well on programs that are of the same semantics but of different lexical appearances and syntactical structures.
Edit intent: clarity
Original:  Since it is impossible to test neural program analyzers on all unforeseen programs, in this paper, we propose to evaluate the generalizability of neural program analyzers with respect to semantic-preserving transformations: a generalizable neural program analyzer should perform equally well on programs that are of the same semantics but of different lexical appearances and syntactical structures.
Revised:  Since it is impossible to test neural program analyzers on all unforeseen programs, in this paper, we propose to evaluate the generalizability of neural program analyzers with respect to semantic-preserving transformations: a generalizable neural program model should perform equally well on programs that are of the same semantics but of different lexical appearances and syntactical structures.
Edit intent: clarity
Original:  More specifically, we compare the results of various neural program analyzers for the method name prediction task on programs before and after automated semantic-preserving transformations.
Revised:  We compare the results of various neural program analyzers for the method name prediction task on programs before and after automated semantic-preserving transformations.
Edit intent: coherence
Original:  More specifically, we compare the results of various neural program analyzers for the method name prediction task on programs before and after automated semantic-preserving transformations.
Revised:  More specifically, we compare the results of various neural program models for the method name prediction task on programs before and after automated semantic-preserving transformations.
Edit intent: clarity
Original:  We use three Java datasets of different sizes and three state-of-the-art neural network models for code, namely code2vec, code2seq, and Gated Graph Neural Networks (GGNN) , to build nine such neural program analyzers for evaluation.
Revised:  We use three Java datasets of different sizes and three state-of-the-art neural network models for code, namely code2vec, code2seq, and GGNN , to build nine such neural program analyzers for evaluation.
Edit intent: coherence
Original:  We use three Java datasets of different sizes and three state-of-the-art neural network models for code, namely code2vec, code2seq, and Gated Graph Neural Networks (GGNN) , to build nine such neural program analyzers for evaluation.
Revised:  We use three Java datasets of different sizes and three state-of-the-art neural network models for code, namely code2vec, code2seq, and Gated Graph Neural Networks (GGNN) , to build nine such neural program models for evaluation.
Edit intent: clarity
Original:  Our results show that even with small semantically preserving changes to the programs, these neural program analyzers often fail to generalize their performance.
Revised:  Our results show that even with small semantically preserving changes to the programs, these neural program models often fail to generalize their performance.
Edit intent: clarity
Original:  Our results also suggest that neural program analyzers based on data and control dependencies in programs generalize better than neural program analyzers based only on abstract syntax trees.
Revised:  Our results also suggest that neural program models based on data and control dependencies in programs generalize better than neural program analyzers based only on abstract syntax trees.
Edit intent: clarity
Original:  Our results also suggest that neural program analyzers based on data and control dependencies in programs generalize better than neural program analyzers based only on abstract syntax trees.
Revised:  Our results also suggest that neural program analyzers based on data and control dependencies in programs generalize better than neural program models based only on abstract syntax trees.
Edit intent: clarity
Original:  On the positive side, we observe that as the size of  training dataset grows and diversifies the generalizability of correct predictions produced by the analyzers can be improved too  .
Revised:  On the positive side, we observe that as the size of the training dataset grows and diversifies the generalizability of correct predictions produced by the analyzers can be improved too .
Edit intent: fluency
Original:  On the positive side, we observe that as the size of  training dataset grows and diversifies the generalizability of correct predictions produced by the analyzers can be improved too  .
Revised:  On the positive side, we observe that as the size of training dataset grows and diversifies the generalizability of correct predictions produced by the neural program models can be improved too .
Edit intent: clarity
Original:  A combination of a public health emergency, economic distress, and disinformation-driven panic have pushed customers and vendors towards the shadow economy.
Revised:  The combination of a public health emergency, economic distress, and disinformation-driven panic have pushed customers and vendors towards the shadow economy.
Edit intent: fluency
Original:  In particular dark web marketplaces (DWMs), commercial websites easily accessible via free software, have gained significant popularity.
Revised:  In particular Dark Web Marketplaces (DWMs), commercial websites easily accessible via free software, have gained significant popularity.
Edit intent: fluency
Original:  The combination of a public health emergency, economic distress, and disinformation-driven panic have pushed customers and vendors towards the shadow economy.
Revised:  The combination of a public health emergency, economic distress, and misinformation-driven panic have pushed customers and vendors towards the shadow economy.
Edit intent: fluency
Original:  In particular Dark Web Marketplaces (DWMs), commercial websites easily accessible via free software, have gained significant popularity.
Revised:  In particular , dark web marketplaces (DWMs), commercial websites easily accessible via free software, have gained significant popularity.
Edit intent: fluency
Original:  In particular Dark Web Marketplaces (DWMs), commercial websites easily accessible via free software, have gained significant popularity.
Revised:  In particular Dark Web Marketplaces (DWMs), commercial websites accessible via free software, have gained significant popularity.
Edit intent: clarity
Original:  We reveal how the online shadow economy has evolved during the COVID-19 pandemic and highlight the importance of a continuous monitoring of DWMs, especially when real vaccines or cures become available and are potentially in short supply.
Revised:  We reveal how the online shadow economy has evolved during the COVID-19 pandemic and highlight the importance of a continuous monitoring of DWMs, especially now that real vaccines are available and in short supply.
Edit intent: clarity
Original:  While it is conjectured that there is no "truly subquadratic '' algorithm for testing map isomorphism for unconstrained genus, we present a linear-time algorithm for computing the generators of the automorphism group of a map, parametrized by the genus of the underlying surface.
Revised:  While it is conjectured that there is no "truly subquadratic " algorithm for testing map isomorphism for unconstrained genus, we present a linear-time algorithm for computing the generators of the automorphism group of a map, parametrized by the genus of the underlying surface.
Edit intent: fluency
Original:  We prove that it is always optimal to set the reserve price to  seller's own valuation.
Revised:  We prove that it is always optimal to set the reserve price to the seller's own valuation.
Edit intent: fluency
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised:  Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Edit intent: coherence
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised: In 1962, Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side of the market has anexogenous preference order over the agents of the other side.
Edit intent: coherence
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side exogenous preference order over the agents of the other side.
Edit intent: clarity
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has an preference order over the agents of the other side.
Edit intent: clarity
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous has an exogenous preference ordering over the agents of the other side.
Edit intent: fluency
Original: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents of the other side.
Revised: In 1962, Gale and Shapley introduced a matching problem between two sets of agents M and W (men/women, students/universities, doctors/hospitals), who need to be matched by taking into account that each agent on one side of the market has anexogenous preference order over the agents on the other side.
Edit intent: fluency
Original:  They proved  the existence of a stable matching using a "deferred-acceptance" algorithm .
Revised:  They proved the existence of a stable matching .
Edit intent: clarity
Original:  Our article offers a further extension by assuming that matched couples obtain their payoff endogenously as the outcome of a strategic-form game they have to play .
Revised:  Our article offers a further extension by assuming that matched couples obtain their payoff endogenously as the outcome of a strategic-form game they have to play .
Edit intent: fluency
Original:  Our article offers a further extension by assuming that matched couples obtain their payoff endogenously as the outcome of a strategic-form game they have to play .
Revised:  Our article offers a further extension by assuming that matched couples obtain their payoff endogenously as the outcome of a strategic game they have to play .
Edit intent: clarity
Original:  A matching, together with a strategy profile, isexternally stable if no unmatched pair can form a couple and play a strategy profile in their game that Pareto improves their previous payoffs.
Revised:  A matching, together with a strategy profile, is if no unmatched pair can form a couple and play a strategy profile in their game that Pareto improves their previous payoffs.
Edit intent: clarity
Original:  It isinternally stable if no agent, by individually changing his/her strategy inside his / her couple, can increase his/her payoff without breaking the external stability of his/her couple (e.g. the partner's payoff decreases below his/her current market outside option).
Revised:  It is if no agent, by individually changing his/her strategy inside his / her couple, can increase his/her payoff without breaking the external stability of his/her couple (e.g. the partner's payoff decreases below his/her current market outside option).
Edit intent: clarity
Original:  Our model encompasses and refines  matching with monetary transfers (Shapley-Shubik 1971, Kelso-Crawford 1982, Demange-Gale 1986, Demange-Gale-Sotomayor 1986) as well as matching with contracts (Blaire 1988, Hatfield-Milgrom 2005 ).
Revised:  Our model encompasses and refines matching with monetary transfers as well as matching with contracts (Blaire 1988, Hatfield-Milgrom 2005 ).
Edit intent: clarity
Original:  Our model encompasses and refines  matching with monetary transfers (Shapley-Shubik 1971, Kelso-Crawford 1982, Demange-Gale 1986, Demange-Gale-Sotomayor 1986) as well as matching with contracts (Blaire 1988, Hatfield-Milgrom 2005 ).
Revised:  Our model encompasses and refines matching with monetary transfers (Shapley-Shubik 1971, Kelso-Crawford 1982, Demange-Gale 1986, Demange-Gale-Sotomayor 1986) as well as matching with contracts ).
Edit intent: clarity
Original: Many approaches exist for deriving a single speaker's identity information from speech by recognizing consistent characteristics of acoustic parameters.
Revised: Many approaches can derive information about a single speaker's identity information from speech by recognizing consistent characteristics of acoustic parameters.
Edit intent: clarity
Original: Many approaches exist for deriving a single speaker's identity information from speech by recognizing consistent characteristics of acoustic parameters.
Revised: Many approaches exist for deriving a single speaker's identity from the speech by learning to recognize consistent characteristics of acoustic parameters.
Edit intent: clarity
Original:  However, it is challenging to determine identity information when there are multiple concurrent speakers in a speech signal.
Revised:  However, it is challenging to determine identity information when there are multiple concurrent speakers in a given signal.
Edit intent: clarity
Original:  In this paper, we propose a novel deep speaker representation strategy that can reliably extract multiple speaker identities from  overlapped speech.
Revised:  In this paper, we propose a novel deep speaker representation strategy that can reliably extract multiple speaker identities from an overlapped speech.
Edit intent: fluency
Original:  We design a network that can extract a high-level embedding containing the identity information of each speaker from a given mixture.
Revised:  We design a network that can extract a high-level embedding that contains information about each speaker's identity from a given mixture.
Edit intent: clarity
Original:  Unlike conventional approaches that need reference acoustic features for training, our proposed algorithm only requires the speaker identity labels for the overlapped speech segments.
Revised:  Unlike conventional approaches that need reference acoustic features for training, our proposed algorithm only requires the speaker identity labels of the overlapped speech segments.
Edit intent: fluency
Original:  We demonstrate the effectiveness  of our algorithm in a speaker verification task and a speech separation system conditioned on the target speaker embeddings obtained through the proposed method.
Revised:  We demonstrate the effectiveness and usefulness of our algorithm in a speaker verification task and a speech separation system conditioned on the target speaker embeddings obtained through the proposed method.
Edit intent: clarity
Original:  In each step, the algorithm observes the sample's position and label and may update the current predictor accordingly .
Revised:  In each step, the algorithm observes the sample's position and label and updates the current predictor accordingly .
Edit intent: clarity
Original:  In presence of strategic agents , however, the classifier may not be able to observe the true position but a position where the agent pretends to be in order to be classified desirably .
Revised:  In presence of strategic agents , however, the classifier may not be able to observe the true position of agents but rather a position where the agent pretends to be in order to be classified desirably .
Edit intent: clarity
Original:  In presence of strategic agents , however, the classifier may not be able to observe the true position but a position where the agent pretends to be in order to be classified desirably .
Revised:  In presence of strategic agents , however, the classifier may not be able to observe the true position but a position where the agent pretends to be .
Edit intent: coherence
Original:  Unlike the original setting with perfect knowledge of positions, in this situation the Perceptron algorithm fails to achieve its guarantees, and we illustrate examples with the predictor oscillating between two solutions forever, never reaching a perfect classifier even though one exists.
Revised:  Unlike the original setting with perfect knowledge of positions, in this situation the Perceptron algorithm fails to achieve its guarantees, and we illustrate examples with the predictor oscillating between two solutions forever, making an unbounded number of mistakes even though a perfect large-margin linear classifier exists.
Edit intent: clarity
Original:  Our main contribution is providing a modified Perceptron-style algorithm which finds a classifier in presence of strategic agents with both \ell_2 and weighted \ell_1 manipulation costs.
Revised:  Our main contribution is providing a modified Perceptron-style algorithm which makes a bounded number of mistakes in presence of strategic agents with both \ell_2 and weighted \ell_1 manipulation costs.
Edit intent: clarity
Original: Classical iterative algorithms for linear system solving and regression are brittle to the condition number of the data matrix .
Revised: The convergence rates of iterative methods for solving a linear system A x = b typically depend on the condition number of the data matrix .
Edit intent: clarity
Original: Assessing whether a subgroup of a full population is getting treated equitably often involves assigning numerical "scores" to all individuals  such that similar individuals get similar scores;
Revised: Assessing equity in treatment of a subpopulation often involves assigning numerical "scores" to all individuals such that similar individuals get similar scores;
Edit intent: clarity
Original: Assessing whether a subgroup of a full population is getting treated equitably often involves assigning numerical "scores" to all individuals  such that similar individuals get similar scores;
Revised: Assessing whether a subgroup of a full population is getting treated equitably often involves assigning numerical "scores" to all individuals in the full population such that similar individuals get similar scores;
Edit intent: clarity
Original:  Given such scores, equitable treatment could mean that individuals with similar scores  attain similar outcomes independent of the individuals' memberships in the subgroup .
Revised:  Given such scores, individuals with similar scores attain similar outcomes independent of the individuals' memberships in the subgroup .
Edit intent: clarity
Original:  Given such scores, equitable treatment could mean that individuals with similar scores  attain similar outcomes independent of the individuals' memberships in the subgroup .
Revised:  Given such scores, equitable treatment could mean that individuals with similar scores may or may not attain similar outcomes independent of the individuals' memberships in the subgroup .
Edit intent: clarity
Original:  Given such scores, equitable treatment could mean that individuals with similar scores  attain similar outcomes independent of the individuals' memberships in the subgroup .
Revised:  Given such scores, equitable treatment could mean that individuals with similar scores attain similar outcomes independent of the individuals' memberships in the subpopulation .
Edit intent: clarity
Original:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibration plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subgroup as well as the average outcomes for all individuals in the full population ;
Revised:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibrations plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subgroup as well as the average outcomes for all individuals in the full population ;
Edit intent: fluency
Original:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibration plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subgroup as well as the average outcomes for all individuals in the full population ;
Revised:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibration plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subpopulation as well as the average outcomes for all individuals in the full population ;
Edit intent: clarity
Original:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibration plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subgroup as well as the average outcomes for all individuals in the full population ;
Revised:  The traditional graphical methods for visualizing inequities are known as "reliability diagrams" or " calibration plots," which bin the scores into a partition of all possible values, and for each bin plot both the average outcomes for only individuals in the subgroup as well as the average outcomes for all individuals ;
Edit intent: clarity