wanyu/IteraTeR_full_sent huggingface dataset:
Original:  To interpret ambiguous, context-dependent prepositions (e.g. ~ front), we propose a convolutional neural network model that learns to predict the language provider's relative frame of reference (FoR) given  environment context.
Revised:  To interpret ambiguous, context-dependent prepositions (e.g. ~ front), we propose a convolutional neural network model that learns to predict the language provider's relative frame of reference (FoR) given the environment context.
Edit intent: fluency
Original:  We demonstrate the generalizability of our FoR prediction model and object search system through cross-validation over areas of five cities , each with a 40,000m^2 footprint.
Revised:  Search strategies are computed via an online POMDP planner based on Monte Carlo Tree Search. Evaluation based on crowdsourced language data, collected over areas of five cities , each with a 40,000m^2 footprint.
Edit intent: meaning-changed
Original:  We demonstrate the generalizability of our FoR prediction model and object search system through cross-validation over areas of five cities , each with a 40,000m^2 footprint. End-to-end experiments in simulation show that our system achieves faster search and higher success rate compared to a keyword-based baseline without spatial preposition understanding .
Revised:  We demonstrate the generalizability of our FoR prediction model and object search system through cross-validation over areas of five cities in OpenStreetMap, shows that our approach achieves faster search and higher success rate compared to a keyword-based baseline without spatial preposition understanding .
Edit intent: clarity
Original:  End-to-end experiments in simulation show that our system achieves faster search and higher success rate compared to a keyword-based baseline without spatial preposition understanding .
Revised:  End-to-end experiments in simulation show that our system achieves faster search and higher success rate compared to baselines, with a wider margin as the spatial language becomes more complex. Finally, we demonstrate the proposed method in AirSim, a realistic simulator where a drone is tasked to find cars in a neighborhood environment .
Edit intent: meaning-changed
Original:  The upper bound is related to recent generalizations of linear response relations in Stochastic Thermodynamics, and is reminiscent of the fundamental theorem of Natural selectionof R. Fisher and of its generalization by Price  .
Revised:  The upper bound is related to recent generalizations of linear response relations in Stochastic Thermodynamics, and is reminiscent of the fundamental theorem of natural selection, and with its generalization by Price .
Edit intent: coherence
Original: The combinatorial graph Laplacian has been a fundamental object in the analysis of and optimization on graphs. Its spectral structure has been widely used in graph optimization problems (e.g, clustering), and it is also connected to network circuit theory. There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Revised: We present a thorough study of the theoretical properties and devise efficient algorithms for the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Edit intent: clarity
Original:  There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Revised:  There is also a topological view of the graph Laplacian, which permits thepersistent Laplacian extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Edit intent: meaning-changed
Original:  There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Revised:  There is also a topological view of the graph Laplacian, which permits the, an extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Edit intent: clarity
Original:  There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Revised:  There is also a topological view of the graph Laplacian, which permits the extension of the standard combinatorial Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K.
Edit intent: meaning-changed
Original:  There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the more general q-th combinatorial Laplacian \Delta_q^K for a simplicial complex K. In this way, the standard graph Laplacian is simply the 0-th case (when q=0) of this family of operators. Taking this topological view, Wang et al. introduced the so-called persistent Laplacian \Delta_q^{K,L simplicial complexes K \hookrightarrow L . In this paper, we present a thorough study of properties and algorithms for persistent Laplacians.
Revised:  There is also a topological view of the graph Laplacian, which permits the extension of the graph Laplacian to the setting of pairs (or, in more generality, sequences) of simplicial complexes K \hookrightarrow L . In this paper, we present a thorough study of properties and algorithms for persistent Laplacians.
Edit intent: clarity
Original:  Taking this topological view, Wang et al. introduced the so-called persistent Laplacian \Delta_q^{K,L simplicial complexes K \hookrightarrow L . In this paper, we present a thorough study of properties and algorithms for persistent Laplacians. We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  Taking this topological view, Wang et al. introduced the so-called persistent Laplacian \Delta_q^{K,L simplicial complexes K \hookrightarrow L , which was recently introduced by Wang, Nguyen, and Wei. In particular, in analogy with the non-persistent case, we first prove that the nullity of \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Edit intent: meaning-changed
Original:  We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  We first prove that the nullity of the q-th persistent Laplacian \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Edit intent: fluency
Original:  We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  We first prove that the nullity of \Delta_q^{K,L} equals the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Edit intent: clarity
Original:  We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  We first prove that the nullity of \Delta_q^{K,L} gives rise to the q-th persistent Betti number of the inclusion (K \hookrightarrow L) . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Edit intent: meaning-changed
Original:  We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  We first prove that the nullity of \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present an initial algorithm for finding a matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Edit intent: clarity
Original:  We first prove that the nullity of  \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which helps reveal insights into the meaning of persistent Laplacian.
Revised:  We first prove that the nullity of \Delta_q^{K,L} gives rise to the q-th persistent Betti number from K to L . We then present a first algorithm to compute the matrix representation of \Delta_q^{K,L}, which itself helps interpret the persistent Laplacian.
Edit intent: meaning-changed
Original:  We next show a new relation between the persistent Laplacian and the so-called Schur complement of a matrix . This has several interesting implications. For example, in the graph case, this uncovers a relation with the notion of effective resistance , as well as a persistent version of the Cheeger inequality.
Revised:  We next show a new relation between the persistent Laplacian and the so-called Schur complement of a matrix which has several important implications. In the graph case, this uncovers a relation with the notion of effective resistance , as well as a persistent version of the Cheeger inequality.
Edit intent: clarity
Original:  This also gives a second , very simple algorithm to compute the q-th persistent Laplacian . This in turn leads to a new algorithm to compute the q-th persistent Betti number for a pair of spaces which can be significantly more efficient than existing algorithmsunder some conditions .
Revised:  This also gives a second , very simple algorithm to compute the q-th persistent Laplacian which in turn leads to a new algorithm to compute the q-th persistent Betti number for a pair of spaces which can be significantly more efficient than existing algorithmsunder some conditions .
Edit intent: fluency
Original:  Finally, we also study persistent Laplacians for a filtration of simplicial complexes, and present interesting stability results for their eigenvalues  .
Revised:  Finally, we also study persistent Laplacians for a filtration of simplicial complexes, and present interesting stability results for their eigenvalues . Our work brings methods from spectral graph theory, circuit theory, and persistent homology together with a topological view of the combinatorial Laplacian on simplicial complexes .
Edit intent: meaning-changed
Original:  This survey provides : (i) basic notions on mobility and deep learning; (ii) a review of data sources and public datasets; (iii) a description of deep learning models and (iv) a discussion about relevant open challenges .
Revised:  This survey provides a taxonomy of mobility tasks, a discussion on the challenges related to each task and how deep learning may overcome the limitations of traditional models, a description of deep learning models and (iv) a discussion about relevant open challenges .
Edit intent: meaning-changed
Original:  The scenes are replicas of 3D scanned real-world homes, aligning the distribution of objects and layout to that of the real world. iGibson integrates several key features to facilitate the study of interactive tasks:
Revised:  The scenes are replicas of real-world homes, aligning the distribution of objects and layout to that of the real world. iGibson integrates several key features to facilitate the study of interactive tasks:
Edit intent: clarity
Original:  The scenes are replicas of 3D scanned real-world homes, aligning the distribution of objects and layout to that of the real world. iGibson integrates several key features to facilitate the study of interactive tasks:
Revised:  The scenes are replicas of 3D scanned real-world homes, with distribution and the layout of objects aligned to those of the real world. iGibson integrates several key features to facilitate the study of interactive tasks:
Edit intent: clarity
Original:  i) generation of high-quality visual virtual sensor signals (RGB, depth, segmentation, LiDAR, flow , among others ), ii) domain randomization to change the materials of the objects (both visual texture and dynamics ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Revised:  i) generation of high-quality virtual sensor signals (RGB, depth, segmentation, LiDAR, flow , among others ), ii) domain randomization to change the materials of the objects (both visual texture and dynamics ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Edit intent: fluency
Original:  i) generation of high-quality visual virtual sensor signals (RGB, depth, segmentation, LiDAR, flow , among others ), ii) domain randomization to change the materials of the objects (both visual texture and dynamics ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Revised:  i) generation of high-quality visual virtual sensor signals (RGB, depth, segmentation, LiDAR, flow and so on ), ii) domain randomization to change the materials of the objects (both visual texture and dynamics ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Edit intent: coherence
Original:  i) generation of high-quality visual virtual sensor signals (RGB, depth, segmentation, LiDAR, flow , among others ), ii) domain randomization to change the materials of the objects (both visual texture and dynamics ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Revised:  i) generation of high-quality visual virtual sensor signals (RGB, depth, segmentation, LiDAR, flow , among others ), ii) domain randomization to change the materials of the objects (both visual and physical ) and/or their shapes, iii) integrated sampling-based motion planners to generate collision-free trajectories for robot bases and arms, and iv) intuitive human-iGibson interface that enables efficient collection of human demonstrations.
Edit intent: clarity
Original:  We also show that iGibson features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of simple human demonstrated behaviors. iGibson is open-sourced with comprehensive examples and documentation.
Revised:  We also show that iGibson features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of human demonstrated (mobile) manipulation behaviors. iGibson is open-sourced with comprehensive examples and documentation.
Edit intent: meaning-changed
Original:  We also show that iGibson features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of simple human demonstrated behaviors. iGibson is open-sourced with comprehensive examples and documentation.
Revised:  We also show that iGibson features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of simple human demonstrated behaviors. iGibson is open-source, equipped with comprehensive examples and documentation.
Edit intent: clarity
Original:  The scenes are replicas of real-world homes, with distribution and the layout of objects aligned to those of the real world. iGibson  integrates several key features to facilitate the study of interactive tasks:
Revised:  The scenes are replicas of real-world homes, with distribution and the layout of objects aligned to those of the real world. iGibson 1.0 integrates several key features to facilitate the study of interactive tasks:
Edit intent: meaning-changed
Original:  We also show that iGibson  features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of human demonstrated (mobile) manipulation behaviors. iGibson  is open-source, equipped with comprehensive examples and documentation.
Revised:  We also show that iGibson 1.0 features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of human demonstrated (mobile) manipulation behaviors. iGibson is open-source, equipped with comprehensive examples and documentation.
Edit intent: meaning-changed
Original:  We also show that iGibson  features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of human demonstrated (mobile) manipulation behaviors. iGibson  is open-source, equipped with comprehensive examples and documentation.
Revised:  We also show that iGibson features enable the generalization of navigation agents, and that the human-iGibson interface and integrated motion planners facilitate efficient imitation learning of human demonstrated (mobile) manipulation behaviors. iGibson 1.0 is open-source, equipped with comprehensive examples and documentation.
Edit intent: meaning-changed
Original: We present SpeakingFaces as a publicly-available large-scale  dataset developed to support multimodal machine learning research in contexts that utilize a combination of thermal, visual, and audio data streams;
Revised: We present SpeakingFaces as a publicly-available large-scale multimodal dataset developed to support multimodal machine learning research in contexts that utilize a combination of thermal, visual, and audio data streams;
Edit intent: meaning-changed
Original:  Based on the proposed social model, we then study the sample complexity of least-square auto-regressive (AR(1)) model estimation, which governs the number of observations that are sufficient for the identified model to achieve the prescribed levels of accuracy and confidence.
Revised:  Based on the proposed social model, we then study the sample complexity of least-square auto-regressive model estimation, which governs the number of observations that are sufficient for the identified model to achieve the prescribed levels of accuracy and confidence.
Edit intent: clarity
Original: In the paper we study miscible injection of liquids with decreasing viscosity in two-dimensional geometry. Polymer flooding of oil fields is our prototype model. Based on several one-dimensional approximate models we give rigorous formulation of the graded viscosity banks (GVB) technology which helps to save polymer by injecting several slugs with gradual decrease of viscosity instead of one slug. Limiting injection curves when number of slugs tends to infinity is calculated .
Revised: The graded viscosity banks technology (tapering) for polymer flooding is studied for several different models of mixing zones behavior. Depending on the viscosity function the limiting polymer injection profile is rigorously derived in case of transverse flow equilibrium assumption, for the Koval model and for the Todd-Longstaff model. The possible gain of the polymer in comparison to finite number of slugs tends to infinity is calculated .
Edit intent: meaning-changed
Original:  We propose a new  model called YieldNet which utilizes a novel deep learning framework that uses transfer learning between corn and soybean yield predictions by sharing the weights of the backbone feature extractor.
Revised:  We propose a new convolutional neural network model called YieldNet which utilizes a novel deep learning framework that uses transfer learning between corn and soybean yield predictions by sharing the weights of the backbone feature extractor.
Edit intent: meaning-changed
Original:   Numerical results demonstrate that our proposed method accurately predicts  yield from one to four months before the harvest  , and is competitive to other state-of-the-art approaches.
Revised:  We conduct our experiment using data from 1,132 counties for corn and 1,076 counties for soybean across the United States. Numerical results demonstrate that our proposed method accurately predicts yield from one to four months before the harvest , and is competitive to other state-of-the-art approaches.
Edit intent: meaning-changed
Original:   Numerical results demonstrate that our proposed method accurately predicts  yield from one to four months before the harvest  , and is competitive to other state-of-the-art approaches.
Revised:  Numerical results demonstrate that our proposed method accurately predicts yield from one to four months before the harvest with a MAE being 8.74\% and 8.70\% of the average yield, respectively , and is competitive to other state-of-the-art approaches.
Edit intent: meaning-changed
Original: Significant challenges exist globally regarding literacy teaching and learning , particularly in poor socio-economic settings in countries of the Global South. In this paper we argue that to address these challenges, major features of how the brain works that are currently ignored in the educational literature should be taken into account.
Revised: Significant challenges exist globally regarding literacy teaching and learning . To address these challenges, major features of how the brain works that are currently ignored in the educational literature should be taken into account.
Edit intent: coherence
Original:  Reductionist neuroscience studies which focus on decontextualized parts of reading cannot access all the relevant processes .
Revised:  Fifth, the natural operation of the brain is not rule-based, as is supposed in the standard view of linguistics: it is prediction, based on statistical pattern recognition. This all calls into question narrow interpretations of the widely quoted "Simple View of Reading", which argues that explict decoding is the necessary route to comprehension. One of the two neural routes to reading does not involve such explicit decoding processes, and can be activated from the earliest years .
Edit intent: meaning-changed