mlsanityData to 14 Oct 2026

A Multi-solution Study on GDPR AI-enabled Completeness Checking of DPAs

arXiv 2311.13881 ↗First posted 23 Nov 2023cs.SE cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Specifying legal requirements for software systems to ensure their compliance with the applicable regulations is a major concern to requirements engineering (RE). Personal data which is collected by an organization is often shared with other organizations to perform certain processing activities. In such cases, the General Data Protection Regulation (GDPR) requires issuing a data processing agreement (DPA) which regulates the processing and further ensures that personal data remains protected. Violating GDPR can lead to huge fines reaching to billions of Euros. Software systems involving personal data processing must adhere to the legal obligations stipulated in GDPR and outlined in DPAs. Requirements engineers can elicit from DPAs legal requirements for regulating the data processing activities in software systems. Checking the completeness of a DPA according to the GDPR provisions is therefore an essential prerequisite to ensure that the elicited requirements are complete. Analyzing DPAs entirely manually is time consuming and requires adequate legal expertise. In this paper, we propose an automation strategy to address the completeness checking of DPAs against GDPR. Specifically, we pursue ten alternative solutions which are enabled by different technologies, namely traditional machine learning, deep learning, language modeling, and few-shot learning. The goal of our work is to empirically examine how these different technologies fare in the legal domain. We computed F2 score on a set of 30 real DPAs. Our evaluation shows that best-performing solutions yield F2 score of 86.7% and 89.7% are based on pre-trained BERT and RoBERTa language models. Our analysis further shows that other alternative solutions based on deep learning (e.g., BiLSTM) and few-shot learning (e.g., SetFit) can achieve comparable accuracy, yet are more efficient to develop.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 81 references that are in the map. First posted on arXiv 23 Nov 2023.

Builds on

19 of 81 references.

References · 19

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  6. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,043
  7. 2022Efficient Few-Shot Learning Without Promptscited by 137
  8. 2020LEGAL-BERT: The Muppets straight out of Law Schoolcited by 111
  9. 2021Data Augmentation Approaches in Natural Language Processing: A Surveycited by 82
  10. 2021True Few-Shot Learning with Prompts -- A Real-World Perspectivecited by 38
  11. 2017Train Once, Test Anywhere: Zero-Shot Learning for Text Classificationcited by 22
  12. 2022NLP-based Automated Compliance Checking of Data Processing Agreements against GDPRcited by 18
7 more
  1. 2023Synthetically generated text for supervised text analysiscited by 10
  2. 2023Zero-Shot Learning for Requirements Classification: An Exploratory Studycited by 9
  3. 2021AI-enabled Automation for Completeness Checking of Privacy Policiescited by 7
  4. 2023STACC: Code Comment Classification using SentenceTransformerscited by 5
  5. 2023Using Language Models for Enhancing the Completeness of Natural-language Requirementscited by 3
  6. 2023Creating Custom Event Data Without Dictionaries: A Bag-of-Trickscited by 2
  7. 2023A Human-in-the-Loop Approach for Information Extraction from Privacy Policies under Data Scarcitycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.