UNH at CheckThat! 2025: Fine-tuning Vs Prompting in Claim Extraction

Joe Wilder, Nikhil Kadapala, Benji Xu, Mohammed Alsaadi, Aiden Parsons +4 more
9/8/2025
cs.CLcs.AIcs.IR

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

We participate in CheckThat! Task 2 English and explore various methods of prompting and in-context learning, including few-shot prompting and fine-tuning with different LLM families, with the goal of extracting check-worthy claims from social media passages. Our best METEOR score is achieved by fine-tuning a FLAN-T5 model. However, we observe that higher-quality claims can sometimes be extracted using other methods, even when their METEOR scores are lower.

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. 3 weaker matches are hidden by default — 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{wilder2025checkthat,
  title  = {UNH at CheckThat! 2025: Fine-tuning Vs Prompting in Claim Extraction},
  author = {Joe Wilder and Nikhil Kadapala and Benji Xu and Mohammed Alsaadi and Aiden Parsons and Mitchell Rogers and Palash Agarwal and Adam Hassick and Laura Dietz},
  year   = {2025},
  eprint = {2509.06883},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.06883v1}
}

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/2509.06883.svg)](https://codeofpaper.com/paper/2509.06883)

Discussion