wanyu/IteraTeR_v2 huggingface dataset:
Original:  Unlike similar efforts in end-to-end training of semantic parser , Neural Enquirer is fully neuralized : it not only gives distributional representation of the query and the knowledge-base, but also realizes the execution of compositional queries as a series of differentiable operations, with intermediate results (consisting of annotations of the tables at different levels) saved on multiple layers of memory.
Revised:  Unlike similar efforts in end-to-end training of semantic parsers , Neural Enquirer is fully neuralized : it not only gives distributional representation of the query and the knowledge-base, but also realizes the execution of compositional queries as a series of differentiable operations, with intermediate results (consisting of annotations of the tables at different levels) saved on multiple layers of memory.
Edit intent: clarity
Original:  Unlike similar efforts in end-to-end training of semantic parser , Neural Enquirer is fully neuralized : it not only gives distributional representation of the query and the knowledge-base, but also realizes the execution of compositional queries as a series of differentiable operations, with intermediate results (consisting of annotations of the tables at different levels) saved on multiple layers of memory.
Revised:  Unlike similar efforts in end-to-end training of semantic parser , Neural Enquirer is fully "neuralized" : it not only gives distributional representation of the query and the knowledge-base, but also realizes the execution of compositional queries as a series of differentiable operations, with intermediate results (consisting of annotations of the tables at different levels) saved on multiple layers of memory.
Edit intent: clarity
Original: Routine public health surveillance of notifiable infectious diseases gives rise to weekly counts of reported cases - possibly stratified by region and/or age group.
Revised: Routine public health surveillance of notifiable infectious diseases gives rise to weekly counts of reported cases -- possibly stratified by region and/or age group.
Edit intent: fluency
Original:  The approachis illustrated in a case study on norovirus gastroenteritis in Berlin, 2011-2014, by age group, city district and week, using additional contact data from the POLYMOD survey .
Revised:  The approachis illustrated in a case study on norovirus gastroenteritis in Berlin, 2011-2014, by age group, city district and week, using additional contact data from the POLYMOD study .
Edit intent: clarity
Original: Network inference is advancing rapidly , and new methods are proposed on a regular basis.
Revised: Network inference is a rapidly advancing field, with new methods being proposed on a regular basis.
Edit intent: clarity
Original:  Historically, every new methodology has only been tested against "gold standard" (true-values  ) purpose-designed synthetic and real-world (validated) biological networks.
Revised:  Historically, every new methodology has only been tested against gold standard ) purpose-designed synthetic and real-world (validated) biological networks.
Edit intent: clarity
Original:  In this paper we aim to assess the impact of taking into consideration topological and information-theoretic complexity aspects in the evaluation of the final accuracy of an inference procedure.
Revised:  In this paper we aim to assess the impact of taking into consideration aspects of topological and information content in the evaluation of the final accuracy of an inference procedure.
Edit intent: clarity
Original:  New methods for performance comparison are introduced by borrowing ideas from gene set enrichment analysis and by applying concept from algorithmic complexity.
Revised:  New methods for performance comparison are introduced by borrowing ideas from gene set enrichment analysis and by applying concepts from algorithmic complexity.
Edit intent: fluency
Original:  Therefore special care should be taken to suit the method used to the specific purpose .
Revised:  Therefore special care should be taken to suit the method to the purpose at hand .
Edit intent: clarity
Original:  Finally, we show that evaluations from data generated representing different underlying topologies have different signatures that can be used to better choose a network reconstruction method.
Revised:  Finally, we show that evaluations from data generated using different underlying topologies have different signatures that can be used to better choose a network reconstruction method.
Edit intent: clarity
Original:  We show that the corresponding width parameter mw(G), the medianwidth of G, is equal to the clique number of the graph, while a suitable variation of it is equal to the chromatic number of G. We study in detail the i-medianwidth mw_i(G) of a graph, where we do not allow the underlying median graph of a decomposition to contain i +1-dimensional hypercubes as induced subgraphs, For i\geq 1, the parameters mw_i constitute a hierarchy starting from treewidth and converging to the clique number.
Revised:  We show that the corresponding width parameter mw(G), the medianwidth of G, is equal to the clique number of the graph, while a suitable variation of it is equal to the chromatic number of G. We study in detail the i-medianwidth mw_i(G) of a graph, for which we restrict the underlying median graph of a decomposition to contain i +1-dimensional hypercubes as induced subgraphs, For i\geq 1, the parameters mw_i constitute a hierarchy starting from treewidth and converging to the clique number.
Edit intent: clarity
Original:  Our investigations show that the brands are using Twitter and Instagram in a distinctive manner .
Revised:  Our investigations show that the brands are using Twitter and Instagram .
Edit intent: clarity
Original: We  prove that f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1) is an upper bound on the state complexity of the shuffle operation on two regular languages having the same alphabet and state complexities m and n, respectively.
Revised: We prove that f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1) is an upper bound on the state complexity of the shuffle of two regular languages having the same alphabet and state complexities m and n, respectively.
Edit intent: clarity
Original:  We also state partial results about the tightness of this bound : We show that there exist witness languages meeting the bound for every\le m\le 5 and any n\ge2 , and also for m=n=6.
Revised:  We also state partial results about the tightness of this bound . We show that there exist witness languages meeting the bound for every\le m\le 5 and any n\ge2 , and also for m=n=6.
Edit intent: fluency
Original:  We also state partial results about the tightness of this bound : We show that there exist witness languages meeting the bound for every\le m\le 5 and any n\ge2 , and also for m=n=6.
Revised:  We also state partial results about the tightness of this bound : We show that there exist witness languages meeting the bound for every\le m\le 5 and n\ge2 , and also for m=n=6.
Edit intent: clarity
Original:  We also state partial results about the tightness of this bound : We show that there exist witness languages meeting the bound for every\le m\le 5 and any n\ge2 , and also for m=n=6.
Revised:  We also state partial results about the tightness of this bound : We show that there exist witness languages meeting the bound for every\le m\le 5 and any n\ge2 , and also if m=n=6.
Edit intent: clarity
Original:  We know that an alphabet of size at least mn is required (provided m,n \ge 2).
Revised:  We know that an alphabet of size at least mn is required provided that m,n \ge 2).
Edit intent: clarity
Original:  We know that an alphabet of size at least mn is required (provided m,n \ge 2).
Revised:  We know that an alphabet of size at least mn is required (provided m,n \ge 2.
Edit intent: fluency
Original:  The model that in general describes the observed degrees best is a three-parameter generalized Weibull (also known as a stretched exponential) distribution .
Revised:  A three-parameter generalized Weibull (also known as a stretched exponential) distribution .
Edit intent: clarity
Original: We present a polynomial time randomized algorithm for reconstructing \Sigma\Pi\Sigma(2) circuits over \mathbb{R , i.e. depth 3 circuits with fan in 2 at the top addition gate and having real coefficients .
Revised: We present a polynomial time randomized algorithm for reconstructing \Sigma\Pi\Sigma(2) circuits over \mathbb{R , i.e. depth-3 circuits with fan-in 2 at the top addition gate and having real coefficients .
Edit intent: fluency
Original:  The algorithm needs only a blackbox query access to the polynomial f \in \mathbb{R[x_1,\ldots,x_n] } [x_1,\ldots, x_n] } of degree d in n variables , computable by a \Sigma\Pi\Sigma(2) circuit C.
Revised:  The algorithm needs only a blackbox query access to the polynomial f \in \mathbb{R[x_1,\ldots,x_n] } [x_1,\ldots, x_n] } of degree d , computable by a \Sigma\Pi\Sigma(2) circuit C.
Edit intent: clarity
Original:  In addition, we assume that the simple rank of this polynomial (essential number of variables after removing the gcd of the two multiplication gates) is bigger than a fixed constant.
Revised:  In addition, we assume that "simple rank" of this polynomial (essential number of variables after removing the gcd of the two multiplication gates) is bigger than a fixed constant.
Edit intent: fluency
Original:  In addition, we assume that the simple rank of this polynomial (essential number of variables after removing the gcd of the two multiplication gates) is bigger than a fixed constant.
Revised:  In addition, we assume that the simple rank of this polynomial (essential number of variables after removing gcd of the two multiplication gates) is bigger than a fixed constant.
Edit intent: fluency
Original:  In addition, we assume that the simple rank of this polynomial (essential number of variables after removing the gcd of the two multiplication gates) is bigger than a fixed constant.
Revised:  In addition, we assume that the simple rank of this polynomial (essential number of variables after removing the gcd of the two multiplication gates) is bigger than a constant.
Edit intent: clarity
Original:   ] ]. Their reconstruction algorithm uses lower bounds on the lengths of Linear Locally Decodable Codes with 2 queries.
Revised:  24] ]. Their reconstruction algorithm uses lower bounds on the lengths of Linear Locally Decodable Codes with 2 queries.
Edit intent: fluency
Original:  ( [3] ) to find a small collection of nice subspaces to project onto.
Revised:  [3] ) to find a small collection of nice subspaces to project onto.
Edit intent: fluency
Original:  ( [3] ) to find a small collection of nice subspaces to project onto.
Revised:  ( [3] to find a small collection of nice subspaces to project onto.
Edit intent: fluency
Original:  ( [3] ) to find a small collection of nice subspaces to project onto.
Revised:  ( [3] ) to find a small collection of subspaces to project onto.
Edit intent: clarity
Original:  The heart of our paper lies in subtle applications of the Quantitative Sylvester Gallai theorems to prove why projections w.r.t. the nice subspaces can be glued .
Revised:  The heart of our paper lies in subtle applications of Quantitative Sylvester Gallai theorems to prove why projections w.r.t. the nice subspaces can be glued .
Edit intent: fluency
Original:  The heart of our paper lies in subtle applications of the Quantitative Sylvester Gallai theorems to prove why projections w.r.t. the nice subspaces can be glued .
Revised:  The heart of our paper lies in subtle applications of the Quantitative Sylvester Gallai theorems to prove why projections w.r.t. these subspaces can be glued .
Edit intent: clarity
Original:  We also use Brills Equations( 8%DIFDELCMD < ]%%% ) to construct a small set of candidate linear forms (containing linear forms from both gates).
Revised:  We also use Brills Equations( %DIFDELCMD < ]%%% ) to construct a small set of candidate linear forms (containing linear forms from both gates).
Edit intent: clarity
Original: Judgements about personality based on facial appearance are strong effectors in social decision making  and are known to  impact on areas from presidential elections to jury decisions.
Revised: Judgments about personality based on facial appearance are strong effectors in social decision making and are known to impact on areas from presidential elections to jury decisions.
Edit intent: fluency
Original: Judgements about personality based on facial appearance are strong effectors in social decision making  and are known to  impact on areas from presidential elections to jury decisions.
Revised: Judgements about personality based on facial appearance are strong effectors in social decision making , and are known to impact on areas from presidential elections to jury decisions.
Edit intent: fluency
Original: Judgements about personality based on facial appearance are strong effectors in social decision making  and are known to  impact on areas from presidential elections to jury decisions.
Revised: Judgements about personality based on facial appearance are strong effectors in social decision making and are known to have impact on areas from presidential elections to jury decisions.
Edit intent: clarity
Original:  The most successful of these approaches requires face images expertly annotated with key facial landmarks.
Revised:  The most successful of these approaches require face images expertly annotated with key facial landmarks.
Edit intent: fluency
Original:  We demonstrate a Convolutional Neural Network (CNN) model that is able  perform the same task without the need for landmark features  thereby greatly increasing efficiency.
Revised:  We demonstrate a Convolutional Neural Network (CNN) model that is able to perform the same task without the need for landmark features thereby greatly increasing efficiency.
Edit intent: fluency
Original:  We demonstrate a Convolutional Neural Network (CNN) model that is able  perform the same task without the need for landmark features  thereby greatly increasing efficiency.
Revised:  We demonstrate a Convolutional Neural Network (CNN) model that is able perform the same task without the need for landmark features , thereby greatly increasing efficiency.
Edit intent: fluency
Original:  The model has high accuracy, surpassing human level performance in some cases.
Revised:  The model has high accuracy, surpassing human-level performance in some cases.
Edit intent: fluency
Original:  Furthermore, we use a deconvolutional approach to visualize important features for perception of 22 attributes and show that these can be described as a composites of their positive and negative components by separately visualizing both .
Revised:  Furthermore, we use a deconvolutional approach to visualize important features for perception of 22 attributes and demonstrate a new method for separately visualizing positive and negative components by separately visualizing both .
Edit intent: clarity
Original:  Furthermore, we use a deconvolutional approach to visualize important features for perception of 22 attributes and show that these can be described as a composites of their positive and negative components by separately visualizing both .
Revised:  Furthermore, we use a deconvolutional approach to visualize important features for perception of 22 attributes and show that these can be described as a composites of their positive and negative features .
Edit intent: clarity
Original: Experiments that study neural encoding of stimuli at the level of individual neurons typically choose a small set of features present in the world --- contrast and luminance for vision, pitch and intensity for sound --- and assemble a stimulus set that systematically (and preferably exhaustively) varies along these dimensions.
Revised: Experiments that study neural encoding of stimuli at the level of individual neurons typically choose a small set of features present in the world --- contrast and luminance for vision, pitch and intensity for sound --- and assemble a stimulus set that systematically varies along these dimensions.
Edit intent: clarity
Original:  Unfortunately, for domains as complex as social interaction or natural movement,  the relevant feature space is poorly understood, and an arbitrary a priori choice of feature sets may give rise to confirmation bias.
Revised:  For domains as complex as social interaction or natural movement, the relevant feature space is poorly understood, and an arbitrary a priori choice of feature sets may give rise to confirmation bias.
Edit intent: coherence
Original:  Unfortunately, for domains as complex as social interaction or natural movement,  the relevant feature space is poorly understood, and an arbitrary a priori choice of feature sets may give rise to confirmation bias.
Revised:  Unfortunately, for domains as complex as social interaction or natural movement, however, the relevant feature space is poorly understood, and an arbitrary a priori choice of feature sets may give rise to confirmation bias.
Edit intent: coherence
Original:  Unfortunately, for domains as complex as social interaction or natural movement,  the relevant feature space is poorly understood, and an arbitrary a priori choice of feature sets may give rise to confirmation bias.
Revised:  Unfortunately, for domains as complex as social interaction or natural movement, the relevant feature space is poorly understood, and an arbitrary a priori choice of features may give rise to confirmation bias.
Edit intent: clarity
Original:  That is, we are modeling stimulus dynamics as driven by neural activity, rather than intrinsic neural dynamics.
Revised:  That is, we are modeling neural activity as driven by neural activity, rather than intrinsic neural dynamics.
Edit intent: clarity
Original: A comparative study is done of interdisciplinary citations in 2013 between physics, chemistry, and molecular biology, in  South Korea, Turkey, and USA. Several surprising conclusions emerge from our tabular and graphical analysis: The interscience citation rates are in general strikingly similar, between  South Korea, Turkey, and USA.
Revised: A comparative study is done of interdisciplinary citations in 2013 between physics, chemistry, and molecular biology, in South Korea, Turkey, and USA. Several surprising conclusions emerge from our tabular and graphical analysis: The cross-science citation rates are in general strikingly similar, between South Korea, Turkey, and USA.
Edit intent: clarity
Original:  One apparent exception is the comparatively more tenuous relation between molecular biology and physics in the USA.
Revised:  One apparent exception is the comparatively more tenuous relation between molecular biology and physics in Brazil and USA.
Edit intent: clarity
Original:  Other slight exceptions are the higher amount of citing of physicists by chemists in South Korea, of chemists by molecular biologists in Turkey, and of molecular biologists by chemists in  USA. Chemists are, by a sizable margin, the most interscience citing scientists in this group of three sciences.
Revised:  Other slight exceptions are the higher amount of citing of physicists by chemists in South Korea, of chemists by molecular biologists in Turkey, and of molecular biologists by chemists in USA. Chemists are, by a sizable margin, the most cross-science citing scientists in this group of three sciences.
Edit intent: clarity
Original:  Physicist are, again by a sizable margin, the least interscience citing scientists in this group of three sciences.
Revised:  Physicist are, again by a sizable margin, the least cross-science citing scientists in this group of three sciences.
Edit intent: fluency
Original:  Our findings are consistent with a V-shaped backbone connectivity, as opposed to a \Delta connectivity, as also found in a previous study of earlier citation years.
Revised:  Our findings are consistent with a V-shaped backbone connectivity, as opposed to a Delta connectivity, as also found in a previous study of earlier citation years.
Edit intent: fluency
Original:  Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree of maturity has been reached in terms of physical layer design  with practical demonstrations in simple topologies.
Revised:  Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree of maturity has been reached for physical layer design with practical demonstrations in simple topologies.
Edit intent: clarity
Original:  Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree of maturity has been reached in terms of physical layer design  with practical demonstrations in simple topologies.
Revised:  Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree of maturity has been reached in terms of physical layer design , with practical demonstrations in simple topologies.
Edit intent: fluency
Original:  In this paper, we introduce an analytical framework based on stochastic geometry that captures the behaviour of large full-duplex networks implementing an asynchronous random access policy . Via closed-form expressions we discuss the key tradeoffs that characterise these systems, exploring among the rest the role of transmission duration, imperfect self- interference cancellation and fraction of full-duplex nodes in the network.
Revised:  In this paper, we introduce an analytical framework based on stochastic geometry that captures the behaviour of large full-duplex networks implementing an asynchronous random access policy . Via closed-form expressions we discuss the key tradeoffs that characterise these systems, exploring among the rest the role of transmission duration, imperfect self-interference cancellation and fraction of full-duplex nodes in the network.
Edit intent: fluency
Original:  The improvement is shown to provide the same (near optimal) costs while significantly reducing delay, as shown in simulations .
Revised:  The improvement is shown to provide the same (near optimal) costs . Simulation experiments on a real data center traffic trace demonstrate the efficiency of our algorithm compared to other existing algorithms .
Edit intent: clarity
Original:  The r(3,10) ?graph contains two limitations, that is, neither complete graphs of order 3 nor independent sets of order 10.
Revised:  The r(3,10) -graph contains two limitations, that is, neither complete graphs of order 3 nor independent sets of order 10.
Edit intent: fluency
Original:  Congruence arithmetic has been a fundamental tool for data security and computer algebra etc. . However, much less attention was devoted to the topological features of congruence relations among natural numbers.
Revised:  Congruence arithmetic has been a fundamental tool for data security and computer algebra . However, much less attention was devoted to the topological features of congruence relations among natural numbers.
Edit intent: coherence
Original:  The multiplex congruence network can be employed to resolve the simultaneous congruences problem highly efficiently, which challenges the modern cryptography based on simultaneous congruences.
Revised:  The multiplex congruence network can be employed to resolve the simultaneous congruences problem , which may have implication in cryptography based on simultaneous congruences.
Edit intent: clarity
Original:  The definition is pathwise in that neither \phi nor \omega are assumed to be paths of stochastic processes, and the It\^o integral exists almost surely in a non-probabilistic financial sense.
Revised:  The definition is pathwise in that neither \phi nor \omega are assumed to be paths of stochastic processes, and the Ito integral exists almost surely in a non-probabilistic financial sense.
Edit intent: fluency