Legal reasoning requires not only the application of legal rules but also an understanding of the context in which those rules operate. However, existing legal benchmarks primarily evaluate rule application under the assumption of fixed norms, and thus fail to capture situations where legal judgments shift or where multiple norms interact. In this work, we propose CALRK-Bench, a context-aware legal reasoning benchmark based on the legal system in Korean. CALRK-Bench evaluates whether models can identify the temporal validity of legal norms, determine whether sufficient legal information is available for a given case, and understand the reasons behind shifts in legal judgments. The dataset is constructed from legal precedents and legal consultation records, and is validated by legal experts. Experimental results show that even recent large language models consistently exhibit low performance on these three tasks. CALRK-Bench provides a new stress test for evaluating context-aware legal reasoning rather than simple memorization of legal knowledge. Our code is available at https://github.com/jhCOR/CALRKBench.
Figures & tables
Figure 1: Overview of the Benchmark.
Type-TCR
Type-ISR
Type-JSA
Model
Pre.
Post.
Avg
Suff.
Insuff.
Part.
Avg
Prem.
Text
Interp.
Fact
Avg
GPT-5* (m)
0.053
0.600
0.327
0.885
0.753
0.717
0.762
0.226
0.679
0.244
0.944
0.487
GPT-5* (l)
0.427
0.747
0.587
0.973
0.756
0.651
0.754
0.238
0.714
0.539
0.778
0.547
Gemini Flash* (m)
0.200
0.727
0.463
1.000
0.721
0.636
0.737
0.702
0.821
0.154
0.944
0.637
Gemini Flash* (l)
0.720
0.820
0.770
0.993
0.737
0.648
0.748
0.774
0.905
0.449
0.667
0.707
LLaMA 3.3 70B
0.000
0.620
0.310
0.633
0.707
0.682
0.685
0.536
0.107
0.077
0.833
0.350
Table 1: Experiment conducted via OpenRouter. Detailed performance breakdown on CALRK-Bench. The best score in each column is shown in bold , and the second-best score is underlined . For GPT and Gemini models, we ran the evaluation three times with the seed fixed and report the average results due to internal stochasticity of the models. For open-source models, we used a fixed seed and report results from a single deterministic run. m: reasoning effort minimal, l: reasoning effort low, T: Thinking model, I: Instruct model. For Type-JSA , the options were randomly shuffled during evaluation.
Model
before
after
avg
GPT-5 (minimal)
0.053
0.600
0.327
GPT-5 (low)
0.427
0.747
0.587
GPT-5 (medium)
0.500
0.747
0.623
GPT-5 (high)
0.493
0.767
0.630
Table 2: Type-TCR performance under different reasoning effort levels of GPT-5.
Model
Acc.
Δ
GPT-5 (m)
0.717
–
GPT-5 (l)
0.651
-0.066
LLaMA 3.3 70B
0.682
–
LLaMA 3.3 70B + CoT
0.664
-0.018
Qwen3-30B-A3B
0.757
–
Qwen3-30B-A3B + CoT
0.720
-0.037
Table 3: Performance under the Partial condition in Type-ISR . Acc denotes accuracy under the Partial condition. Δ indicates the change in accuracy between the baseline model and its reasoning-augmented variant (e.g., CoT prompting or thinking-mode model).
Figure 2: Row-normalized confusion matrices for Type-JSA . Each value represents the percentage of predictions within the same gold label.
Figure 3: For the experiments involving context addition, the LexEval data were randomly sampled or the strings were randomly generated. Results averaged over three runs.
Large language models are increasingly used in high-stakes domains such as law, where systems must ground their reasoning in retrieved evidence and abstain when that evidence is insufficient. However, existing reward models are largely optimised for general preferences rather than contextual grounding, limiting their ability to evaluate these behaviours in retrieval-augmented generation (RAG) settings. We introduce a framework for transforming existing legal QA datasets into contextual preference data and use it to construct LegalRewardBench (LRB), a benchmark for evaluating grounded legal generation under noisy and insufficient retrieval conditions. Across general and legal contextual evaluation, we find that contextual DPO improves grounded evaluation, but performance is sensitive to preference-data construction. Length-balanced augmentation substantially improves grounded legal evaluation, with the strongest configuration combining length-balanced legal and general contextual preference data and improving performance by up to +25.6pp over baseline. We further find evidence of cross-jurisdiction transfer: models contextually refined primarily on Victorian criminal-law data improve grounded evaluation on external US legal benchmarks, including a +16.2pp improvement on Housing Statute QA. Together, these results provide a reproducible foundation for constructing and evaluating grounded legal reward models in retrieval-augmented settings.
Legal NLP benchmarks are overwhelmingly English-centric, leaving failure modes in morphologically rich, non-Latin-script languages undetected. We introduce UA-Legal-Bench, a five-task benchmark for evaluating large language models on Ukrainian legal reasoning, built from the Unified State Register of Court Decisions (EDRSR) -- one of the world's largest open judicial corpora (99.5 million decisions). The benchmark comprises: (1) case-type classification (4 classes, n=2,000), (2) judgment form classification (4 classes, n=2,000), (3) case-outcome prediction (6 classes, n=800), (4) legal norm extraction (n=1,794), and (5) cause category prediction (22 classes, n=1,871). We evaluate 11 LLMs (3B--675B) from five families under zero-shot and 3-shot prompting via AWS Bedrock with 158K API calls. Our results reveal sharply task-dependent few-shot effects: few-shot prompting improves judgment form classification by up to +38.6 pp but has mixed effects on outcome prediction. We show that accuracy is misleading on imbalanced legal tasks: the model with highest COP accuracy (62%) is a majority-class predictor (macro-F1: 23%), while the genuinely best model scores only 44% macro-F1. Within-family scaling analysis reveals that 8B models can match frontier performance on surface-level tasks but scaling thresholds vary dramatically across families. We release all data, prompts, and model predictions.
Large language models are increasingly applied to high-risk domains such as law, yet complex legal reasoning remains limited by two structural challenges. First, existing RAG and GraphRAG methods emphasize lexical or semantic similarity while overlooking normative relations among legal provisions. Second, vanilla Chain-of-Thought prompting may generate plausible rationales without enforcing the normative structure of legal reasoning. To deal with the bottleneck of pipelines in the legal reasoning domain, we propose LEGO, a dual-module framework that synergizes Legal Expert GraphRAG and expert Chain-of-thought for complex legal reasoning. ExpertGraphRAG uses an expert-annotated civil code graph encoding these normative relations with a greedy normative-coverage retrieval algorithm to dynamically extract instance-specific provision subgraphs, while ExpertCoT organizes the retrieved provisions and case facts into structured Provision-Fact-Conclusion reasoning. With a Qwen3-8B backbone, LEGO achieves 40.53% exact-match accuracy on LawExamQA_Civil, outperforming the evaluated RAG and CoT baselines and performing comparably to the evaluated larger models, while remaining robust on multi-hop questions. It also achieves the best results among the evaluated baselines on the open-ended benchmarks. Ablation studies confirm the individual and complementary contributions of both modules, demonstrating LEGO's effectiveness in improving LLMs' complex legal reasoning ability. Code and dataset can be found in the link: https://github.com/BLK-WHT/LEGO
Qingjing Chen, Junkai Zhang, Shaochun Wang +7
Alma AI, University of Bologna, Italy · Tsinghua University, China · Modelbest Inc. +2