<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="buakhaw-etal-2026-deka">
    <titleInfo>
        <title>Deka Retrieval: Component-Level Criteria for Mining Legal Case Pairs in Thai Supreme Court Decisions</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Pasin</namePart>
        <namePart type="family">Buakhaw</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Pawitsapak</namePart>
        <namePart type="family">Akarajaradwong</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Chompakorn</namePart>
        <namePart type="family">Chaksangchaichot</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2026-10</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Natural Legal Language Processing Workshop 2026</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Nikolaos</namePart>
            <namePart type="family">Aletras</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Ilias</namePart>
            <namePart type="family">Chalkidis</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Leslie</namePart>
            <namePart type="family">Barrett</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Cătălina</namePart>
            <namePart type="family">Goanță</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Daniel</namePart>
            <namePart type="family">Preoțiuc-Pietro</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Gerasimos</namePart>
            <namePart type="family">Spanakis</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Shanshan</namePart>
            <namePart type="family">Xu</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Budapest, Hungary</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
        <identifier type="isbn">979-8-89176-494-1</identifier>
    </relatedItem>
    <abstract>Legal case retrieval (LCR) defines relevance beyond text similarity, judgments may describe near-identical events yet be decided under different charges. Existing synthesis pipelines mine training pairs from text similarity and shared charges, which separates positives from negatives but leaves the difficulty of each pair implicit. We present Deka Retrieval, an LCR benchmark on Thai Supreme Court decisions with an LLM relevance cases mining pipeline for a civil-law jurisdiction. We decompose each judgment into case components (Charge, Fact, Reasoning, Decision) and split easy/hard level on exist binary signals and introduce an anomaly variant a conflict judgment that shares the anchor’s charge and facts but reaching a different reasoning and decision. Retriever performance follows query length: Fact \ensuremath&gt; Lawyer expert \ensuremath&gt; Lay people. Fine-tuning gains most on the weakest type, lifting Lay R@10 by 2.6x (7.6 -\ensuremath&gt; 19.5) versus 1.5x on Lawyer and 1.3x on Fact. Training on the shortest query also transfers to the longer ones, but not the reverse. Adding anomaly cases as positives raises the chance of retrieving them at test time and degrades performance relative to training without them. Our dataset and models are available at https://hf.co/collections/VISAI-AI/deka-retrieval.</abstract>
    <identifier type="citekey">buakhaw-etal-2026-deka</identifier>
    <location>
        <url>https://aclanthology.org/2026.nllp-1.35/</url>
    </location>
    <part>
        <date>2026-10</date>
        <extent unit="page">
            <start>399</start>
            <end>419</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Deka Retrieval: Component-Level Criteria for Mining Legal Case Pairs in Thai Supreme Court Decisions
%A Buakhaw, Pasin
%A Akarajaradwong, Pawitsapak
%A Chaksangchaichot, Chompakorn
%Y Aletras, Nikolaos
%Y Chalkidis, Ilias
%Y Barrett, Leslie
%Y Goanță, Cătălina
%Y Preoțiuc-Pietro, Daniel
%Y Spanakis, Gerasimos
%Y Xu, Shanshan
%S Proceedings of the Natural Legal Language Processing Workshop 2026
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-494-1
%F buakhaw-etal-2026-deka
%X Legal case retrieval (LCR) defines relevance beyond text similarity, judgments may describe near-identical events yet be decided under different charges. Existing synthesis pipelines mine training pairs from text similarity and shared charges, which separates positives from negatives but leaves the difficulty of each pair implicit. We present Deka Retrieval, an LCR benchmark on Thai Supreme Court decisions with an LLM relevance cases mining pipeline for a civil-law jurisdiction. We decompose each judgment into case components (Charge, Fact, Reasoning, Decision) and split easy/hard level on exist binary signals and introduce an anomaly variant a conflict judgment that shares the anchor’s charge and facts but reaching a different reasoning and decision. Retriever performance follows query length: Fact \ensuremath> Lawyer expert \ensuremath> Lay people. Fine-tuning gains most on the weakest type, lifting Lay R@10 by 2.6x (7.6 -\ensuremath> 19.5) versus 1.5x on Lawyer and 1.3x on Fact. Training on the shortest query also transfers to the longer ones, but not the reverse. Adding anomaly cases as positives raises the chance of retrieving them at test time and degrades performance relative to training without them. Our dataset and models are available at https://hf.co/collections/VISAI-AI/deka-retrieval.
%U https://aclanthology.org/2026.nllp-1.35/
%P 399-419

Markdown (Informal)

[Deka Retrieval: Component-Level Criteria for Mining Legal Case Pairs in Thai Supreme Court Decisions](https://aclanthology.org/2026.nllp-1.35/) (Buakhaw et al., NLLP 2026)

• Deka Retrieval: Component-Level Criteria for Mining Legal Case Pairs in Thai Supreme Court Decisions (Buakhaw et al., NLLP 2026)

ACL

• Pasin Buakhaw, Pawitsapak Akarajaradwong, and Chompakorn Chaksangchaichot. 2026. Deka Retrieval: Component-Level Criteria for Mining Legal Case Pairs in Thai Supreme Court Decisions. In Proceedings of the Natural Legal Language Processing Workshop 2026, pages 399–419, Budapest, Hungary. Association for Computational Linguistics.