| Challenge: | Existing approaches to sentence order prediction ignore the importance of document level global information, i.e., while predicting relative order of two sentences (s i , s j) other sentences sk from the same document do not play any role. |
| Approach: | They propose a framework based on graph neural networks and temporal commonsense knowledge to model global information and predict relative order of sentences. |
| Outcome: | The proposed method is naturally suitable for order prediction on five different datasets and has potential applications in the evaluation of the quality of machinegenerated documents. |
Similar Papers
Improving Graph-based Sentence Ordering with Iteratively Predicted Pairwise Orderings (2021.emnlp-main)
Copied to clipboard
Shaopeng Lai, Ante Wang, Fandong Meng, Jie Zhou, Yubin Ge, Jiali Zeng, Junfeng Yao, Degen Huang, Jinsong Su
| Challenge: | Existing sentence ordering models can be classified into pairwise ordering models and set-to-sequence models. |
| Approach: | They propose a novel sentence ordering framework which introduces two classifiers to make better use of pairwise orderings for graph-based sentence ordering. |
| Outcome: | The proposed model achieves state-of-the-art performance on five commonly-used datasets. |
Revisiting Generative Commonsense Reasoning: A Pre-Ordering Approach (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to generative commonsense reasoning hypothesize that pre-trained models lack sufficient parametric knowledge for this task. |
| Approach: | They propose to use order-agnostic input to elaborately manipulate the order of the given concepts before generation to evaluate their commonsense knowledge. |
| Outcome: | The proposed approach outperforms more sophisticated models with a lot of external data and resources in the task of generating a logical sentence from a set of concepts. |
Topological Sort for Sentence Ordering (2020.acl-main)
Copied to clipboard
| Challenge: | Recent work on sentence ordering task has framed it as a sequence prediction problem. |
| Approach: | They propose a new constraint solving problem and propose 'human evaluation' they propose to capture coherence in documents by arranging sentences in the correct order . |
| Outcome: | The proposed technique captures coherence in documents better than previous approaches. |
Learning to Organize a Bag of Words into Sentences with Neural Networks: An Empirical Study (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to encode natural languages without orders are lacking. |
| Approach: | They conduct a comprehensive analysis of the ability of neural models to organize sentences from a bag of words under three typical scenarios. |
| Outcome: | The proposed models can reorder or reconstruct sentences from a bag of words under three typical scenarios. |
Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing graph-based models excel at capturing structural information within TKGs but lack semantic comprehension abilities. |
| Approach: | They propose a plug-and-play module to enhance the performance of graph-based TKG models by exploring high-order histories step-by-step. |
| Outcome: | Experiments on three datasets and backbones show that CoH is effective in capturing high-order historical information for LLMs. |
Severing the Edge Between Before and After: Neural Architectures for Temporal Ordering of Events (2020.emnlp-main)
Copied to clipboard
Miguel Ballesteros, Rishita Anubhai, Shuai Wang, Nima Pourdamghani, Yogarshi Vyas, Jie Ma, Parminder Bhatia, Kathleen McKeown, Yaser Al-Onaizan
| Challenge: | Existing models for temporal ordering of events rely on pretrained representations, transfer and multitask learning, and self-training techniques. |
| Approach: | They propose a neural architecture and a set of training methods for ordering events by predicting temporal relations by pre-training models. |
| Outcome: | The proposed models can predict temporal relations between two pairs of events within a span of text and identify temporal relationships between them. |
Sentence Ordering with a Coherence Verifier (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent sentence ordering studies can be classified into 2 categories: pair-wise ranking-based and sequence generation-based methods. |
| Approach: | They propose a sentence ordering method by plugging a coherence verifier into ranking-based and sequence generation-based methods. |
| Outcome: | The proposed method improves on topological sorting-based and pointer network-based methods with topological and point-based models. |
Non-Autoregressive Sentence Ordering (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing sentence ordering approaches only leverage unilateral dependencies during decoding and cannot fully explore the semantic dependency between sentences. |
| Approach: | They propose a non-autoregressive ordering network that explores bilateral dependencies between sentences and predicts sentences for each position in parallel. |
| Outcome: | The proposed model outperforms existing autoregressive sentence ordering approaches and yields competitive performance compared with the state-of-the-arts. |
Learning to Order Graph Elements with Application to Multilingual Surface Realization (D19-63)
Copied to clipboard
| Challenge: | Recent advances in deep learning have shown promises in solving combinatorial optimization problems, such as sorting variable-sized sequences. |
| Approach: | They propose an encoder-decoder framework that learns the representation for each element and predicts the ordering of each local neighborhood of the graph in turn. |
| Outcome: | The proposed framework outperforms previous frameworks on multilingual surface realization tasks while outperforming those below by a large margin. |
DocScript: Document-level Script Event Prediction (2024.lrec-main)
Copied to clipboard
Puneet Mathur, Vlad I. Morariu, Aparna Garimella, Franck Dernoncourt, Jiuxiang Gu, Ramit Sawhney, Preslav Nakov, Dinesh Manocha, Rajiv Jain
| Challenge: | Existing script event prediction frameworks such as ChatGPT and FlanT5 lack the ability to learn long-range dependencies between events. |
| Approach: | They propose a novel script event prediction task which aims to predict the next event from a candidate list of narrative events in long-form documents. |
| Outcome: | The proposed architecture can learn sequential ordering between events at the document scale. |