PARADE: A New Dataset for Paraphrase Identification Requiring Computer Science Domain Knowledge
Not on the map. Why?
Abstract (arXiv)
We present a new benchmark dataset called PARADE for paraphrase identification that requires specialized domain knowledge. PARADE contains paraphrases that overlap very little at the lexical and syntactic level but are semantically equivalent based on computer science domain knowledge, as well as non-paraphrases that overlap greatly at the lexical and syntactic level but are not semantically equivalent based on this domain knowledge. Experiments show that both state-of-the-art neural models and non-expert human annotators have poor performance on PARADE. For example, BERT after fine-tuning achieves an F1 score of 0.709, which is much lower than its performance on other paraphrase identification datasets. PARADE can serve as a resource for researchers interested in testing models that incorporate domain knowledge. We make our data and code freely available.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 2; 2025: 0; 2026: 1.
7 papers.
- 2021CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Examplecited by 20
- 2021Finnish Paraphrase Corpuscited by 10
- 2022Match-Prompt: Improving Multi-task Generalization Ability for Neural Text Matching via Prompt Learningcited by 10
- 2024Finding a Needle in the Adversarial Haystack: A Targeted Paraphrasing Approach For Uncovering Edge Cases with Minimal Distribution Distortioncited by 3
- 2021Semantic Search as Extractive Paraphrase Span Detectioncited by 2
- 2026Closing the Operational Gap in Semantic Cachingcited by 1
- 2024Retrieve, Generate, Evaluate: A Case Study for Medical Paraphrases Generation with Small Language Modelscited by 0
- 2026Closing the Operational Gap in Semantic Caching18 Jun 2026
- 2024Retrieve, Generate, Evaluate: A Case Study for Medical Paraphrases Generation with Small Language Models23 Jul 2024
- 2024Finding a Needle in the Adversarial Haystack: A Targeted Paraphrasing Approach For Uncovering Edge Cases with Minimal Distribution Distortion21 Jan 2024
- 2022Match-Prompt: Improving Multi-task Generalization Ability for Neural Text Matching via Prompt Learning6 Apr 2022
- 2021Semantic Search as Extractive Paraphrase Span Detection9 Dec 2021
- 2021Finnish Paraphrase Corpus24 Mar 2021
- 2021CSFCube -- A Test Collection of Computer Science Research Articles for Faceted Query by Example24 Mar 2021