CLJan 27, 2021

Neural Sentence Ordering Based on Constraint Graphs

arXiv:2101.11178v224 citationsHas Code
Originality Incremental advance
AI Analysis

This work addresses sentence ordering for natural language processing applications, representing an incremental improvement over existing methods.

The paper tackles the sentence ordering problem by proposing a method that uses multi-granular orders to form constraint graphs, encoded with Graph Isomorphism Networks, resulting in state-of-the-art performance on five benchmark datasets.

Sentence ordering aims at arranging a list of sentences in the correct order. Based on the observation that sentence order at different distances may rely on different types of information, we devise a new approach based on multi-granular orders between sentences. These orders form multiple constraint graphs, which are then encoded by Graph Isomorphism Networks and fused into sentence representations. Finally, sentence order is determined using the order-enhanced sentence representations. Our experiments on five benchmark datasets show that our method outperforms all the existing baselines significantly, achieving a new state-of-the-art performance. The results demonstrate the advantage of considering multiple types of order information and using graph neural networks to integrate sentence content and order information for the task. Our code is available at https://github.com/DaoD/ConstraintGraph4NSO.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes