wanyu/IteraTeR_full_sent huggingface dataset:
Original:  which is quantified by equalities-involved permutation relative entropy in our nonlinear dynamics analysis of heart rates . Equal values are not rare in discrete heartbeats because of the limits of resolution of signals collection, and more importantly equal states contain underlying important cardiac regulation information which is neglected by the original permutative method and some measurements of time irreversibility .
Revised:  which is quantified by equalities-involved permutation relative entropy in our nonlinear dynamics analysis of heart rates . Equal values are not rare in discrete heartbeats because of the limits of resolution of signals collection, and more importantly equal states contain underlying important cardiac regulation information which is neglected by some chaotic deterministic parameters and temporal asymmetric measurements .
Edit intent: clarity
Original:  The relative entropy of modified permutation associated with equal states  shows advantages to these time irreversibility parameters and has great improvements to that of the original permutation. The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Revised:  The relative entropy of modified permutation associated with equal states shows advantages to some nonlinear dynamics parameters without considering equalities. Researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Edit intent: clarity
Original:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Revised:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic divergence of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Edit intent: clarity
Original:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Revised:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging reduce the nonlinear dynamical complexity , of human heartbeats .
Edit intent: coherence
Original:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity , of human heartbeats .
Revised:  The temporal irreversibility researches on cardiac activities suggest the highest probabilistic asymmetry of the healthy young heart rates and highlight the facts that heart diseases and aging broke asymmetry, or reduce the nonlinear dynamical complexity of heart rates .
Edit intent: clarity
Original:  This model is appropriate whenever a consumer's demand over a %DIFDELCMD < {\em %%% strict subset of all available goods is being analyzed . For the random utility extension of the model, we devise nonparametric statistical procedures for testing and welfare comparisons. The latter requires the development of novel tests of linear hypotheses for partially identified parameters .
Revised:  This model is appropriate whenever a consumer's demand over a %DIFDELCMD < {\em %%% strict subset of all available goods is being analyzed ; it can also be extended to settings with discrete goods and nonlinear prices. To illustrate its use, we apply our model to a single-agent data set and to a data set with repeated cross-sections. We develop a novel test of linear hypotheses for partially identified parameters .
Edit intent: meaning-changed
Original:  The latter requires the development of novel tests of linear hypotheses for partially identified parameters . In doing so, we provide new algorithms for the calculation and statistical inference in nonparametric counterfactual analysis for a general partially identified model.
Revised:  The latter requires the development of novel tests of linear hypotheses for partially identified parameters to estimate the proportion of the population who are revealed better off due to a price change in the latter application. This new technique can be used for nonparametric counterfactual analysis for a general partially identified model.
Edit intent: meaning-changed
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMS ) using the W3C standardized SPARQL and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: fluency
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL query language and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: clarity
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL and avoid the learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: clarity
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL and avoid the steep learning curve of a new Graph Query Language . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: fluency
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a system-agnostic traversal language covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: clarity
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors , thus making it a desirable choice for supporting interoperability for querying Graph DMSs.
Edit intent: coherence
Original:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL  and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability for querying Graph DMSs.
Revised:  This allows to access and query a wide variety of Graph Data Management Systems ( DMSs ) using the W3C standardized SPARQL and avoid the steep learning curve of a new Graph Query Language (GQL) . Gremlin is a graph computing system agnostic traversal language ( covering both OLTP graph database or OLAP graph processors ), making it a desirable choice for supporting interoperability wrt. querying Graph DMSs.
Edit intent: fluency
Original:  We present an empirical evaluation for the validity of our approach by formalizing the graph pattern matching construct of Gremlin and illustrate its mapping to corresponding SPARQL queries. Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB).
Revised:  We present a comprehensive empirical evaluation of Gremlinator and demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB).
Edit intent: clarity
Original:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB).
Revised:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of the leading graph stores Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB).
Edit intent: fluency
Original:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB).
Revised:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph and compare the performance with the RDF stores Virtuoso, 4Store , and JenaTDB).
Edit intent: clarity
Original:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store , and JenaTDB). The results indicate that, for complex queries (such as Star-shaped), Gremlin pattern matching traversals out-perform their corresponding SPARQL queries significantly, including their translation time. Gremlinator currently covers a subset of the SPARQL 1.0 specification, specifically the SELECT queries.
Revised:  Moreover, we also present a proof-of-concept implementation of our approach, demonstrate its validity and applicability by executing SPARQL queries on top of leading Graph stores ( Neo4J, Sparksee, and Apache TinkerGraph ) and compare their performances with RDF stores (Openlink Virtuoso, 4Store and JenaTDB. Our evaluation demonstrates the substantial performance gain obtained by the Gremlin counterparts of the SPARQL 1.0 specification, specifically the SELECT queries.
Edit intent: clarity
Original: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity  .
Revised: In this paper we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity .
Edit intent: fluency
Original: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity  .
Revised: In this paper , we estimate a Bayesian vector autoregressive model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity .
Edit intent: clarity
Original: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity  .
Revised: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity .
Edit intent: clarity
Original: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity  .
Revised: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to treat macroeconomic uncertainty as a latent quantity .
Edit intent: clarity
Original: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity  .
Revised: In this paper , we estimate a Bayesian vector autoregressive (VAR) model with factor stochastic volatility in the error term to assess the effects of an uncertainty shock in the Euro area (EA) . This allows us to incorporate uncertainty directly into the econometric framework and treat it as a latent quantity during estimation .
Edit intent: clarity
Original:  We analyze the special case of a shock restricted to the Euro area, whose countries are highly related by definition. Among other variables, we find significant results of a decrease in real activity measured by GDP in most Euro area countries over a period of roughly a year following an uncertainty shock  .
Revised:  We analyze the special case of a shock restricted to the Euro area, whose countries are highly related by construction. We find significant results of a decrease in real activity measured by GDP in most Euro area countries over a period of roughly a year following an uncertainty shock .
Edit intent: clarity
Original:  Among other variables, we find significant results of a decrease in real activity measured by GDP in most Euro area countries over a period of roughly a year following an uncertainty shock  .
Revised:  Among other variables, we find significant results of a decrease in real activity measured by GDP in most Euro area countries over a period of roughly a year following an uncertainty shock . Moreover, equity prices, short-term interest rates and exports tend to decline, while unemployment levels increase. Dynamic responses across countries differ slightly in magnitude and duration, with Ireland, Slovakia and Greece exhibiting different reactions for some macroeconomic fundamentals .
Edit intent: meaning-changed
Original: This paper considers the problem of predicting the number of claims that have already incurred in past exposure years , but which have not yet been reported to the insurer. This is an important building block in the risk management strategy of an insurer since the company should be able to fulfill its liabilities with respect to such claims .
Revised: This paper considers the problem of predicting the number of claims that have already incurred in past exposure years , but which are not yet observed due to a delay. Such delayed events are relevant in predicting the future cost of warranties, pricing maintenance contracts, determining the number of unreported claims in insurance and in modeling the outbreak of diseases. Disregarding these unobserved events results in a systematic underestimation of the event occurrence process.
Edit intent: meaning-changed
Original:  Our approach puts emphasis on modeling the time between the occurrence and reporting of claims , the so-called reporting delay. Using data at a daily level we propose a micro-level model for the heterogeneity in reporting delay caused by calendar day effects in the reporting process, such as the weekday pattern and holidays.
Revised:  Our approach puts emphasis on modeling the time between the occurrence and reporting of claims , the so-called observation delay. We propose a granular model for the heterogeneity in reporting delay caused by calendar day effects in the reporting process, such as the weekday pattern and holidays.
Edit intent: clarity
Original:  Using data at a daily level we propose a micro-level model for the heterogeneity in reporting delay caused by calendar day effects in the reporting process, such as the weekday pattern and holidays.
Revised:  Using data at a daily level we propose a micro-level model for the heterogeneity in this observation delay based on the occurrence day of the event and on calendar day effects in the reporting process, such as the weekday pattern and holidays.
Edit intent: clarity
Original:  Using data at a daily level we propose a micro-level model for the heterogeneity in reporting delay caused by calendar day effects in the reporting process, such as the weekday pattern and holidays. A simulation study identifies the strengths and weaknesses of our approach in several scenarios compared to traditional methods to predict the number of incurred but not reported claims from aggregated data (i.e. the chain ladder method). We also illustrate our model on a European general liability insurance data set and conclude that the granular approach compared to the chain ladder method is more robust with respect to volatility in the occurrence process.
Revised:  Using data at a daily level we propose a micro-level model for the heterogeneity in reporting delay caused by calendar day effects in the reporting process, such as weekday and holiday effects. We illustrate this approach on a European general liability insurance data set and conclude that the granular approach compared to the chain ladder method is more robust with respect to volatility in the occurrence process.
Edit intent: coherence
Original:  We also illustrate our model on a European general liability insurance data set and conclude that the granular approach compared to the chain ladder method is more robust with respect to volatility in the occurrence process. Our framework can be extended to other predictive problems where interest goes to events that incurred in the past but which are subject to an observation delay(e.g. the number of infections during an epidemic) .
Revised:  We also illustrate our model on a European general liability insurance data set where the occurrence of an accident is reported to the insurer with delay .
Edit intent: clarity
Original:  Hence the development of novel methodologies that can automatically analyze textual sources, extract facts and knowledge, and produce summarized representations that capture the most relevant information is a timely and pressing need. We present INtERAcT, a novel approach to infer interactions between molecular entities extracted from literature using an unsupervised procedure that takes advantage of recent developments in automatic text mining and text analysis.
Revised:  Here we present INtERAcT, a novel approach to infer interactions between molecular entities extracted from literature using an unsupervised procedure that takes advantage of recent developments in automatic text mining and text analysis.
Edit intent: coherence