Sentence Ordering with a Coherence Verifier

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a novel sentence ordering method by plugging a coherence verifier (COVER) into pair-wise ranking-based and sequence generation-based methods. It does not change the model parameters of the baseline, and only verifies the coherence of candidate (partial) orders produced by the baseline and reranks them in beam search. We also propose a coherence model as COVER with a novel graph formulation and a novel data construction strategy for contrastive pre-training independently of the sentence ordering task. Experimental results on four benchmarks demonstrate the effectiveness of our method with topological sorting-based and pointer network-based methods as the baselines. Detailed analyses illustrate how COVER improves the baselines and confirm the importance of its graph formulation and training strategy. Our code is available at https://github.com/SN-Jia/SO_with_CoVer.

Cite

CITATION STYLE

APA

Jia, S., Song, W., Gong, J., Wang, S., & Liu, T. (2023). Sentence Ordering with a Coherence Verifier. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 9301–9314). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-acl.592

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free