wanyu/IteraTeR_v2 huggingface dataset:
Original:  Rather than aborting with an exception when evaluation encounters any of these holes ( as in several existing systems ) , evaluation proceeds "around " the holes, performing as much of the remaining computation as is possible and tracking the closure around each hole instance as it flows through the program.
Revised:  Rather than aborting with an exception when evaluation encounters any of these holes ( as in several existing systems ) , evaluation proceeds around holes, tracking the closure around each hole instance as it flows through the program.
Edit intent: clarity
Original:  They also enable a " fill-and-resume " feature that avoids the need to restart evaluation after edits that amount to hole filling.
Revised:  They also enable a fill-and-resume " feature that avoids the need to restart evaluation after edits that amount to hole filling.
Edit intent: fluency
Original:  They also enable a " fill-and-resume " feature that avoids the need to restart evaluation after edits that amount to hole filling.
Revised:  They also enable a " fill-and-resume operation that avoids the need to restart evaluation after edits that amount to hole filling.
Edit intent: clarity
Original:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Revised:  Formally, the semantics borrows machinery from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Edit intent: clarity
Original:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Revised:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical basis for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Edit intent: fluency
Original:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Revised:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), combining these and developing additional machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Edit intent: clarity
Original:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past the various hole forms and to prove important metatheoretic properties.
Revised:  Formally, the semantics draws from both gradual type theory (to handle type holes) and contextual modal type theory (which provides a logical foundation for hole closures), and develops additional technical machinery necessary to continue evaluation past holes while maintaining important metatheoretic properties.
Edit intent: clarity
Original:  We also describe a simple implementation , called HazelnutLive, that inserts holes as necessary during the editing process to guarantee that every edit state has some (possibly incomplete) type, based in part on the Hazelnut edit action calculus in our recent work  .
Revised:  We have also implemented these ideas into the Hazel programming environment. The implementation inserts holes automatically to guarantee that every edit state has some (possibly incomplete) type, based in part on the Hazelnut edit action calculus in our recent work .
Edit intent: clarity
Original:  We also describe a simple implementation , called HazelnutLive, that inserts holes as necessary during the editing process to guarantee that every edit state has some (possibly incomplete) type, based in part on the Hazelnut edit action calculus in our recent work  .
Revised:  We also describe a simple implementation , called HazelnutLive, that inserts holes as necessary during the editing process to guarantee that every editor state has some (possibly incomplete) type, based in part on the Hazelnut edit action calculus in our recent work .
Edit intent: fluency
Original:  We also describe a simple implementation , called HazelnutLive, that inserts holes as necessary during the editing process to guarantee that every edit state has some (possibly incomplete) type, based in part on the Hazelnut edit action calculus in our recent work  .
Revised:  We also describe a simple implementation , called HazelnutLive, that inserts holes as necessary during the editing process to guarantee that every edit state has some (possibly incomplete) type, following the Hazelnut edit action calculus in our recent work .
Edit intent: clarity
Original:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where  dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Revised:  Taken together with this paper's type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Edit intent: coherence
Original:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where  dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Revised:  Taken together with the type safety property , the result is a proof-of-concept live typed functional programming environment where dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Edit intent: clarity
Original:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where  dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Revised:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live programming environment where dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Edit intent: clarity
Original:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where  dynamic feedback is truly continuous , i.e. it is available for every possible edit state.
Revised:  Taken together with the type safety property that this paper establishes , the result is a proof-of-concept live typed functional programming environment where dynamic feedback is truly continuous , i.e. it is available for every possible editor state.
Edit intent: fluency
Original: This paper develops a dynamic semantics for incomplete functional programs, starting from the static semantics recently developed by Omar et al 2017 . We model incomplete functional programs as expressions with holes, with empty holes standing for missing expressions or types, and non-empty holes operating as membranes around static and dynamic type inconsistencies.
Revised: This paper develops a dynamic semantics for incomplete functional programs, starting from the static semantics 2017 . We model incomplete functional programs as expressions with holes, with empty holes standing for missing expressions or types, and non-empty holes operating as membranes around static and dynamic type inconsistencies.
Edit intent: clarity
Original:  Rather than aborting when evaluation encounters any of these holes as in several existing systems, evaluation proceeds around holes, tracking the closure around each hole instance as it flows through the remainder of the program.
Revised:  Rather than aborting when evaluation encounters any of these holes as in some existing systems, evaluation proceeds around holes, tracking the closure around each hole instance as it flows through the remainder of the program.
Edit intent: clarity
Original:  Editor services can report information from these hole closures to help the programmer  decide how to fill the holes in the program .
Revised:  Editor services can use the information in these hole closures to help the programmer decide how to fill the holes in the program .
Edit intent: clarity
Original:  Editor services can report information from these hole closures to help the programmer  decide how to fill the holes in the program .
Revised:  Editor services can report information from these hole closures to help the programmer decide how to fill the remaining holes .
Edit intent: clarity
Original:  Formally, the semantics borrows machinery from both gradual type theory ( to handle type holes) and contextual modal type theory (which provides a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining important metatheoretic properties .
Revised:  Formally, the semantics borrows machinery from both gradual type theory ( to handle type holes) and contextual modal type theory (which supplies a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining important metatheoretic properties .
Edit intent: clarity
Original:  Formally, the semantics borrows machinery from both gradual type theory ( to handle type holes) and contextual modal type theory (which provides a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining important metatheoretic properties .
Revised:  Formally, the semantics borrows machinery from both gradual type theory ( to handle type holes) and contextual modal type theory (which provides a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining type safety .
Edit intent: clarity
Original:  We have mechanized the metatheory of this core calculus, called Hazelnut Live, using the Agda proof assistant.
Revised:  We have mechanized the metatheory of the core calculus, called Hazelnut Live, using the Agda proof assistant.
Edit intent: clarity
Original:  The implementation inserts holes automatically  to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Revised:  The implementation inserts holes automatically , following the Hazelnut edit action calculus, to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Edit intent: fluency
Original:  The implementation inserts holes automatically  to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Revised:  The implementation inserts holes automatically to guarantee that every editor state has some (possibly incomplete) type 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Edit intent: clarity
Original:  The implementation inserts holes automatically  to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Revised:  The implementation inserts holes automatically to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Edit intent: coherence
Original:  The implementation inserts holes automatically  to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. it is available for every possible editor state.
Revised:  The implementation inserts holes automatically to guarantee that every editor state has some (possibly incomplete) type , following the Hazelnut edit action calculus of Omar et al 2017 . Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. for every reachable editor state.
Edit intent: clarity
Original: Network theory provides a useful framework for studying interconnected systems of interacting agents.
Revised: Network theory is a useful framework for studying interconnected systems of interacting agents.
Edit intent: clarity
Original:  Many networked systems evolve continuously in time, but most existing methods for analyzing time-dependent networks rely on discrete or discretized time.
Revised:  Many networked systems evolve continuously in time, but most existing methods for the analysis of time-dependent networks rely on discrete or discretized time.
Edit intent: fluency
Original:  In this paper, we propose a novel approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties , which represent strengths of relationships as functions of time.
Revised:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties , which represent strengths of relationships as functions of time.
Edit intent: clarity
Original:  In this paper, we propose a novel approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties , which represent strengths of relationships as functions of time.
Revised:  In this paper, we propose a novel approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties , which represent strengths of relationships as functions of time.
Edit intent: fluency
Original:  To illustrate our framework of tie-decay networks, we show how to examine --- in a mathematically tractable and computationally efficient way --- important (i. e., 'central') nodes in networks in which tie strengths decay in time after individuals interact.
Revised:  To illustrate our tie-decay networks, we show how to examine --- in a mathematically tractable and computationally efficient way --- important (i. e., 'central') nodes in networks in which tie strengths decay in time after individuals interact.
Edit intent: clarity
Original: Network theory is a useful framework for studying interconnected systems of interacting agents .
Revised: Network theory is a useful framework for studying interconnected systems of interacting entities .
Edit intent: clarity
Original:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties, which represent strengths of relationships as functions of time.
Revised:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties, which represent strengths of relationships as functions of time.
Edit intent: fluency
Original:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties, which represent strengths of relationships as functions of time.
Revised:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties strengths of relationships as functions of time.
Edit intent: coherence
Original:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties, which represent strengths of relationships as functions of time.
Revised:  In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions , which we model as discrete contacts, and ties, which represent, which encode the strengths of relationships as functions of time.
Edit intent: clarity
Original:  To illustrate our tie-decay network formulation , we adapt the well-known PageRank centrality score to the tie-decay framework in a mathematically tractable and computationally efficient way.
Revised:  To illustrate our tie-decay network formalism , we adapt the well-known PageRank centrality score to the tie-decay framework in a mathematically tractable and computationally efficient way.
Edit intent: clarity
Original:  To illustrate our tie-decay network formulation , we adapt the well-known PageRank centrality score to the tie-decay framework in a mathematically tractable and computationally efficient way.
Revised:  To illustrate our tie-decay network formulation , we adapt the well-known PageRank centrality score to our tie-decay framework in a mathematically tractable and computationally efficient way.
Edit intent: fluency
Original:  We demonstrate our framework on a synthetic example and then use it to study a network of retweets during the 2012 National Health Service controversy in the United Kingdom.
Revised:  We apply this framework to a synthetic example and then use it to study a network of retweets during the 2012 National Health Service controversy in the United Kingdom.
Edit intent: clarity
Original: Multiobjective optimization evolutionary algorithms have been successfully applied to solving constrained optimization problems.
Revised: Multiobjective evolutionary algorithms (MOEAs) have been successfully applied to solving constrained optimization problems.
Edit intent: clarity
Original: Multiobjective optimization evolutionary algorithms have been successfully applied to solving constrained optimization problems.
Revised: Multiobjective optimization evolutionary algorithms have been successfully applied to a number of constrained optimization problems.
Edit intent: clarity
Original:  Through a study of fitness landscapes using principle component analysis , we discover a statistic method of identifying the valley direction in a valley landscape . Based on this discovery , a new search operator  called PCA-projection is constructed which projects an individual to a position along the valley direction.
Revised:  Through a study of fitness landscapes using principle component analysis , we discover a statistic method of identifying the valley direction in a valley landscape . Based on this finding , a new search operator called PCA-projection is constructed which projects an individual to a position along the valley direction.
Edit intent: clarity
Original:  Through a study of fitness landscapes using principle component analysis , we discover a statistic method of identifying the valley direction in a valley landscape . Based on this discovery , a new search operator  called PCA-projection is constructed which projects an individual to a position along the valley direction.
Revised:  Through a study of fitness landscapes using principle component analysis , we discover a statistic method of identifying the valley direction in a valley landscape . Based on this discovery , a new search operator , called PCA-projection is constructed which projects an individual to a position along the valley direction.
Edit intent: fluency
Original:  A comparative experiment has been implemented between the proposed algorithm and a state-of-the-art multiobjective differential evolution algorithm on a standard set of 24 benchmarks.
Edit intent: coherence
Original: We propose a benchmark framework to rank image attractiveness using a novel model trained with a large set of side-by-side multi-labeled image pairs .
Revised: We propose a new framework to rank image attractiveness using a novel model trained with a large set of side-by-side multi-labeled image pairs .
Edit intent: clarity
Original:  The judges only need to provide relative ranking between two images without the need to directly assign an absolute score  .
Revised:  The judges only provide relative ranking between two images without the need to directly assign an absolute score .
Edit intent: fluency
Original:  We investigate a deep attractiveness rank net (DARN), a combination of deep convolutional neural network and rank net, to generate an attractiveness score mean and variance for each image after training on side-by-side rated image pairs.
Revised:  We investigate a deep attractiveness rank net (DARN), a combination of deep convolutional neural network and rank net, to directly learn an attractiveness score mean and variance for each image after training on side-by-side rated image pairs.
Edit intent: clarity
Original:  The deep neural network jointly learns a mapping from each DNN feature to a score mean and variance, and the underlying criteria the judges use to label each image pair.
Revised:  The deep neural network jointly learns a mapping from each DNN feature to a score mean and variance, and the underlying criteria the judges use to label each pair.
Edit intent: clarity
Original:  The judges only provide relative ranking between two images without the need to directly assign an absolute score, or rate any predefined image attribute, thus making the rating more intuitive and straightforward .
Revised:  The judges only provide relative ranking between two images without the need to directly assign an absolute score, or rate any predefined image attribute, thus making the rating more intuitive and accurate .
Edit intent: clarity