wanyu/IteraTeR_v2 huggingface dataset:
Original:  To rigorously quantify previously observed tissue-level patterns of nematic cell polarity (Morales-Navarette et al., bioRxiv:495952, 2018 ), we introduce the concept of co-orientational order parameters, which generalize the known biaxial order parameters S, P, C, D from the theory of liquid crystals.
Revised:  To rigorously quantify previously observed tissue-level patterns of nematic cell polarity (Morales-Navarette et al., bioRxiv:495952, 2018 ), we introduce the concept of co-orientational order parameters, which generalize the known biaxial order parameters of the theory of liquid crystals.
Edit intent: clarity
Original:  Thus, our study characterizes liver tissue as a biological example of a biaxial liquid crystal.
Revised:  Our study characterizes liver tissue as a biological example of a biaxial liquid crystal.
Edit intent: coherence
Original:  But what if a quantum algorithm is also given "QSamples"---i.e., copies of the state |S%DIFDELCMD < \rangle %%% = \sum_{i\in S|i}%DIFDELCMD < \rangle%%% ---or even the ability to apply reflections about |S%DIFDELCMD < \rangle%%% ? Our first main result is that, even then, the algorithm needs either \Theta(N/|S|) queries or else \Theta(\min\{|S|^{1/3, N/|S|\}) reflections or samples.
Revised:  But what if a quantum algorithm is also given "QSamples"---i.e., copies of the state |S%DIFDELCMD < \rangle %%% |i}%DIFDELCMD < \rangle%%% ---or even the ability to apply reflections about |S%DIFDELCMD < \rangle%%% ? Our first main result is that, even then, the algorithm needs either \Theta(N/|S|) queries or else \Theta(\min\{|S|^{1/3, N/|S|\}) reflections or samples.
Edit intent: clarity
Original:  But what if a quantum algorithm is also given "QSamples"---i.e., copies of the state |S%DIFDELCMD < \rangle %%% = \sum_{i\in S|i}%DIFDELCMD < \rangle%%% ---or even the ability to apply reflections about |S%DIFDELCMD < \rangle%%% ? Our first main result is that, even then, the algorithm needs either \Theta(N/|S|) queries or else \Theta(\min\{|S|^{1/3, N/|S|\}) reflections or samples.
Revised:  But what if a quantum algorithm is also given "QSamples"---i.e., copies of the state |S%DIFDELCMD < \rangle %%% = \sum_{i\in S|i}%DIFDELCMD < \rangle%%% %DIFDELCMD < \rangle%%% ? Our first main result is that, even then, the algorithm needs either \Theta(N/|S|) queries or else \Theta(\min\{|S|^{1/3, N/|S|\}) reflections or samples.
Edit intent: clarity
Original:  }  We show that, even if Arthur can make T quantum queries to the set S, and also receives an  m-qubit quantum witness from Merlin in support of S being large, we have Tm = \Omega( \min\{ |S| ,\sqrt{N/|S|\}) .
Revised:  } We show that, if the algorithm makes T quantum queries to the set S, and also receives an m-qubit quantum witness from Merlin in support of S being large, we have Tm = \Omega( \min\{ |S| ,\sqrt{N/|S|\}) .
Edit intent: clarity
Original:  }  We show that, even if Arthur can make T quantum queries to the set S, and also receives an  m-qubit quantum witness from Merlin in support of S being large, we have Tm = \Omega( \min\{ |S| ,\sqrt{N/|S|\}) .
Revised:  } We show that, even if Arthur can make T quantum queries to S, and also receives an m-qubit quantum witness from Merlin in support of S being large, we have Tm = \Omega( \min\{ |S| ,\sqrt{N/|S|\}) .
Edit intent: clarity
Original:  This } \bigl( }\bigr) resolves the open problem of giving an oracle separation between SBP and QMA. Note that QMA is " stronger " than the queries+QSamplesmodel in that Merlin's witness can be anything, rather than just the specific state |S\left| \right\rangle {\sqrt{\left| S\right| }} \sum_{i\in S}|i} \rangle , but also "weaker" in that Merlin's witness cannot be trusted.
Revised:  This } \bigl( }\bigr) resolves the open problem of giving an oracle separation between SBP and QMA. Note that QMA is " QSamples " than the queries+QSamplesmodel in that Merlin's witness can be anything, rather than just the specific state |S\left| \right\rangle {\sqrt{\left| S\right| }} \sum_{i\in S}|i} \rangle , but also "weaker" in that Merlin's witness cannot be trusted.
Edit intent: clarity
Original:  This } \bigl( }\bigr) resolves the open problem of giving an oracle separation between SBP and QMA. Note that QMA is " stronger " than the queries+QSamplesmodel in that Merlin's witness can be anything, rather than just the specific state |S\left| \right\rangle {\sqrt{\left| S\right| }} \sum_{i\in S}|i} \rangle , but also "weaker" in that Merlin's witness cannot be trusted.
Revised:  This } \bigl( }\bigr) resolves the open problem of giving an oracle separation between SBP and QMA. Note that QMA is " stronger " than the queries+QSamplesmodel in that Merlin's witness can be anything, rather than just the specific state |S\left| S\right\rangle {\sqrt{\left| S\right| }} \sum_{i\in S}|i} \rangle , but also "weaker" in that Merlin's witness cannot be trusted.
Edit intent: fluency
Original:  This suggests that the "Laurent polynomial method" might be broadly useful in complexity theory\bigl(}\bigr) \bigl(\bigl\{\left| \right| , \sqrt{N/\left| S\right| }}\bigr\}\bigr)  .
Revised:  This suggests that the "Laurent polynomial method" might be broadly useful in complexity theory\bigl(\sqrt{N/\left| S\right|}\bigr) \bigl(\bigl\{\left| \right| , \sqrt{N/\left| S\right| }}\bigr\}\bigr) .
Edit intent: clarity
Original:  This suggests that the "Laurent polynomial method" might be broadly useful in complexity theory\bigl(}\bigr) \bigl(\bigl\{\left| \right| , \sqrt{N/\left| S\right| }}\bigr\}\bigr)  .
Revised:  This suggests that the "Laurent polynomial method" might be broadly useful in complexity theory\bigl(}\bigr) \bigl(\bigl\{\left| S\right| , \sqrt{N/\left| S\right| }}\bigr\}\bigr) .
Edit intent: fluency
Original:  In our second result, we ask what if, in addition to a membership oracle for S, a quantum algorithm is also given "QSamples" ---i .e., copies of the state \left| S\right\rangle = 1{\left| S\right| } \sum_{i\in S}|i\rangle --- or even access to a unitary transformation that enables QSampling?
Revised:  In our second result, we ask what if, in addition to a membership oracle for S, a quantum algorithm is also given "QSamples" -- i .e., copies of the state \left| S\right\rangle = 1{\left| S\right| } \sum_{i\in S}|i\rangle --- or even access to a unitary transformation that enables QSampling?
Edit intent: fluency
Original:  In our second result, we ask what if, in addition to a membership oracle for S, a quantum algorithm is also given "QSamples" ---i .e., copies of the state \left| S\right\rangle = 1{\left| S\right| } \sum_{i\in S}|i\rangle --- or even access to a unitary transformation that enables QSampling?
Revised:  In our second result, we ask what if, in addition to a membership oracle for S, a quantum algorithm is also given "QSamples" ---i .e., copies of the state \left| S\right\rangle = 1{\left| S\right| } \sum_{i\in S}|i\rangle -- or even access to a unitary transformation that enables QSampling?
Edit intent: fluency
Original: It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have bounded, persistent trajectories (i.e., for each trajectory x(t)\in%DIFDELCMD < \R%%% ^d_{\ge 0, the expression i=1^d |\ln(x_i(t))| is uniformly bounded in time) \mbox{ AndBounded_ONE2011,AndGAC_ONE2011}0pt }  . It is conjectured that the stochastically modeled analogs of these systems are positive recurrent.
Revised: It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have %DIFDELCMD < \R%%% ^d_{\ge 0, the expression i=1^d |\ln(x_i(t))| is uniformly bounded in time) \mbox{ AndBounded_ONE2011,AndGAC_ONE2011}0pt } . It is conjectured that the stochastically modeled analogs of these systems are positive recurrent.
Edit intent: clarity
Original: It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have bounded, persistent trajectories (i.e., for each trajectory x(t)\in%DIFDELCMD < \R%%% ^d_{\ge 0, the expression i=1^d |\ln(x_i(t))| is uniformly bounded in time) \mbox{ AndBounded_ONE2011,AndGAC_ONE2011}0pt }  . It is conjectured that the stochastically modeled analogs of these systems are positive recurrent.
Revised: It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have bounded, persistent trajectories (i.e., for each trajectory x(t)\in%DIFDELCMD < \R%%% , the expression i=1^d |\ln(x_i(t))| is uniformly bounded in time) \mbox{ AndBounded_ONE2011,AndGAC_ONE2011}0pt } . It is conjectured that the stochastically modeled analogs of these systems are positive recurrent.
Edit intent: coherence
Original:  Nevertheless , bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation.
Revised:  Unfortunately , bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation.
Edit intent: coherence
Original:  Hereby, our system, PAZZ, combines production traffic with active probes to continuously test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane).
Revised:  Hereby, our system, PAZZ, combines production traffic with active probes to periodically test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane).
Edit intent: clarity
Original:  Our network is based on an encoder-decoder architecture, where the encoder is pre-trained for the task of Automatic Speech Recognition (ASR) , and a multi-speaker waveform decoder is trained to reconstruct the original signal in an autoregressive manner.
Revised:  Our network is based on an encoder-decoder architecture, where the encoder is pre-trained for the task of Automatic Speech Recognition , and a multi-speaker waveform decoder is trained to reconstruct the original signal in an autoregressive manner.
Edit intent: clarity
Original:  We train the network on narrated audiobooks, and demonstrate the ability to perform multi-voice TTS in those voices, by converting the voice of a TTS robot .
Revised:  We train the network on narrated audiobooks, and demonstrate multi-voice TTS in those voices, by converting the voice of a TTS robot .
Edit intent: clarity
Original:  The current study investigated people's insights and information sharing behavior about cyberbullying through the text mining of tweets.
Revised:  The current study investigated people's perspectives regarding cyberbullying through the text mining of tweets.
Edit intent: clarity
Original:  English language tweets  were collected and analyzed in RStudio.
Revised:  English language tweets . English-language tweets were collected and analyzed in RStudio.
Edit intent: fluency
Original:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. , educating parents and teachers about cyberbullying ), as well as some certain events (e.g. , the Michigan cyberbullying law) that had drawn people's attention.
Revised:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. guiding parents and teachers about cyberbullying ), as well as some certain events (e.g. , the Michigan cyberbullying law) that had drawn people's attention.
Edit intent: clarity
Original:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. , educating parents and teachers about cyberbullying ), as well as some certain events (e.g. , the Michigan cyberbullying law) that had drawn people's attention.
Revised:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. , educating parents and teachers about cyberbullying ), as well as some certain events (e.g. the Michigan cyberbullying law) that had drawn people's attention.
Edit intent: fluency
Original:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. , educating parents and teachers about cyberbullying ), as well as some certain events (e.g. , the Michigan cyberbullying law) that had drawn people's attention.
Revised:  Analyzing cyberbullying tweets revealed some of the major actions that needed to be taken into consideration (e.g. , educating parents and teachers about cyberbullying ), as well as some certain events (e.g. , the Michigan cyberbullying law) , and (c) people's attention.
Edit intent: coherence
Original: Parents, and teachers seem to be having an important role in educating, informing, warning, preventing, and protecting  cyberbullying behaviors.
Revised: Parents, and teachers seem to have an important role in educating, informing, warning, preventing, and protecting cyberbullying behaviors.
Edit intent: fluency
Original: Parents, and teachers seem to be having an important role in educating, informing, warning, preventing, and protecting  cyberbullying behaviors.
Revised: Parents, and teachers seem to be having an important role in educating, informing, warning, preventing, and protecting against cyberbullying behaviors.
Edit intent: clarity
Original:  Strong correlation was found among girl, photo  and shared, which may represent that girls are more likely to experience appearance-related cyberbullying than boys.
Revised:  A strong correlation was found among girl, photo and shared, which may represent that girls are more likely to experience appearance-related cyberbullying than boys.
Edit intent: clarity
Original:  Strong correlation was found among girl, photo  and shared, which may represent that girls are more likely to experience appearance-related cyberbullying than boys.
Revised:  Strong correlation was found among girl, photo , and shared, which may represent that girls are more likely to experience appearance-related cyberbullying than boys.
Edit intent: fluency
Original: This study investigated people's perspectives regarding cyberbullyingthrough the use of text mining tweets . English-language tweets were collected and analyzed in RStudio .
Revised: This study used text mining to investigate people's perspectives regarding cyberbullyingthrough the use of text mining tweets . English-language tweets were collected and analyzed in RStudio .
Edit intent: clarity
Original: This study investigated people's perspectives regarding cyberbullyingthrough the use of text mining tweets . English-language tweets were collected and analyzed in RStudio .
Revised: This study investigated people's insights about cyberbullying . English-language tweets were collected and analyzed in RStudio .
Edit intent: clarity
Original: This study investigated people's perspectives regarding cyberbullyingthrough the use of text mining tweets . English-language tweets were collected and analyzed in RStudio .
Revised: This study investigated people's perspectives regarding cyberbullyingthrough the use of text mining tweets . English-language tweets were collected and analyzed by R software .
Edit intent: clarity
Original:  Our analysis demonstrated three major themes: (a) the major actions that needed to be taken into consideration (e.g. guiding parents and teachers to cyberbullying prevention, funding schools to fight cyberbullying), (b) certain events that were important to people (e.g. the Michigan cyberbullying law), and (c) people's major concerns in this regard (e.g. the mental health issues among students).
Revised:  Our analysis demonstrated three major themes: (a) the major actions that needed to be taken into consideration (e.g. guiding parents and teachers to cyberbullying prevention, funding schools to fight cyberbullying), (b) certain events that were important to people (e.g. the Michigan cyberbullying law), and (c) people's major concerns in this regard (e.g. mental health issues among students).
Edit intent: fluency
Original:  Parents and teachers seem to have an important role in educating, informing, warning, preventing, and protecting against cyberbullying behaviors.
Revised:  Parents and teachers have an important role in educating, informing, warning, preventing, and protecting against cyberbullying behaviors.
Edit intent: coherence
Original: Intelligent personal assistant systems , with either text-based or voice-based conversational interfaces, are becoming increasingly popular.
Revised: Intelligent personal assistant systems that are able to have multi-turn conversations with human users are becoming increasingly popular.
Edit intent: clarity
Original:  Most previous research has used either retrieval-based or generation-based methods  . Retrieval-based methods have the advantage of returning fluent and informative responses with great diversity.
Revised:  Most previous research has been focused on using either retrieval-based or generation-based methods . Retrieval-based methods have the advantage of returning fluent and informative responses with great diversity.
Edit intent: clarity
Original:  However, the response retrieval performance is limited by the size of the response repository.
Revised:  However, the performance of the methods is limited by the size of the response repository.
Edit intent: clarity
Original:  On the other hand, although generation-based methods can return highly coherent responses given conversation context, they are likely to return universal or general responses with insufficient ground knowledgeinformation .
Revised:  On the other hand, generation-based methods can return highly coherent responses given conversation context, they are likely to return universal or general responses with insufficient ground knowledgeinformation .
Edit intent: coherence
Original:  On the other hand, although generation-based methods can return highly coherent responses given conversation context, they are likely to return universal or general responses with insufficient ground knowledgeinformation .
Revised:  On the other hand, although generation-based methods can produce highly coherent responses given conversation context, they are likely to return universal or general responses with insufficient ground knowledgeinformation .
Edit intent: clarity
Original:  On the other hand, although generation-based methods can return highly coherent responses given conversation context, they are likely to return universal or general responses with insufficient ground knowledgeinformation .
Revised:  On the other hand, although generation-based methods can return highly coherent responses on any topics. But the generated responses are often generic and not informative due to the lack of grounding knowledge .
Edit intent: clarity
Original:  In this paper, we build a hybrid neural conversation model with the capability of both response retrieval and generation , in order to combine the merits of these two types of methods.
Revised:  In this paper, we propose a hybrid neural conversation model with the capability of both response retrieval and generation , in order to combine the merits of these two types of methods.
Edit intent: clarity
Original:  In this paper, we build a hybrid neural conversation model with the capability of both response retrieval and generation , in order to combine the merits of these two types of methods.
Revised:  In this paper, we build a hybrid neural conversation model that combines the merits of both response retrieval and generation , in order to combine the merits of these two types of methods.
Edit intent: clarity
Original:  In this paper, we build a hybrid neural conversation model with the capability of both response retrieval and generation , in order to combine the merits of these two types of methods.
Revised:  In this paper, we build a hybrid neural conversation model with the capability of both response retrieval and generation methods.
Edit intent: coherence
Original:  Experimental results on Twitter and Foursquare data show that the proposed model can outperform both retrieval-based methods and generation-based methods (including a recently proposed knowledge-grounded neural conversation model) under both automatic evaluation metrics and human evaluation.
Revised:  Experimental results on Twitter and Foursquare data show that the proposed model outperforms both retrieval-based methods and generation-based methods (including a recently proposed knowledge-grounded neural conversation model) under both automatic evaluation metrics and human evaluation.
Edit intent: clarity
Original:  Our models and research findings provide new insights on how to integrate text retrieval and text generation models for building conversation systems.
Revised:  We hope that the findings in this study provide new insights on how to integrate text retrieval and text generation models for building conversation systems.
Edit intent: clarity
Original:  This approach is both time-consuming and inefficient.
Revised:  This approach is time-consuming and inefficient.
Edit intent: clarity
Original:  Furthermore, modern neural networks often contain millions of parameters, whereas many applications  require small inference models.
Revised:  Another issue is that modern neural networks often contain millions of parameters, whereas many applications require small inference models.
Edit intent: coherence
Original:  Furthermore, modern neural networks often contain millions of parameters, whereas many applications  require small inference models.
Revised:  Furthermore, modern neural networks often contain millions of parameters, whereas many applications and devices require small inference models.
Edit intent: clarity
Original:  We also evaluate the efficiency of using dimensionality reduction alongside SCANN  on nine small to medium-size datasets.
Revised:  We also evaluate the efficacy of using dimensionality reduction alongside SCANN on nine small to medium-size datasets.
Edit intent: clarity
Original:  We consider the case when at most p\le d nodes \{x_j\} of F form a cluster of size h\ll\frac{1{\Omega}}  \over , while the rest of the nodes are well separated.
Revised:  We consider the case when at most p\le d nodes \{x_j\} of F form a cluster {\Omega}} \over , while the rest of the nodes are well separated.
Edit intent: clarity
Original:  Provided that \epsilon \lessapprox %DIFDELCMD < \left(\Omegah\right)%%% , where SRF=(\Omega\Delta)} ^{ 2p-1 }  , we show that the minimax error rate for reconstruction of the cluster nodes is of order (%DIFDELCMD < \Omegah%%% )\SUPERSCRIPT -2p+ 1 \over { } h \epsilon, while for recovering the corresponding amplitudes \{a_j\} the rate is of the order (\Omega h) ^{ -2p+1 }\epsilon.
Revised:  Provided that \epsilon \lessapprox %DIFDELCMD < \left(\Omegah\right)%%% , where SRF=(\Omega\Delta)} ^{ -1 } , we show that the minimax error rate for reconstruction of the cluster nodes is of order (%DIFDELCMD < \Omegah%%% )\SUPERSCRIPT -2p+ 1 \over { } h \epsilon, while for recovering the corresponding amplitudes \{a_j\} the rate is of the order (\Omega h) ^{ -2p+1 }\epsilon.
Edit intent: fluency
Original:  Provided that \epsilon \lessapprox %DIFDELCMD < \left(\Omegah\right)%%% , where SRF=(\Omega\Delta)} ^{ 2p-1 }  , we show that the minimax error rate for reconstruction of the cluster nodes is of order (%DIFDELCMD < \Omegah%%% )\SUPERSCRIPT -2p+ 1 \over { } h \epsilon, while for recovering the corresponding amplitudes \{a_j\} the rate is of the order (\Omega h) ^{ -2p+1 }\epsilon.
Revised:  Provided that \epsilon \lessapprox %DIFDELCMD < \left(\Omegah\right)%%% , where SRF=(\Omega\Delta)} ^{ 2p-1 } , we show that the minimax error rate for reconstruction of the cluster nodes is of order %DIFDELCMD < \Omegah%%% )\SUPERSCRIPT -2p+ 1 \over { } h \epsilon, while for recovering the corresponding amplitudes \{a_j\} the rate is of the order (\Omega h) ^{ -2p+1 }\epsilon.
Edit intent: fluency