wanyu/IteraTeR_v2 huggingface dataset:
Original:  Both of our dissimilarity measures on nondegenerate hierarchies are positive definite ( vanishes only between identical trees) and symmetric but are not a true metric because they do not satisfy the triangle inequality.
Revised:  Both of our dissimilarity measures on nondegenerate hierarchies are positive definite ( vanish only between identical trees) and symmetric but are not a true metric because they do not satisfy the triangle inequality.
Edit intent: fluency
Original:  Both of our dissimilarity measures on nondegenerate hierarchies are positive definite ( vanishes only between identical trees) and symmetric but are not a true metric because they do not satisfy the triangle inequality.
Revised:  Both of our dissimilarity measures on nondegenerate hierarchies are positive definite ( vanishes only between identical trees) on binary hierarchies but they fail to satisfy the triangle inequality.
Edit intent: clarity
Original:  Although they are not true metrics, they are both linearly bounded below by the widely used Robinson-Foulds metric and  above by a new tree metric, called the cluster-cardinality distance --- the pullback metric of a matrix norm along an embedding of hierarchies into the space of matrices.
Revised:  Nevertheless, both are bounded below by the widely used Robinson-Foulds metric and above by a new tree metric, called the cluster-cardinality distance --- the pullback metric of a matrix norm along an embedding of hierarchies into the space of matrices.
Edit intent: clarity
Original:  Although they are not true metrics, they are both linearly bounded below by the widely used Robinson-Foulds metric and  above by a new tree metric, called the cluster-cardinality distance --- the pullback metric of a matrix norm along an embedding of hierarchies into the space of matrices.
Revised:  Although they are not true metrics, they are both linearly bounded below by the widely used Robinson-Foulds metric and bounded above by a new tree metric, called the cluster-cardinality distance --- the pullback metric of a matrix norm along an embedding of hierarchies into the space of matrices.
Edit intent: clarity
Original: Crowdsourced stream processing (CSP) is crowdsourcing applied to the processing of data streams .
Revised: A crowdsourced stream processing system (CSP) is crowdsourcing applied to the processing of data streams .
Edit intent: clarity
Original: Crowdsourced stream processing (CSP) is crowdsourcing applied to the processing of data streams .
Revised: Crowdsourced stream processing (CSP) is a system that incorporates crowdsourced tasks in the processing of data streams .
Edit intent: clarity
Original: Crowdsourced stream processing (CSP) is crowdsourcing applied to the processing of data streams .
Revised: Crowdsourced stream processing (CSP) is crowdsourcing applied to the processing of a data stream .
Edit intent: fluency
Original:  This can be seen as enabling crowdsourcing work to be applied to large-scale data at high speed, or equivalently, enabling stream processing to employ human intelligence.
Revised:  This can be seen as enabling crowdsourcing work to be applied on a sample of large-scale data at high speed, or equivalently, enabling stream processing to employ human intelligence.
Edit intent: clarity
Original:  Independently of the perspective one adopts, this entails a substantial expansion of the capabilities of computer systems.
Revised:  It also leads to a substantial expansion of the capabilities of computer systems.
Edit intent: clarity
Original:  Independently of the perspective one adopts, this entails a substantial expansion of the capabilities of computer systems.
Revised:  Independently of the perspective one adopts, this entails a substantial expansion of the capabilities of data processing systems.
Edit intent: clarity
Original:  Engineering a CSP system requires combining human and machine computation elements.
Revised:  Engineering a CSP system requires the combination of human and machine computation elements.
Edit intent: fluency
Original:  From a general systems theory perspective, this implies taking into account inherited as well as emerging properties from such elements.
Revised:  From a general systems theory perspective, this means taking into account inherited as well as emerging properties from such elements.
Edit intent: fluency
Original:  From a general systems theory perspective, this implies taking into account inherited as well as emerging properties from such elements.
Revised:  From a general systems theory perspective, this implies taking into account inherited as well as emerging properties from both these elements.
Edit intent: clarity
Original:  In this paper, we define and position CSP systems within a broader taxonomy, introduce a series of design principles and evaluation metrics, present an extensible design framework , and describe several design patterns.
Revised:  In this paper, we position CSP systems within a broader taxonomy, introduce a series of design principles and evaluation metrics, present an extensible design framework , and describe several design patterns.
Edit intent: coherence
Original:  In this paper, we define and position CSP systems within a broader taxonomy, introduce a series of design principles and evaluation metrics, present an extensible design framework , and describe several design patterns.
Revised:  In this paper, we define and position CSP systems within a broader taxonomy, outline a series of design principles and evaluation metrics, present an extensible design framework , and describe several design patterns.
Edit intent: clarity
Original:  In this paper, we define and position CSP systems within a broader taxonomy, introduce a series of design principles and evaluation metrics, present an extensible design framework , and describe several design patterns.
Revised:  In this paper, we define and position CSP systems within a broader taxonomy, introduce a series of design principles and evaluation metrics, present an extensible framework for their design , and describe several design patterns.
Edit intent: clarity
Original:  We also perform a case study applying this framework to the design and analysis of a real system in the humanitarian computing domain .
Revised:  We also perform a case study that applies our proposed framework to the design and analysis of a real system in the humanitarian computing domain .
Edit intent: clarity
Original: Powerlaws and distributions with heavy tails are common features of many experimentally studied complex systems, like the distribution of the sizes of earthquakes and solar flares, or the duration of neuronal avalanches in the brain.
Revised: Power laws and distributions with heavy tails are common features of many experimentally studied complex systems, like the distribution of the sizes of earthquakes and solar flares, or the duration of neuronal avalanches in the brain.
Edit intent: fluency
Original:  It had been tempting to surmise that a single general concept may act as a unifying underlying generative mechanism, with the theory of self organized criticality being a weighty contender.
Revised:  Previously, researchers surmised that a single general concept may act as a unifying underlying generative mechanism, with the theory of self organized criticality being a weighty contender.
Edit intent: clarity
Original:  On the theory side there has been, lively activity in developing new and extended models .
Revised:  Consequently, a substantial amount of effort has gone into developing new and extended models .
Edit intent: clarity
Original:  The second line of approach is based on external drives and internal dynamics competing on similar time scales and includes the coherent noise model, which has a non-critical steady state characterized by heavy-tailed distributions.
Revised:  The second line of models is based on external drives and internal dynamics competing on similar time scales and includes the coherent noise model, which has a non-critical steady state characterized by heavy-tailed distributions.
Edit intent: clarity
Original:  The third line of modeling proposes a non-critical state which is self-organizing  , being guided by an optimization principle, such as the concept of highly optimized tolerance.
Revised:  The third line of models proposes a non-critical state which is self-organizing , being guided by an optimization principle, such as the concept of highly optimized tolerance.
Edit intent: fluency
Original:  The third line of modeling proposes a non-critical state which is self-organizing  , being guided by an optimization principle, such as the concept of highly optimized tolerance.
Revised:  The third line of modeling proposes a non-critical self-organizing , being guided by an optimization principle, such as the concept of highly optimized tolerance.
Edit intent: clarity
Original:  The complexity of physical and biological scaling phenomena has been found to transcend the explanatory power of individual paradigmal concepts , like the theory of self-organized criticality, the interaction between theoretical development and experimental observations has been very fruitful, leading to a series of novel concepts and insights.
Revised:  The complexity of physical and biological scaling phenomena has been found to transcend the explanatory power of individual paradigmal concepts . The interaction between theoretical development and experimental observations has been very fruitful, leading to a series of novel concepts and insights.
Edit intent: coherence
Original:  The framework employs a virtual control plane which operates on the user demand rate  in the network, and an actual plane which handles interest packets and data packets .
Revised:  The framework employs a virtual control plane which operates on the user demand rate in the network, and an actual plane which handles Interest Packets and Data Packets .
Edit intent: fluency
Original:  Numerical experiments within a number of network settings demonstrate the superior performance of the resulting algorithms for the actual plane in terms of  user delay and the rate of cache hits.
Revised:  Numerical experiments within a number of network settings demonstrate the superior performance of the resulting algorithms for the actual plane in terms of user delay and high rate of cache hits.
Edit intent: clarity
Original:   Numerical experiments within a number of network settings demonstrate the superior performance of the resulting algorithms for the actual plane in terms of  low user delay  and high rate of cache hits.
Revised:  Numerical experiments within a number of network settings demonstrate the superior performance of the resulting algorithms for the actual plane in terms of low user delay , and high rate of cache hits.
Edit intent: fluency
Original:  This simple analysis was able to produce a ranking consistent with the SCImago country ranking.
Revised:  This na\"{i was able to produce a ranking consistent with the SCImago country ranking.
Edit intent: clarity
Original:  This simple analysis was able to produce a ranking consistent with the SCImago country ranking.
Revised:  This simple analysis was able to produce rankings consistent with the SCImago country ranking.
Edit intent: fluency
Original:  Due to its relevance for SAT solving, we concentrate on the query type "clausal entailment" (CE), i.e., whether a clause C follows from f or not, and we consider subclasses of CNF, i.e., clause-sets F with special properties (CNF itself is not suitable for CE queries unless P=NP) .
Revised:  Due to its relevance for SAT solving, we concentrate on the query type "clausal entailment" (CE), i.e., whether a clause C follows from f or not, and we consider subclasses of CNF, i.e., clause-sets F with special properties .
Edit intent: coherence
Original:  We consider the hierarchies UC_k <= WC_k, which where introduced by the authors in 2012.
Revised:  We consider the hierarchies UC_k <= WC_k, which were introduced by the authors in 2012.
Edit intent: fluency
Original:  The first two levels are well-known classes for KC , namely UC_0 = WC_0 is the same as PI as studied in KC, that is, f is represented by the set of all prime implicates, while UC_1 = WC_1 is the same as UC, the class of unit-refutation complete clause-sets introduced by del Val 1994.
Revised:  The first two levels are well-known classes for KC . Namely UC_0 = WC_0 is the same as PI as studied in KC, that is, f is represented by the set of all prime implicates, while UC_1 = WC_1 is the same as UC, the class of unit-refutation complete clause-sets introduced by del Val 1994.
Edit intent: fluency
Original: Nowadays, the understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems.
Revised: The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems.
Edit intent: coherence
Original:  Basing ourselves on these specific mathematical objects, in this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of their complexity.
Revised:  In this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of their complexity.
Edit intent: clarity
Original:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Revised:  We present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Edit intent: coherence
Original:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Revised:  We indeed present new results that provide a characterisation of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Edit intent: fluency
Original:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Revised:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Edit intent: fluency
Original:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect by sharing one automaton, the so-called double-cycle.
Revised:  We indeed present new results that provide a characterization of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect at one automaton, the so-called double-cycle.
Edit intent: clarity
Original:  Moreover , we introduce here an efficient formalism inspired by algorithms to define long sequences of updates .
Revised:  Moreover , we introduce an efficient formalism inspired by algorithms to define long sequences of updates .
Edit intent: clarity
Original:  Following this discovery, we show that density-dependent predation provides an abstraction of Hamilton's original formulation of " domains of danger.
Revised:  Following this discovery, we show that density-dependent predation provides an abstraction of Hamilton's original formulation of `` domains of danger.
Edit intent: fluency
Original:  " Finally, we verify that density-dependent predation provides a sufficient selective advantage for prey to evolve the selfish herd in response to predation by coevolving predators.
Revised:  '' Finally, we verify that density-dependent predation provides a sufficient selective advantage for prey to evolve the selfish herd in response to predation by coevolving predators.
Edit intent: fluency
Original:  We propose a new approach , called dissociation, by which these scores are evaluated inside the database engine for every query.
Revised:  We propose a new approach for approximate evaluation of queries over probabilistic databases: in this approach, every query is evaluated entirely in the database engine for every query.
Edit intent: clarity
Original:  We give several optimizations and provide experimental evidence for quality and effectiveness of our approach  .
Revised:  We give a detailed experimental evaluation of our approach .
Edit intent: clarity
Original:  This paper proposes a new approach for approximate evaluation of queries over probabilistic databases: in this approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Revised:  This paper proposes an alternative approach for approximate evaluation of queries over probabilistic databases: in this approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Edit intent: clarity
Original:  This paper proposes a new approach for approximate evaluation of queries over probabilistic databases: in this approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Revised:  This paper proposes a new approach for approximate evaluation of queries with probabilistic databases: in this approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Edit intent: clarity
Original:  This paper proposes a new approach for approximate evaluation of queries over probabilistic databases: in this approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Revised:  This paper proposes a new approach for approximate evaluation of queries over probabilistic databases: In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.
Edit intent: coherence
Original:  Importantly, this algorithm is a strict generalization of all known results of PTIME self-join free conjunctive queries: the query is safe if and only if our algorithm returns one single plan.
Revised:  Importantly, this algorithm is a strict generalization of all known PTIME self-join-free conjunctive queries: the query is safe if and only if our algorithm returns one single plan.
Edit intent: clarity
Original:  Importantly, this algorithm is a strict generalization of all known results of PTIME self-join free conjunctive queries: the query is safe if and only if our algorithm returns one single plan.
Revised:  Importantly, this algorithm is a strict generalization of all known results of PTIME self-join free conjunctive queries: A query is in PTIME if and only if our algorithm returns one single plan.
Edit intent: clarity
Original:  Furthermore, our approach is a generalization of a family of efficient network ranking functions from graphs to hypergraphs.
Revised:  Furthermore, our approach is a generalization of a family of efficient ranking functions from graphs to hypergraphs.
Edit intent: clarity
Original:  We also describe three relational query optimization techniques that allow us to evaluate all minimal safe plans in a single query and very fast.
Revised:  We also apply three relational query optimization techniques that allow us to evaluate all minimal safe plans in a single query and very fast.
Edit intent: clarity
Original:  We also describe three relational query optimization techniques that allow us to evaluate all minimal safe plans in a single query and very fast.
Revised:  We also describe three relational query optimization techniques to evaluate all minimal safe plans in a single query and very fast.
Edit intent: clarity
Original:  We also describe three relational query optimization techniques that allow us to evaluate all minimal safe plans in a single query and very fast.
Revised:  We also describe three relational query optimization techniques that allow us to evaluate all minimal plans very fast.
Edit intent: clarity
Original:  We give a detailed experimental evaluation of our approach and, in the process, provide  new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers.
Revised:  We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers.
Edit intent: fluency
Original: Probabilistic inference over large data sets is a challenging data management problem as exact inference is generally #P-hard and requires sampling-based methods  .
Revised: Probabilistic inference over large data sets is a challenging data management problem since exact inference is generally #P-hard and requires sampling-based methods .
Edit intent: coherence
Original: Probabilistic inference over large data sets is a challenging data management problem as exact inference is generally #P-hard and requires sampling-based methods  .
Revised: Probabilistic inference over large data sets is a challenging data management problem as exact inference is generally #P-hard and requires sampling-based methods today .
Edit intent: clarity
Original:  Furthermore, our approach is a generalization of a family of efficient ranking functions from graphs to hypergraphs.
Revised:  Furthermore, our approach is a generalization of a family of efficient ranking methods from graphs to hypergraphs.
Edit intent: clarity
Original:  We also apply three relational query optimization techniques to evaluate all minimal plans very fast.
Revised:  We also adapt three relational query optimization techniques to evaluate all minimal plans very fast.
Edit intent: clarity
Original:  In this paper we give general combinatorial arguments showing that if a sorting network with smaller depth exists then there exists one with a special form.
Revised:  In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form.
Edit intent: clarity
Original:  At the time, we could only state that a generic divisor is typical, and hence unlikely to be encountered if one implements these algorithms over a very large finite field.
Revised:  At that time, we could only state that a generic divisor is typical, and hence unlikely to be encountered if one implements these algorithms over a very large finite field.
Edit intent: coherence
Original:  At the time, we could only state that a generic divisor is typical, and hence unlikely to be encountered if one implements these algorithms over a very large finite field.
Revised:  At the time, we could only state that a generic divisor was typical, and hence unlikely to be encountered if one implements these algorithms over a very large finite field.
Edit intent: fluency