wanyu/IteraTeR_v2 huggingface dataset:
Original:  On the opposite end  , there exists a wide expanse of data that is intractable for direct analysis owing to its unstructured nature .
Revised:  On the opposite end of the spectrum , there exists a wide expanse of data that is intractable for direct analysis owing to its unstructured nature .
Edit intent: clarity
Original:  These can be found in the form of discharge summaries, clinical notes, procedural notes which are in human written free text format and neither have any relational model nor any standard grammatical structure.
Revised:  These can be found in the form of discharge summaries, clinical notes, procedural notes which are in human written narrative format and neither have any relational model nor any standard grammatical structure.
Edit intent: clarity
Original:  An important step in  utilization of these texts for such studies is to transform and process the data to retrieve structured information from the haystack of irrelevant data using information retrieval and data mining techniques.
Revised:  An important step in the utilization of these texts for such studies is to transform and process the data to retrieve structured information from the haystack of irrelevant data using information retrieval and data mining techniques.
Edit intent: fluency
Original:  In this paper, we present Q-Map  , which is a simple yet powerful system that can sift through these datasets to retrieve structured information aggressively and efficiently.
Revised:  In this paper, we present Q-Map , which is a simple yet robust system that can sift through these datasets to retrieve structured information aggressively and efficiently.
Edit intent: clarity
Original:  We also present its comparative performance with MetaMap, one of the most reputed tools for medical concepts retrieval  .
Revised:  The authors also briefly examine its comparative performance with MetaMap, one of the most reputed tools for medical concepts retrieval .
Edit intent: clarity
Original:  This has led CASP systems to devise several methods to overcome this issue  : restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned.
Revised:  Several methods to overcome this issue : restricting the constraint domains (e.g., discrete instead of dense), or the type (or number) of models that can be returned.
Edit intent: clarity
Original:  The resulting model, s(CASP), can constrain variables that ( as in CLP ) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver.
Revised:  The resulting model, s(CASP), can constrain variables that , as in CLP ) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver.
Edit intent: fluency
Original:  The resulting model, s(CASP), can constrain variables that ( as in CLP ) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver.
Revised:  The resulting model, s(CASP), can constrain variables that ( as in CLP , are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver.
Edit intent: fluency
Original:  The resulting model, s(CASP), can constrain variables that ( as in CLP ) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver.
Revised:  The resulting model, s(CASP), can constrain variables that ( as in CLP ) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) and is parametric w.r.t. the constraint solver.
Edit intent: coherence
Original:  We describe this novel execution model and show , through several examples , the enhanced expressiveness of s(CASP) w.r.t.
Revised:  We describe this novel execution model and show through several examples , the enhanced expressiveness of s(CASP) w.r.t.
Edit intent: fluency
Original:  We describe this novel execution model and show , through several examples , the enhanced expressiveness of s(CASP) w.r.t.
Revised:  We describe this novel execution model and show , through several examples the enhanced expressiveness of s(CASP) w.r.t.
Edit intent: fluency
Original: Monitoring the distribution of microfossils in stratigraphic successions is an essential tool for biostratigraphic graphic , evolutionary and paleoecologic/paleoceanographic studies.
Revised: Monitoring the distribution of microfossils in stratigraphic successions is an essential tool for biostratigraphic , evolutionary and paleoecologic/paleoceanographic studies.
Edit intent: fluency
Original:  Easy-to-use extensive tables , with computed values of n, for a large combination of K and p are presented .
Revised:  Easy-to-use extensive tables show n, for a large combination of K and p are presented .
Edit intent: clarity
Original:  Easy-to-use extensive tables , with computed values of n, for a large combination of K and p are presented .
Revised:  Easy-to-use extensive tables , with computed values of n, for a combination of K and p are presented .
Edit intent: clarity
Original:  Easy-to-use extensive tables , with computed values of n, for a large combination of K and p are presented .
Revised:  Easy-to-use extensive tables , with computed values of n, for a large combination of K and p .
Edit intent: clarity
Original:  We ~ address the problem of partial control in the synthesis of test cases from timed-automata specifications.
Revised:  We address the problem of partial control in the synthesis of test cases from timed-automata specifications.
Edit intent: fluency
Original:  Building on the tioco timed testing framework, we ~ extend a previous game interpretation of the test-synthesis problem from the untimed to the timed setting.
Revised:  Building on the tioco timed testing framework, we extend a previous game interpretation of the test-synthesis problem from the untimed to the timed setting.
Edit intent: fluency
Original: `Biologically inspired' activation functions, such as the logistic sigmoid, have been instrumental in the historical development of machine learning techniques .
Revised: `Biologically inspired' activation functions, such as the logistic sigmoid, have been instrumental in the historical advancement of machine learning techniques .
Edit intent: clarity
Original: `Biologically inspired' activation functions, such as the logistic sigmoid, have been instrumental in the historical development of machine learning techniques .
Revised: `Biologically inspired' activation functions, such as the logistic sigmoid, have been instrumental in the historical development of machine learning .
Edit intent: clarity
Original:  However in the field of deep learning, they have been largely displaced by rectified  (ReLU) or exponential (ELU) linear units to mitigate the effects of vanishing gradients associated with error back-propagation.
Revised:  However in the field of deep learning, they have been largely displaced by rectified linear units (ReLU) or exponential (ELU) linear units to mitigate the effects of vanishing gradients associated with error back-propagation.
Edit intent: fluency
Original:  The logistic sigmoid however does not represent the true input-output relation in real neurones under physiological conditions.
Revised:  The logistic sigmoid however does not represent the true input-output relation in neuronal cells under physiological conditions.
Edit intent: clarity
Original:  Here, radical root unit ( RRU ) activation functions are introduced, exhibiting input-output non-linearities that are substantially more biologically plausible since their functional form is based on known current-frequency relationships .
Revised:  Here, radical root unit ( RRU ) activation functions are introduced, exhibiting input-output non-linearities that are substantially more biologically plausible since their functional form is based on known biophysical properties of neuronal cells .
Edit intent: clarity
Original:  In order to evaluate whether RRU activations improve deep learning performance , networks are constructed with identical architectures except differing in their transfer functions (ReLU, ELU, and RRUs ).
Revised:  In order to evaluate the learning performance of BRU activations, deep networks are constructed with identical architectures except differing in their transfer functions (ReLU, ELU, and RRUs ).
Edit intent: clarity
Original:  In order to evaluate whether RRU activations improve deep learning performance , networks are constructed with identical architectures except differing in their transfer functions (ReLU, ELU, and RRUs ).
Revised:  In order to evaluate whether RRU activations improve deep learning performance , networks are constructed with identical architectures except differing in their transfer functions (ReLU, ELU, and BRU ).
Edit intent: clarity
Original:  Results of learning performance, quantified using loss and error measurements, demonstrate that the RRU networks not only train faster than their ReLU and ELU counterparts , but also lead to improved generalised models in the absence of formal regularisation.
Revised:  Results of learning performance, quantified using loss and error measurements, demonstrate that bionodal networks both train faster than their ReLU and ELU counterparts , but also lead to improved generalised models in the absence of formal regularisation.
Edit intent: clarity
Original:  Results of learning performance, quantified using loss and error measurements, demonstrate that the RRU networks not only train faster than their ReLU and ELU counterparts , but also lead to improved generalised models in the absence of formal regularisation.
Revised:  Results of learning performance, quantified using loss and error measurements, demonstrate that the RRU networks not only train faster than their ReLU and ELU counterparts and result in the best generalised models even in the absence of formal regularisation.
Edit intent: clarity
Original:  These results therefore confirm that revisiting the  properties of biological neurones and their circuitry might prove invaluable in the field of deep learning  .
Revised:  These results therefore suggest that revisiting the properties of biological neurones and their circuitry might prove invaluable in the field of deep learning .
Edit intent: clarity
Original:  The objective is to optimize a  QoE metric that models a combination of the three objectives of minimizing the stall/skip duration of the video, maximizing a concave function of the playback quality averaged over the chunks , and minimizing the number of quality switches.
Revised:  The objective is to optimize a QoE metric that models a combination of the three objectives of minimizing the stall/skip duration of the video, maximizing the playback quality averaged over the chunks , and minimizing the number of quality switches.
Edit intent: clarity
Original:  The objective is to optimize a  QoE metric that models a combination of the three objectives of minimizing the stall/skip duration of the video, maximizing a concave function of the playback quality averaged over the chunks , and minimizing the number of quality switches.
Revised:  The objective is to optimize a QoE metric that models a combination of the three objectives of minimizing the stall/skip duration of the video, maximizing a concave function of the playback quality of every chunk , and minimizing the number of quality switches.
Edit intent: clarity
Original:  By using a perturbation method, the approximate analytical solutions have been found  .
Revised:  The approximate analytical solutions have been found .
Edit intent: coherence
Original:  By using a perturbation method, the approximate analytical solutions have been found  .
Revised:  By using a perturbation method, the approximate analytical solutions have been found by using a perturbation method .
Edit intent: coherence
Original:  The wave speed  increases with the ratio of the growth rate to the damped rate and reaches a limited value, equivalent to the speed of sound, at the large value of the rate ratio.
Revised:  The wave speed increases with the ratio of the growth rate to the damped rate---and it reaches a limited value, equivalent to the speed of sound, at the large value of the rate ratio.
Edit intent: clarity
Original: We investigate a flux limited reaction-diffusion equation , which is an extension of the generalized Fisher-Kolmogorov-Petrovsky-Piskunov (Fisher-KPP) equation , in one-dimensional space.
Revised: We investigate a flux limited reaction-diffusion equation , which is an extension of the generalized Fisher-Kolmogorov-Petrovsky-Piskunov (Fisher-KPP) equation in one-dimensional space.
Edit intent: fluency
Original: In this paper , we investigate a porous medium-type flux limited reaction-diffusion equation arising in morphogenesis modeling.
Revised: In this study , we investigate a porous medium-type flux limited reaction-diffusion equation arising in morphogenesis modeling.
Edit intent: clarity
Original: In this paper , we investigate a porous medium-type flux limited reaction-diffusion equation arising in morphogenesis modeling.
Revised: In this paper , we investigate a porous medium-type flux limited reaction--diffusion equation that arises in morphogenesis modeling.
Edit intent: fluency
Original:  This nonlinear partial differential equation is an extension of the generalized Fisher-Kolmogorov-Petrovsky-Piskunov (Fisher-KPP) equation in one-dimensional space.
Revised:  This nonlinear partial differential equation is an extension of the generalized Fisher--Kolmogorov--Petrovsky--Piskunov (Fisher-KPP) equation in one-dimensional space.
Edit intent: fluency
Original:  The approximate analytical traveling wave solution has been found by using a perturbation method.
Revised:  The approximate analytical traveling wave solution is found by using a perturbation method.
Edit intent: clarity
Original:  It reveals that the morphogen concentration propagates as a sharp wavefront where the wave speed has a saturated value.
Revised:  We show that the morphogen concentration propagates as a sharp wavefront where the wave speed has a saturated value.
Edit intent: clarity
Original:  It reveals that the morphogen concentration propagates as a sharp wavefront where the wave speed has a saturated value.
Revised:  It reveals that the morphogen concentration propagates as a sharp wave front where the wave speed has a saturated value.
Edit intent: fluency
Original:  The numerical solutions of this equation have been also provided , in order to compare with the analytical predictions.
Revised:  The numerical solutions of this equation are also provided to compare them with the analytical predictions.
Edit intent: clarity
Original:  Finally, we qualitatively compare our theoretical results with the experimental studies.
Revised:  Finally, we qualitatively compare our theoretical results with those obtained in experimental studies.
Edit intent: clarity
Original:  This is frequently done either through negative sampling ( point-wise loss) or with a ranking loss function ( pair- or list-wise estimation).
Revised:  This is frequently done either through negative sampling ( point--wise loss) or with a ranking loss function ( pair- or list-wise estimation).
Edit intent: fluency
Original:  This is frequently done either through negative sampling ( point-wise loss) or with a ranking loss function ( pair- or list-wise estimation).
Revised:  This is frequently done either through negative sampling ( point-wise loss) or with a ranking loss function ( pair-- or list--wise estimation).
Edit intent: fluency
Original:  In this paper we propose a novel objective function, the Missing Information Loss (MIL) function , that explicitly forbids treating unobserved user-item interactions as positive or negative feedback.
Revised:  In this paper we propose a novel objective function, the Missing Information Loss (MIL) function , that explicitly forbids treating unobserved user-item interactions as positive or negative feedback.
Edit intent: fluency
Original:  In this paper we propose a novel objective function, the Missing Information Loss (MIL) function , that explicitly forbids treating unobserved user-item interactions as positive or negative feedback.
Revised:  In this paper we propose a novel objective function, the Missing Information Loss (MIL) , that explicitly forbids treating unobserved user-item interactions as positive or negative feedback.
Edit intent: clarity
Original:  We apply this loss to a user--based Denoising Autoencoder  and compare it with other known objective functions such as cross-entropy (both point-- and pair--wise ) or the recently proposed multinomial log-likelihood.
Revised:  We apply this loss to a user--based Denoising Autoencoder , and compare it with other known objective functions such as cross-entropy (both point-- and pair--wise ) or the recently proposed multinomial log-likelihood.
Edit intent: fluency
Original:  We apply this loss to a user--based Denoising Autoencoder  and compare it with other known objective functions such as cross-entropy (both point-- and pair--wise ) or the recently proposed multinomial log-likelihood.
Revised:  We apply this loss to a user--based Denoising Autoencoder and compare it with other established objective functions such as cross-entropy (both point-- and pair--wise ) or the recently proposed multinomial log-likelihood.
Edit intent: clarity
Original:  We apply this loss to a user--based Denoising Autoencoder  and compare it with other known objective functions such as cross-entropy (both point-- and pair--wise ) or the recently proposed multinomial log-likelihood.
Revised:  We apply this loss to a user--based Denoising Autoencoder and compare it with other known objective functions such as cross-entropy (both point- and pair-wise ) or the recently proposed multinomial log-likelihood.
Edit intent: fluency
Original:  The MIL function achieves best results in ranking-aware metrics when applied to the Movielens-20M and Netflix datasets, slightly above those obtained with cross-entropy in point-wise estimation .
Revised:  MIL achieves competitive performance in ranking-aware metrics when applied to the Movielens-20M and Netflix datasets, slightly above those obtained with cross-entropy in point-wise estimation .
Edit intent: clarity
Original:  The MIL function achieves best results in ranking-aware metrics when applied to the Movielens-20M and Netflix datasets, slightly above those obtained with cross-entropy in point-wise estimation .
Revised:  The MIL function achieves best results in ranking-aware metrics when applied to three datasets .
Edit intent: clarity
Original:  Furthermore, such a competitive performance is obtained while recommending popular items less frequently , a valuable feature for\\%DIF > \\%DIF > increase of long-tail recommendations), a valuable feature for Recommender Systems with a large catalogue of products.
Revised:  Furthermore, we show that such a relevance in the recommendation is obtained while recommending popular items less frequently , a valuable feature for\\%DIF > \\%DIF > increase of long-tail recommendations), a valuable feature for Recommender Systems with a large catalogue of products.
Edit intent: clarity
Original:  Furthermore, such a competitive performance is obtained while recommending popular items less frequently , a valuable feature for\\%DIF > \\%DIF > increase of long-tail recommendations), a valuable feature for Recommender Systems with a large catalogue of products.
Revised:  Furthermore, such a competitive performance is obtained while displaying popular items less frequently , a valuable feature for\\%DIF > \\%DIF > increase of long-tail recommendations), a valuable feature for Recommender Systems with a large catalogue of products.
Edit intent: clarity
Original:  Hence, the visuo-haptic VR traffic necessitates  use of two different network slices: enhanced mobile broadband (eMBB) for visual perception and ultra-reliable and low latency communication (URLLC) for haptic perception.
Revised:  Hence, the visuo-haptic VR traffic necessitates the use of two different network slices: enhanced mobile broadband (eMBB) for visual perception and ultra-reliable and low latency communication (URLLC) for haptic perception.
Edit intent: fluency
Original:  We investigate two methods by which these two slices are sharing the downlink resources orthogonally and non-orthogonally, respectively.
Revised:  We investigate two methods by which these two slices share the downlink resources orthogonally and non-orthogonally, respectively.
Edit intent: clarity
Original:  We compare these methods in terms of  just-noticeable difference (JND), an established measure in psychophysics, and show that non-orthogonal slicing becomes preferable under a higher target integrated-perceptual resolution and/or a higher target rate for haptic perceptions.
Revised:  We compare these methods in terms of the just-noticeable difference (JND), an established measure in psychophysics, and show that non-orthogonal slicing becomes preferable under a higher target integrated-perceptual resolution and/or a higher target rate for haptic perceptions.
Edit intent: fluency
Original: This paper develops a dynamic semantics for incomplete functional programs, based in part on the static semantics for incomplete functional programs developed in our recent work  .
Revised: This paper develops a dynamic semantics for incomplete functional programs, starting from the static semantics for incomplete functional programs developed in our recent work .
Edit intent: clarity
Original:  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:  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: fluency
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 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.
Edit intent: clarity
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 " 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.
Edit intent: fluency
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 " 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.
Edit intent: fluency