wanyu/IteraTeR_v2 huggingface dataset:
Original:  To achieve this so-called grounded language learning, models must overcome certain well-studied learning challenges that are also fundamental to infants learning their first words.
Revised:  To achieve this so-called grounded language learning, models must overcome challenges that infants face when learning their first words.
Edit intent: clarity
Original:  While it is notable that models with no meaningful prior knowledge overcome these learning obstacles, AI researchers and practitioners currently lack a clear understanding of exactly how they do so . Here we address this question as a way of achieving a clearer general understanding of grounded language learning, both to inform future research and to improve confidence in model predictions .
Revised:  While it is notable that models with no meaningful prior knowledge overcome these obstacles, researchers currently lack a clear understanding of exactly how they do so . Here we address this question as a way of achieving a clearer general understanding of grounded language learning, both to inform future research and to improve confidence in model predictions .
Edit intent: clarity
Original:  While it is notable that models with no meaningful prior knowledge overcome these learning obstacles, AI researchers and practitioners currently lack a clear understanding of exactly how they do so . Here we address this question as a way of achieving a clearer general understanding of grounded language learning, both to inform future research and to improve confidence in model predictions .
Revised:  While it is notable that models with no meaningful prior knowledge overcome these learning obstacles, AI researchers and practitioners currently lack a clear understanding of how they do so . Here we address this question as a way of achieving a clearer general understanding of grounded language learning, both to inform future research and to improve confidence in model predictions .
Edit intent: clarity
Original:  While it is notable that models with no meaningful prior knowledge overcome these learning obstacles, AI researchers and practitioners currently lack a clear understanding of exactly how they do so . Here we address this question as a way of achieving a clearer general understanding of grounded language learning, both to inform future research and to improve confidence in model predictions .
Revised:  While it is notable that models with no meaningful prior knowledge overcome these learning obstacles, AI researchers and practitioners currently lack a clear understanding of exactly how they do so , a problem that we attempt to address in this paper .
Edit intent: clarity
Original:  For maximum control and generality, we focus on a simple neural network-based language learning agent  trained via policy-gradient methods to interpret synthetic linguistic instructions in a simulated 3D world.
Revised:  For maximum control and generality, we focus on a simple neural network-based language learning agent , trained via policy-gradient methods to interpret synthetic linguistic instructions in a simulated 3D world.
Edit intent: fluency
Original:  We further propose a novel way to visualise and analyse semantic representation in grounded language learning agents that yields a plausible computational account of the observed effects .
Revised:  We further propose a novel method for visualising semantic representations in the agent .
Edit intent: clarity
Original:  The synthetic data involves Erdo s-R\'enyi graphs, Barab\'asi-Albertnyi graphs, Barab\'{a}si-Albert } graphs, and specially structured random graphs.
Revised:  The synthetic data involves Erdo s-R\'{enyi graphs, Barab\'{a}si-Albert } graphs, and specially structured random graphs.
Edit intent: fluency
Original: An important measure of a signed graph is the line index of balance which has several applications in many fields.
Revised: An important measure of signed graphs is the line index of balance which has several applications in many fields.
Edit intent: fluency
Original: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem as the growth of Industry 4.0 and Industry Internet of Things (IIoT) .
Revised: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem as the growth of Industry 4.0 and Industry Internet of Things .
Edit intent: clarity
Original:  To tackle the real world challenge in this area, like equipment health monitoring by comparing the incoming data stream with known fault patterns, we formulate a new problem, called " fine-grained pattern matching" .
Revised:  To tackle the real world challenge in this area, we formulate a new problem, called " fine-grained pattern matching" .
Edit intent: coherence
Original:  To tackle the real world challenge in this area, like equipment health monitoring by comparing the incoming data stream with known fault patterns, we formulate a new problem, called " fine-grained pattern matching" .
Revised:  To tackle the real world challenge in this area, like equipment health monitoring by comparing the incoming data stream with known fault patterns, we formulate a new problem, called fine-grained pattern matching" .
Edit intent: fluency
Original:  To tackle the real world challenge in this area, like equipment health monitoring by comparing the incoming data stream with known fault patterns, we formulate a new problem, called " fine-grained pattern matching" .
Revised:  To tackle the real world challenge in this area, like equipment health monitoring by comparing the incoming data stream with known fault patterns, we formulate a new problem, called " fine-grained pat- tern matching .
Edit intent: fluency
Original:  It allows users to define varied deviations to different segments of a given pattern, and fuzzy breakpoint of adjunct segments, which urges the dramatically increased complexity against traditional pattern matching problem over stream.
Revised:  It allows users to define varied deviations to different segments of a given pattern, and adaptive breakpoint of adjunct segments, which urges the dramatically increased complexity against traditional pattern matching problem over stream.
Edit intent: clarity
Original:  In this paper, we propose a novel 2-phase approach to solve this problem.
Revised:  In this paper, we propose a novel approach to solve this problem.
Edit intent: coherence
Original:  In  pruning phase, we propose ELB( Equal Length Block  ) Representation and BSP (Block-Skipping Pruning) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Revised:  In the pruning phase, we propose ELB( Equal Length Block ) Representation and BSP (Block-Skipping Pruning) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Edit intent: fluency
Original:  In  pruning phase, we propose ELB( Equal Length Block  ) Representation and BSP (Block-Skipping Pruning) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Revised:  In pruning phase, we propose Equal Length Block ) Representation and BSP (Block-Skipping Pruning) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Edit intent: coherence
Original:  In  pruning phase, we propose ELB( Equal Length Block  ) Representation and BSP (Block-Skipping Pruning) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Revised:  In pruning phase, we propose ELB( Equal Length Block ) policy, which efficiently filter the unmatched subsequence with the guarantee of no-false dismissals.
Edit intent: coherence
Original:  In  post-processing phase, we provide an algorithm to further examine the possible matches in linear complexity.
Revised:  In the post-processing phase, we provide an algorithm to further examine the possible matches in linear complexity.
Edit intent: fluency
Original:  We conducted an extensive experimental evaluation on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation, by orders of magnitude.
Revised:  Extensive experiments are evaluated on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation, by orders of magnitude.
Edit intent: clarity
Original: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem  as the growth of Industry 4.0 and Industry Internet of Things.
Revised: Processing of streaming time series with lower latency and limited computing resource comes to a critical problem as the growth of Industry 4.0 and Industry Internet of Things.
Edit intent: clarity
Original: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem  as the growth of Industry 4.0 and Industry Internet of Things.
Revised: Processing of streaming time series data from sensors with lower latency under limited computing resource comes to a critical problem as the growth of Industry 4.0 and Industry Internet of Things.
Edit intent: clarity
Original: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem  as the growth of Industry 4.0 and Industry Internet of Things.
Revised: Processing of streaming time series data from sensors with lower latency and limited computing resource comes to a critical problem , especially as the growth of Industry 4.0 and Industry Internet of Things.
Edit intent: coherence
Original:  To tackle the real worldchallenge in this area , we formulate a new problem, called  fine-grained pat- tern matching.
Revised:  To tackle the real worldchallenge in this area , we formulate a new problem, called " fine-grained pat- tern matching.
Edit intent: fluency
Original:  It allows users to define varied deviations to different segments of a given pattern, and adaptive breakpoint of adjunct segments, which urges the dramatically increased complexity against traditional pattern matching problem over stream .
Revised:  It allows users to specify varied granularities of matching deviation to different segments of a given pattern, and adaptive breakpoint of adjunct segments, which urges the dramatically increased complexity against traditional pattern matching problem over stream .
Edit intent: clarity
Original:  It allows users to define varied deviations to different segments of a given pattern, and adaptive breakpoint of adjunct segments, which urges the dramatically increased complexity against traditional pattern matching problem over stream .
Revised:  It allows users to define varied deviations to different segments of a given pattern, and fuzzy regions for adaptive breakpoints determination between consecutive segments .
Edit intent: clarity
Original:  In the pruning phase, we propose Equal Length Block (ELB) representation and Block- Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, efficient pruning and no false dismissals.
Revised:  In the pruning phase, we introduce Equal-Length Block (ELB) representation and Block- Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, efficient pruning and no false dismissals.
Edit intent: coherence
Original:  In the pruning phase, we propose Equal Length Block (ELB) representation and Block- Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, efficient pruning and no false dismissals.
Revised:  In the pruning phase, we propose Equal Length Block (ELB) representation together with Block-Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, efficient pruning and no false dismissals.
Edit intent: clarity
Original:  In the pruning phase, we propose Equal Length Block (ELB) representation and Block- Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, efficient pruning and no false dismissals.
Revised:  In the pruning phase, we propose Equal Length Block (ELB) representation and Block- Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, effective pruning and no false dismissals.
Edit intent: clarity
Original:  In the post-processing phase, a delta-function is proposed to en- able us to conduct exact matching and determine the adaptive breakpoint in linear complexity.
Revised:  In the post-processing phase, a delta-function is proposed to enable us to conduct exact matching and determine the adaptive breakpoint in linear complexity.
Edit intent: fluency
Original:  In the post-processing phase, a delta-function is proposed to en- able us to conduct exact matching and determine the adaptive breakpoint in linear complexity.
Revised:  In the post-processing phase, a delta-function is proposed to en- able us to conduct exact matching in linear complexity.
Edit intent: clarity
Original:  Extensive experiments are evaluated on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation , by orders of magnitude .
Revised:  Extensive experiments are conducted to evaluate on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation , by orders of magnitude .
Edit intent: clarity
Original:  Extensive experiments are evaluated on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation , by orders of magnitude .
Revised:  Extensive experiments are evaluated on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation .
Edit intent: clarity
Original:  We do so by (i) recognizing Reality as an ever-present distinguished social state and (ii) always including Reality as one of the social statesunder consideration or vote (elections in which the incumbent is not running for reelection being a special case) .
Revised:  We do so by recognizing Reality as an ever-present distinguished social state and (ii) always including Reality as one of the social statesunder consideration or vote (elections in which the incumbent is not running for reelection being a special case) .
Edit intent: fluency
Original:  We then discuss the plethora of research directions opened by taking Reality into consideration: New models of  Social Choice (we discuss two such models);
Revised:  We explore the plethora of research directions opened by taking Reality into consideration: New models of Social Choice (we discuss two such models);
Edit intent: coherence
Original:  new  voting rules (we mention one such rule );
Revised:  new voting rules (we present voting rules that are simple to communicate and to implement );
Edit intent: coherence
Original:  and new game-theoretic questions related to strategic voting (we discuss one such game).
Revised:  and new game-theoretic questions related to strategic voting (we discuss one Reality-based game).
Edit intent: clarity
Original:  Here we propose to rectify this state of affairs by incorporating Reality into Social Choice .
Revised:  Here we propose to rectify this neglect and incorporate Reality into Social Choice .
Edit intent: clarity
Original:  We do so by recognizing Reality as an ever present, always relevant , evolving social state , which is distinguished from hypothetical social states , and explore the ramifications of this recognition.
Revised:  We do so by recognizing Reality as an ever-present, always-relevant , evolving social state , which is distinguished from hypothetical social states , and explore the ramifications of this recognition.
Edit intent: fluency
Original:  We do so by recognizing Reality as an ever present, always relevant , evolving social state , which is distinguished from hypothetical social states , and explore the ramifications of this recognition.
Revised:  We do so by recognizing Reality as an ever present, always relevant , evolving social state that is distinguished from hypothetical social states , and explore the ramifications of this recognition.
Edit intent: fluency
Original:  We do so by recognizing Reality as an ever present, always relevant , evolving social state , which is distinguished from hypothetical social states , and explore the ramifications of this recognition.
Revised:  We do so by recognizing Reality as an ever present, always relevant , evolving social state , which is distinguished from hypothetical social states . We explore the ramifications of this recognition.
Edit intent: fluency
Original:  Arrow's theorem was taken to show that democracy , conceived as government by the will of the people, is an incoherent illusion.
Revised:  Arrow's theorem was taken to show that democracy is an incoherent illusion.
Edit intent: clarity
Original:  As Reality-aware Social Choice renders Arrow's theorem vacuous and resolves the Condorcet voting paradox , it may clear this intellectual blemish on democracy;
Revised:  As Reality-aware Social Choice renders Arrow's theorem and resolves the Condorcet voting paradox , it may clear this intellectual blemish on democracy;
Edit intent: clarity
Original:  As Reality-aware Social Choice renders Arrow's theorem vacuous and resolves the Condorcet voting paradox , it may clear this intellectual blemish on democracy;
Revised:  As Reality-aware Social Choice renders Arrow's theorem vacuous and resolves the Condorcet paradox. Hence , it may clear this intellectual blemish on democracy;
Edit intent: clarity
Original:  pave the way for a broad application of ranked voting according to the Condorcet criterion;
Revised:  pave the way for the broad application of ranked voting according to the Condorcet criterion;
Edit intent: fluency
Original:  pave the way for a broad application of ranked voting according to the Condorcet criterion;
Revised:  pave the way for a broad application of the Condorcet criterion;
Edit intent: clarity
Original:  and , more generally, may help restore trust in democracy  .
Revised:  and help restore trust in democracy .
Edit intent: coherence
Original:  We propose to rectify this neglect and incorporate Reality into Social Choice,  by recognizing Reality as an ever-present, always-relevant, evolving social state that is distinguished from hypothetical social states .
Revised:  Here we propose to rectify this neglect and incorporate Reality into Social Choice, by recognizing Reality as an ever-present, always-relevant, evolving social state that is distinguished from hypothetical social states .
Edit intent: coherence
Original:  and (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds  . Arrow's theorem was taken to show that democracy  is an incoherent illusion.
Revised:  (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds . Arrow's theorem was taken to show that democracy is an incoherent illusion.
Edit intent: coherence
Original:  Incorporating Reality into Social Choice offers: (i) A natural way to resolve the Condorcet paradox and Condorcet cycles ;
Revised:  Incorporating Reality into Social Choice offers: (i) A natural way to resolve the Condorcet paradox and Condorcet cycles ,
Edit intent: fluency
Original:  Here we propose to rectify this neglect and incorporate Reality into Social Choice, distinguishing between Reality and hypothesis.
Revised:  Here we propose to rectify this neglect and incorporate Reality into Social Choice, distinguishing Reality from hypothesis.
Edit intent: fluency
Original:  Incorporating Reality into Social Choice offers : (i) A natural way to resolve the Condorcetparadox and Condorcet cycles, (ii) a resolution to the vexing ambiguity regarding what do approval voters , in fact, approve?
Revised:  Incorporating Reality into Social Choice offers : (i) Offers a natural resolution to Condorcet's paradox; (ii) a resolution to the vexing ambiguity regarding what do approval voters , in fact, approve?
Edit intent: clarity
Original:  Incorporating Reality into Social Choice offers : (i) A natural way to resolve the Condorcetparadox and Condorcet cycles, (ii) a resolution to the vexing ambiguity regarding what do approval voters , in fact, approve?
Revised:  Incorporating Reality into Social Choice offers : (i) A natural way to resolve the Condorcetparadox and Condorcet cycles, (ii) Explains what approval voters approve;
Edit intent: clarity
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) Produces a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: coherence
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and efficient Condorcet-consistent show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: clarity
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and practical show-of-hands agenda ; (iv) democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: coherence