FAITH-LEGAL: A Retrieval-Grounded, Citation-Aware Framework for Faithful Legal Document Summarization with Closed-Loop Verification
编号:185 访问权限:仅限参会人 更新:2026-11-10 17:05:12 浏览:5次 Online

报告开始:2026年11月20日 14:00(Asia/Kolkata)

报告时间:15min

所在会场:[S4] Artificial Intelligence and Intelligent Computing [S4-3] Artificial Intelligence and Intelligent Computing

暂无文件

摘要
Legal judgments are among the densest and most consequential bodies of text that automated systems are asked to summarize, and the people who rely on those summaries – judges, lawyers, and researchers – cannot afford small errors in what gets kept or dropped. Two recent lines of work highlight both the promise and the limits of current approaches. Reference-free evaluation frameworks such as LEAD show that scoring legal summaries along relevance, coherence, consistency, and fluency using domain-adapted language models correlates far better with expert judgment than older overlap-based metrics. Separately, lightweight abstractive systems built on domain-tuned sequenceto-sequence models, such as legal-pegasus, generate fluent summaries quickly, though they sometimes rely on inserting fixed template sentences when certain keywords are missing from the output – a shortcut that can introduce content the source document never actually supports. Neither line of work closes the loop between generating a summary and verifying that every sentence in it is actually grounded in the judgment. This paper introduces FAITH-LEGAL, a retrieval-grounded, citation-aware summarization pipeline that traces each generated sentence back to specific evidence in the source judgment, checks that trace with a natural language inference model sensitive to both contradiction and lack of support, and regenerates or removes any sentence that fails the check – rather than patching it with an unverified template. We also extend the LEAD framework into LEAD+, adding a Citation Grounding Score, and introduce the Unsupported Content Rate (UCR) as a direct, sentence-level measure of hallucination. We detail the full architecture, the mathematical formulation behind each scoring component, and the experimental protocol used to evaluate the system against extractive and abstractive baselines drawn from prior work, including an ablation study isolating the contribution of retrieval, citation alignment, and the correction loop.
关键词
legal,Automatic Summarization,NLP,Machine Translation; Evaluation Methods; Faithfulness; Intelligibility,bert,retrieval-augmented generation,citation-aware,InLegalBERT,natural language inference.
报告人
Samraj K
Student St. Joseph's college of engineering

Yeswanth Raja G
Student St. Joseph's college of engineering

稿件作者
Samraj K St. Joseph's college of engineering
Yeswanth Raja G St. Joseph's college of engineering
Sowmiya L St. Joseph's college of engineering
发表评论
验证码 看不清楚,更换一张
全部评论
重要日期
  • 会议日期

    11月20日

    2026

    至

    11月22日

    2026

  • 10月31日 2026

    初稿截稿日期

  • 11月07日 2026

    提前注册日期

  • 11月22日 2026

    注册截止日期

主办单位
United Societies of Science
承办单位
Pondicherry University
协办单位
IEEE Section
IEEE Madras Section
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询