| Challenge: | Existing paraphrase identification datasets lack sentence pairs with high word overlap without being paraphrases. |
| Approach: | They propose a workflow for generating pairs of sentences with high word overlap . they use controlled word swapping and back translation followed by fluency and paraphrase judgments . |
| Outcome: | The proposed dataset has 108,463 well-formed paraphrase and non-paraphrase pairs with high lexical overlap. |
Similar Papers
PAWS-X: A Cross-lingual Adversarial Dataset for Paraphrase Identification (D19-1)
Copied to clipboard
| Challenge: | Existing work on adversarial data generation focuses on English . Existing multilingual datasets show effectiveness of deep, multilingual pre-training . |
| Approach: | They propose a dataset of 23,659 human translated PAWS evaluation pairs in six languages . they show the effectiveness of deep, multilingual pre-training while leaving considerable headroom . |
| Outcome: | The proposed model shows that multilingual training and evaluation regimes are more accurate than previous models. |
RuPAWS: A Russian Adversarial Dataset for Paraphrase Identification (2022.lrec-1)
Copied to clipboard
Nikita Martynov, Irina Krotova, Varvara Logacheva, Alexander Panchenko, Olga Kozlova, Nikita Semenov
| Challenge: | Existing datasets for paraphrase identification lack challenging sentence pairs with high word overlap. |
| Approach: | They propose to use a dataset for Russian paraphrase detection that includes examples from PAWS translated to the Russian language and manually annotated by native speakers. |
| Outcome: | The proposed model performs well on both datasets while maintaining accuracy on the ParaPhraser benchmark. |
Improving Paraphrase Detection with the Adversarial Paraphrasing Task (2021.acl-long)
Copied to clipboard
| Challenge: | a new adversarial method of paraphrase identification is being used to identify paraphrases based on word overlap and syntax . authors propose a dataset that generates semantically equivalent but lexically and syntactically disparate paraphrase pairs . |
| Approach: | They propose an adversarial method for paraphrase identification that uses word overlap and syntax to identify paraphrases. |
| Outcome: | The proposed method improves paraphrase detection accuracy and speed of generation of datasets. |
Towards Better Characterization of Paraphrases (2022.acl-long)
Copied to clipboard
| Challenge: | Existing models of natural language processing lack generalization and performance . existing models are often overreliant on learned spurious correlations resulting in poor generalization. |
| Approach: | They propose to use word position deviation and lexical deviation to characterize paraphrase pairs without expert human annotation. |
| Outcome: | The proposed metrics improve generalizability of models trained on the dataset and can be used to generate specific forms of paraphrases for data augmentation or robustness testing of NLP models. |
ParaTag: A Dataset of Paraphrase Tagging for Fine-Grained Labels, NLG Evaluation, and Data Augmentation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing datasets only annotate a binary label for each sentence pair. Existing models only annnotate binary labels for each phrase pair. |
| Approach: | They propose a novel binary paraphrase classification task that annotates the degree of paraphrase between sentences and a new annotation schema that labels the minimum spans of tokens in a sentence that don't have the corresponding paraphrases in the other sentence. |
| Outcome: | The proposed dataset can be used to train an automatic scorer for language generation evaluation. |
ParaSCI: A Large Scientific Paraphrase Dataset for Longer Paraphrase Generation (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing paraphrase datasets are mainly from news, novels, or social media platforms. |
| Approach: | They propose to build a large-scale paraphrase dataset using intra-paper and inter-paper methods . they use PDBERT as a general paraphrase discovering method to take advantage of paraphrased sentences . |
| Outcome: | The proposed dataset includes 33,981 paraphrase pairs from ACL and 316,063 pairs from arXiv . the major advantages of paraphrases lie in the prominent length and textual diversity . |
Polly Want a Cracker: Analyzing Performance of Parroting on Paraphrase Generation Datasets (D19-1)
Copied to clipboard
| Challenge: | Paraphrase generation is an interesting and challenging task which has numerous practical applications. |
| Approach: | They analyze datasets commonly used for paraphrase generation research and show that simply parroting input sentences surpasses state-of-the-art models when evaluated on standard metrics. |
| Outcome: | The proposed model can generate paraphrases even without making any changes to the input sentence or even none at all, compared with other models. |
ParaAMR: A Large-Scale Syntactically Diverse Paraphrase Dataset by AMR Back-Translation (2023.acl-long)
Copied to clipboard
| Challenge: | Paraphrase generation is a long-standing task in natural language processing (NLP). |
| Approach: | They propose to generate large-scale syntactically diverse paraphrase datasets by abstract meaning representation back-translation. |
| Outcome: | The proposed dataset is syntactically more diverse than existing datasets while maintaining good semantic similarity. |
Controllable Paraphrase Generation for Semantic and Lexical Similarities (2024.lrec-main)
Copied to clipboard
| Challenge: | Lexically diverse paraphrases are crucial in data augmentation because they enhance the linguistic diversity of the corpus. |
| Approach: | They propose a controllable model for semantic and lexical similarities by attaching tags to the head of the input sentence. |
| Outcome: | The proposed model can paraphrase an input sentence according to the tags specified. |
Same Question, Different Words: A Latent Adversarial Framework for Prompt Robustness (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing solutions to the problem of semantically-preserving variations of prompts are expensive and require trial-and-error prompt engineering. |
| Approach: | They propose a dual-loop adversarial framework that optimizes a trainable perturbation as "latent continuous paraphrase" they demonstrate a 0.5%-4% improvement on worst-case win-rate on the RobustAlpaca benchmark . |
| Outcome: | Extensive experiments show that the proposed framework improves on the RobustAlpaca benchmark with a 0.5%-4% improvement on the worst-case win-rate. |