Text2Cypher: Data Pruning using Hard Example Selection

Makbule Gulcin Ozsoy
5/8/2025
cs.DBcs.LG

No confident code implementation found for this paper.

Abstract

Database query languages such as SQL for relational databases and Cypher for graph databases have been widely adopted. Recent advancements in large language models (LLMs) enable natural language interactions with databases through models like Text2SQL and Text2Cypher. Fine-tuning these models typically requires large, diverse datasets containing non-trivial examples. However, as dataset size increases, the cost of fine-tuning also rises. This makes smaller, high-quality datasets essential for reducing costs for the same or better performance. In this paper, we propose five hard-example selection techniques for pruning the Text2Cypher dataset, aiming to preserve or improve performance while reducing resource usage. Our results show that these hard-example selection approaches can halve training time and costs with minimal impact on performance, and demonstrates that hard-example selection provides a cost-effective solution.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ozsoy2025textcypher,
  title  = {Text2Cypher: Data Pruning using Hard Example Selection},
  author = {Makbule Gulcin Ozsoy},
  year   = {2025},
  eprint = {2505.05122},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.05122v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.05122.svg)](https://codeofpaper.com/paper/2505.05122)

Discussion