REVIEW 3 major objections 4 minor 77 references
Predicting potentially abusive clauses in Chilean terms of services with natural language processing
T0 review · 3 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash
Pith's one-line read This paper introduces a Spanish-language dataset of 5,209 clauses from 50 Chilean Terms of Service and shows that transformer-based models can detect potentially abusive clauses with macro-F1 scores up to 89%.
desk verdict A genuinely useful new Chilean ToS corpus and a broad model benchmark, but the printed split tables don't add up and the data isn't released; the benchmark numbers as-is are not verifiable. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the annotation scheme: four categories of potentially abusive clauses under Chilean law — formal-requirement infringements, illegal clauses, dark clauses, and gray clauses — with the last three expanded into 20 labeled classes (six illegal, six dark, eight gray) tied to specific legal sources such as Article 16 of the Consumer Protection Law. The scheme carries the argument because it converts an open-ended legal judgment into a fixed set of multi-label classes that can be learned, and it is applied to 5,209 clauses segmented from 50 ToS, with six derived datasets for binary detection and multi-label classification.
What would settle it
An independent pair of Chilean legal experts, blind to the original labels, could re-annotate a random subset of the 5,209 clauses using the same scheme; if the new annotation disagrees with the original labels on a substantial fraction of clauses, or if models trained on one annotation fail badly when evaluated against the other, the reported F1 scores would be measuring a noisy gold standard rather than the true clause categories.
Extended reading notes
Core claim
The paper's central claim is that a carefully designed annotation scheme, applied by Chilean legal experts to 50 Spanish-language ToS, yields a corpus on which transformer-based models can reliably detect potentially abusive clauses and classify them into meaningful legal categories. It reports that the best models detect abusive clauses with macro-F1 scores up to 89% and micro-F1 scores up to 96%, while the harder multi-label classification task reaches macro-F1 scores of 60–70% and micro-F1 scores of 64–80%. The work positions this dataset as the first Spanish-language legal-clause classification resource and the first to apply Chilean law, and it shows that language- and domain-specific pre-training materially affects performance, with few-shot prompting of large models remaining behind fine-tuning on most tasks but competitive on the most ambiguous gray-clause category.
Load-bearing premise
The gold-standard labels are assumed correct: the two Chilean legal experts who annotated the corpus reached consensus without any reported inter-annotator agreement metric, so systematic errors in their legal interpretation or clause segmentation would propagate into every reported score.
Editorial extensions
If this is right
- If detection is as reliable as reported, a screening tool could flag potentially abusive clauses in a ToS before a consumer accepts it, lowering the information asymmetry.
- The dataset gives Spanish-language legal NLP a benchmark, so future models can be compared on a non-EU, non-English task.
- The distinction between illegal, dark, and gray clauses means the system can tell users which clauses are presumed abusive by law and which require a court's judgment.
- The finding that few-shot prompting lags fine-tuning on most tasks but helps on ambiguous gray clauses suggests a hybrid workflow: fine-tune for detection and prompt large models for the hardest classification cases.
- The reported evaluation of the Spanish legal-domain model RoBERTalex on a Spanish legal task provides a reference result for that model.
Reading between the lines
- If the dataset is adopted, a natural extension is to expand beyond the 50 companies to cover more sectors or other Latin American jurisdictions with similar consumer-protection laws, testing how well the models transfer.
- The exclusion of formal-requirement violations (font size, language, printability) leaves a gap that could be closed cheaply with rule-based parsers; a combined system would cover more of the legal risk surface.
- A testable hypothesis implicit in the paper is that inter-annotator disagreement concentrates in the gray-clause classes; measuring agreement per class could reveal which categories truly need more examples or clearer guidelines.
- Because the labels were agreed by two in-house experts without a reported agreement metric, an independent audit of a random sample of clauses would measure the gold standard's stability.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a Spanish-language corpus of clauses from 50 Chilean terms of service, annotated by two legal experts with a 20-class scheme spanning illegal, dark, and gray potentially abusive clauses. It constructs six detection/classification benchmarks, fine-tunes a range of transformer models, and evaluates several multilingual LLMs in few-shot settings, reporting detection macro-F1 up to 79–89% and classification macro-F1 of 60–70%. The authors claim the first Spanish-language multi-label classification dataset for legal clauses and the first evaluation of RoBERTalex on a Spanish-language legal task.
Significance. If the corpus and benchmark are reliable, this is a genuinely useful contribution: it addresses a real gap in non-English, non-EU legal NLP, provides a substantial annotated resource grounded in Chilean consumer law, and offers a broad, seed-averaged comparison of fine-tuned and few-shot models, including a first task evaluation of RoBERTalex. The detailed error analysis is a further strength. However, the benchmark's trustworthiness is currently compromised by internal inconsistencies in the reported split statistics and label counts, and by ambiguities in how the detection negative sets were constructed. The dataset itself may still be valuable, but the evaluation numbers need to be corrected or supported by released splits before they can be relied upon.
major comments (3)
- [Section 3.7, Table 3] The split statistics for the classification tasks are internally inconsistent, so the reported results in Tables 5–7 cannot be reconstructed from the paper. For Illegal Classification, the six label rows sum to 295 train / 127 val / 181 test (total 603), while the 'Sum' row reports 335 / 127 / 181 (total 643); for Dark Classification the label rows sum to 170 / 74 / 105 (total 349) but the 'Sum' row reports 170 / 75 / 105; and for Gray Classification the label rows sum to 185 / 79 / 113 (total 377) but the 'Sum' row reports 384, with the bfe row itself summing to 76 rather than 83. The stated explanation that iterative stratified sampling (Sechidis et al., 2011) 'selectively oversamples' to obtain 643 instances from 603 is not plausible, since that algorithm partitions the given instances and does not create new ones; if oversampling was deliberately performed, its details and safeguards against train/test leakage are not described. Moreover, per-label totals in Table 3 (e.g., ltd=156, des risk=83) disagree with Table A1 (ltd=138, des risk=64) and with the counts given in Section 3 (156 and 117). The exact data splits must be released, or the tables corrected, before the benchmark claims are verifiable.
- [Section 3.7, Table 2] The detection tasks appear to exclude clauses that are abusive in other categories from both the positive and negative sets. The 'ok' count is identical (4,165) in all three detection splits even though the corpus contains 1,044 clauses with at least one abusive label; if dark- or gray-labeled clauses are removed from the negative class for Illegal Detection, the binary task becomes 'illegal clause vs. completely clean clause,' which is easier than the realistic setting in which a detector must also distinguish illegal clauses from other abusive but not illegal clauses. The paper should state explicitly whether other-category abusive clauses are included as negatives; if they are excluded, the detection experiments should be re-run on the full corpus, or the reduced setting should be justified as the intended task definition.
- [Section 3.7] The gold standard rests entirely on the joint work of two in-house Chilean legal experts, and the authors state that they do not report agreement measures 'due to the expert review.' Since every F1 score in Tables 5–7 is computed against these labels, the absence of any inter-annotator agreement statistic, adjudication audit, or independent verification leaves the reliability of the labels unsupported. At minimum, the authors should report agreement on a held-out subset, provide an audit trail, or release the detailed annotation guidelines, and they should resolve the apparent discrepancies in label counts (e.g., ltd and des risk) that suggest the version of the data used in the experiments differs from the version summarized in Table A1.
minor comments (4)
- [Section 5.3] The text says 'Figure 7 shows classification reports,' but the material is presented as Table 7; the cross-reference should be corrected.
- [Section 5.2] The text refers to 'Gwen2.5 72b' where the model name should be 'Qwen2.5 72b.'
- [Abstract and Section 3] The abstract and introduction emphasize 'four categories and 20 classes,' but only three categories are used for machine learning because the formal-requirements category is excluded in Section 3.2; this should be stated more prominently to avoid overstating the scope of the annotated and predicted scheme.
- [Table 3 caption] The caption describes the classification tasks as 'multi-class classification,' while the text and the multi-label formulation in Section 4.1 describe them as multi-label tasks; the terminology should be made consistent.
Circularity Check
No significant circularity: the paper's evaluation is empirical against held-out test splits, and predictions are not derived from fitted parameters or self-citations.
full rationale
The paper's central contributions are a new Spanish-language Chilean ToS annotation corpus and benchmark evaluations of fine-tuned and few-shot models. The reported macro-F1 and micro-F1 scores are computed on held-out test splits (Section 5, Tables 5-6) after training on separate train/validation splits described in Section 3.7. No equation in the paper defines a prediction in terms of its own input; the classification and detection tasks use legal annotation categories from Chilean law (Table 1), not a renaming of a fitted quantity. The paper contains no load-bearing self-citations: the reference list includes no prior work by the present authors, and the methodological anchors (Sechidis et al. 2011, LexGLUE, RoBERTalex, LegalBench) are external, independently published resources. The absence of inter-annotator agreement metrics and the arithmetic inconsistencies in Table 3 (e.g., Illegal Classification label rows sum to 295/127/181 while the Sum row reports 335/127/181; corpus totals in Table A1 also differ from Table 3 per-label totals) are serious reproducibility and gold-standard quality concerns, but they concern correctness and verifiability rather than circularity. Under the specified criteria, this is an honest non-finding: no fitted input is renamed as a prediction, no result is forced by definition, and no uniqueness claim is imported from the authors' own prior work.
Assumptions & free parameters
assumptions (3)
- domain assumption The Chilean Consumer Protection Law (LPC), as interpreted by SERNAC and doctrinal sources, defines what constitutes an abusive clause.
- domain assumption The two legal experts' consensus annotations correctly represent the legal status of each clause, despite no inter-annotator agreement measure.
- ad hoc to paper The authors' proposed annotation scheme, with its Illegal, Dark, and Gray categories and 20 classes, is a valid operationalization of Chilean law.
Cite this review
Pith. "Pith review of Predicting potentially abusive clauses in Chilean terms of services with natural language processing." pith.science (2026). https://pith.science/paper/JUZ5VVTY
@misc{pith2026250200865,
author = {Pith},
title = {Pith review of: Predicting potentially abusive clauses in Chilean terms of services with natural language processing},
year = {2026},
howpublished = {\url{https://pith.science/paper/JUZ5VVTY}},
note = {Machine review of arXiv:2502.00865}
}
read the original abstract
This study addresses the growing concern of information asymmetry in consumer contracts, exacerbated by the proliferation of online services with complex Terms of Service that are rarely even read. Even though research on automatic analysis methods is conducted, the problem is aggravated by the general focus on English-language Machine Learning approaches and on major jurisdictions, such as the European Union. We introduce a new methodology and a substantial dataset addressing this gap. We propose a novel annotation scheme with four categories and a total of 20 classes, and apply it on 50 online Terms of Service used in Chile. Our evaluation of transformer-based models highlights how factors like language- and/or domain-specific pre-training, few-shot sample size, and model architecture affect the detection and classification of potentially abusive clauses. Results show a large variability in performance for the different tasks and models, with the highest macro-F1 scores for the detection task ranging from 79% to 89% and micro-F1 scores up to 96%, while macro-F1 scores for the classification task range from 60% to 70% and micro-F1 scores from 64% to 80%. Notably, this is the first Spanish-language multi-label classification dataset for legal clauses, applying Chilean law and offering a comprehensive evaluation of Spanish-language models in the legal domain. Our work lays the ground for future research in method development for rarely considered legal analysis and potentially leads to practical applications to support consumers in Chile and Latin America as a whole.
Reference graph
Works this paper leans on
-
[1]
write newline
" write newline " cite write " FUNCTION editor.postfix editor num.names #1 > "( )" "( )" if FUNCTION editor.trans.postfix editor num.names #1 > "( )" "( )" if FUNCTION trans.postfix translator num.names #1 > "( )" "( )" if FUNCTION authors.editors.reflist.apa5 'field := 'dot := field num.names 'numnames := numnames 'format.num.names := format.num.names na...
-
[2]
, " * write output.state after.block = add.period write newline
ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year eprint archive archivePrefix primaryClass adsurl adsnote version label INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.sta...
-
[3]
write newline
" write newline "" before.all 'output.state := FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION n.separate 't := "" #0 'numnames := t empty not t #-1 #1 subs...
-
[4]
botherref Abdin , M.I. , Ade Jacobs , S. , Awan , A.A. , Aneja , J. , Awadallah , A. , Hassan Awadalla , H. , Bach , N. , Bahree , A. , Bakhtiari , A. , Behl , H. , Benhaim , A. , Bilenko , M. , Bjorck , J. , Bubeck , S. , Cai , M. , Mendes , C.C.T. , Chen , W. , Chaudhary , V. , Chopra , P. , Giorno , A.D. , Rosa , G. , Dixon , M. , Eldan , R. , Iter , D...
work page 2024
-
[5]
bchapter Aumiller , D. , Almasian , S. , Lackner , S. , Gertz , M. : Structural Text Segmentation of Legal Documents . In: Proceedings of the Eighteenth International Conference on Artificial Intelligence and Law , pp. 2 -- 11 ( 2021 ). 10.1145/3462757.3466085 bchapter
-
[6]
botherref Akash , B.S. , Kupireddy , A. , Murthy , L.B. : Unfair TOS : An Automated Approach Using Customized BERT . arXiv (2024) botherref
work page 2024
-
[7]
: Lecciones de Derecho del Consumidor , Primera edici \'o n edn
bbook Barrientos Camus , F. : Lecciones de Derecho del Consumidor , Primera edici \'o n edn. Thomson Reuters , Santiago, Chile ( 2019 ) bbook
work page 2019
-
[8]
bchapter Bizzaro , P.G. , Della Valentina , E. , Napolitano , M. , Mana , N. , Zancanaro , M. : Annotation and classification of relevant clauses in terms-and-conditions contracts . In: Calzolari , N. , Kan , M.-Y. , Hoste , V. , Lenci , A. , Sakti , S. , Xue , N. (eds.) Proceedings of the 2024 Joint International Conference on Computational Linguistics, ...
work page 2024
Show all 77 references
-
[9]
, Matthes , F
bchapter Braun , D. , Matthes , F. : AGB - DE : A corpus for the automated legal assessment of clauses in G erman consumer contracts . In: Ku , L.-W. , Martins , A. , Srikumar , V. (eds.) Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (...
2024 doi
-
[10]
, Peters , M.E
botherref Beltagy , I. , Peters , M.E. , Cohan , A. : Longformer: The Long-Document Transformer . arXiv (2020) botherref
2020
-
[11]
: Automated semantic analysis, legal assessment, and summarization of standard form contracts
botherref Braun , D. : Automated semantic analysis, legal assessment, and summarization of standard form contracts. PhD thesis, Technische Universit \"a t M \"u nchen (2021) botherref
2021
-
[12]
, Holzenberger , N
bchapter Blair-Stanek , A. , Holzenberger , N. , Van Durme , B. : BLT : Can large language models handle basic legal text? In: Aletras , N. , Chalkidis , I. , Barrett , L. , Goanț a , C. , Preoțiuc-Pietro , D. , Spanakis , G. (eds.) Proceedings of the Natural Legal Language Pr...
2024 doi
-
[13]
, Chaperon , G
botherref Ca \ n ete , J. , Chaperon , G. , Fuentes , R. , Ho , J.-H. , Kang , H. , P \'e rez , J. : Spanish Pre-trained BERT Model and Evaluation Data . arXiv (2023) botherref
2023
-
[14]
, Donoso , S
bchapter Ca \ n ete , J. , Donoso , S. , Bravo-Marquez , F. , Carvallo , A. , Araujo , V. : ALBETO and D istil BETO : Lightweight S panish language models . In: Calzolari , N. , B \'e chet , F. , Blache , P. , Choukri , K. , Cieri , C. , Declerck , T. , Goggi , S. , Isahara , ...
2022
-
[15]
, Fergadiotis , M
bchapter Chalkidis , I. , Fergadiotis , M. , Malakasiotis , P. , Aletras , N. , Androutsopoulos , I. : LEGAL - BERT : The muppets straight out of law school . In: Cohn , T. , He , Y. , Liu , Y. (eds.) Findings of the Association for Computational Linguistics: EMNLP 2020 , pp. ...
2020 doi
-
[16]
, Jana , A
bchapter Chalkidis , I. , Jana , A. , Hartung , D. , Bommarito , M. , Androutsopoulos , I. , Katz , D. , Aletras , N. : L ex GLUE : A benchmark dataset for legal language understanding in E nglish . In: Muresan , S. , Nakov , P. , Villavicencio , A. (eds.) Proceedings of the 6...
2022 doi
-
[17]
, Khandelwal , K
bchapter Conneau , A. , Khandelwal , K. , Goyal , N. , Chaudhary , V. , Wenzek , G. , Guzm \'a n , F. , Grave , E. , Ott , M. , Zettlemoyer , L. , Stoyanov , V. : Unsupervised cross-lingual representation learning at scale . In: Jurafsky , D. , Chai , J. , Schluter , N. , Tetr...
2020 doi
-
[18]
, Ning , M
botherref Cui , J. , Ning , M. , Li , Z. , Chen , B. , Yan , Y. , Li , H. , Ling , B. , Tian , Y. , Yuan , L. : Chatlaw: A Multi-Agent Collaborative Legal Assistant with Knowledge Graph Enhanced Mixture-of-Experts Large Language Model . arXiv (2024) botherref
2024
-
[19]
, Vapnik , V
barticle Cortes , C. , Vapnik , V. : Support-vector networks . Machine Learning 20 ( 3 ), 273 -- 297 ( 1995 ) 10.1007/BF00994018 barticle
1995 doi
-
[20]
, Zheng , L
bchapter Chiang , W.-L. , Zheng , L. , Sheng , Y. , Angelopoulos , A.N. , Li , T. , Li , D. , Zhu , B. , Zhang , H. , Jordan , M.I. , Gonzalez , J.E. , Stoica , I. : Chatbot arena: an open platform for evaluating llms by human preference . In: Proceedings of the 41st Internati...
2024
-
[21]
, Chang , M.-W
bchapter Devlin , J. , Chang , M.-W. , Lee , K. , Toutanova , K. : BERT : Pre-training of Deep Bidirectional Transformers for Language Understanding . In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics : Human ...
2019
-
[22]
: Contratos por adhesi \'o n y cl \'a usulas abusivas Por qu \'e el Estado y no solamente el mercado? Revista chilena de derecho privado (1), 109--148 (2003) botherref
botherref de la Maza Gazmuri , I. : Contratos por adhesi \'o n y cl \'a usulas abusivas Por qu \'e el Estado y no solamente el mercado? Revista chilena de derecho privado (1), 109--148 (2003) botherref
2003
-
[23]
, Garc \'i a Pablos , A
bchapter Gibert Bonet , O. , Garc \'i a Pablos , A. , Cuadros , M. , Melero , M. : S panish datasets for sensitive entity detection in the legal domain . In: Calzolari , N. , B \'e chet , F. , Blache , P. , Choukri , K. , Cieri , C. , Declerck , T. , Goggi , S. , Isahara , H. ...
2022
-
[24]
, Galassi , A
bchapter Drawzeski , K. , Galassi , A. , Jablonowska , A. , Lagioia , F. , Lippi , M. , Micklitz , H.W. , Sartor , G. , Tagiuri , G. , Torroni , P. : A Corpus for Multilingual Analysis of Online Terms of Service . In: Proceedings of the Natural Legal Language Processing Worksh...
2021 doi
-
[25]
, Jauhri , A
botherref Dubey , A. , Jauhri , A. , Pandey , A. , Kadian , A. , Al-Dahle , A. , Letman , A. , Mathur , A. , Schelten , A. , Yang , A. , Fan , A. , Goyal , A. , Hartshorn , A. , Yang , A. , Mitra , A. , Sravankumar , A. , Korenev , A. , Hinsvark , A. , Rao , A. , Zhang , A. , ...
2024
-
[26]
, Koz owski , M
barticle Dadas , S. , Koz owski , M. , Po \'s wiata , R. , Pere kiewicz , M. , Bia as , M. , Gr e bowiec , M. : A support system for the detection of abusive clauses in B2C contracts . Artificial Intelligence and Law ( 2024 ) 10.1007/s10506-024-09408-8 barticle
2024 doi
-
[27]
, Nanda , V
botherref Dominguez-Olmedo , R. , Nanda , V. , Abebe , R. , Bechtold , S. , Engel , C. , Frankenreiter , J. , Gummadi , K. , Hardt , M. , Livermore , M. : Lawma: The Power of Specialization for Legal Tasks . arXiv (2024) botherref
2024
-
[28]
, Shen , X
bchapter Fei , Z. , Shen , X. , Zhu , D. , Zhou , F. , Han , Z. , Huang , A. , Zhang , S. , Chen , K. , Yin , Z. , Shen , Z. , Ge , J. , Ng , V. : L aw B ench: Benchmarking legal knowledge of large language models . In: Al-Onaizan , Y. , Bansal , M. , Chen , Y.-N. (eds.) Proce...
2024 doi
-
[29]
, Armengol-Estap \'e , J
botherref Guti \'e rrez-Fandi \ n o , A. , Armengol-Estap \'e , J. , Gonzalez-Agirre , A. , Villegas , M. : Spanish Legalese Language Model and Corpora . arXiv (2021) botherref
2021
-
[30]
, Armengol-Estap \'e , J
botherref Guti \'e rrez-Fandi \ n o , A. , Armengol-Estap \'e , J. , P \`a mies , M. , Llop-Palao , J. , Silveira-Ocampo , J. , Carrino , C.P. , Gonzalez-Agirre , A. , Armentano-Oller , C. , Rodriguez-Penagos , C. , Villegas , M. : MarIA : Spanish Language Models . Procesamien...
2022 arXiv
-
[31]
, Lagioia , F
barticle Galassi , A. , Lagioia , F. , Jab onowska , A. , Lippi , M. : Unfair clause detection in terms of service across multiple languages . Artificial Intelligence and Law ( 2024 ) 10.1007/s10506-024-09398-7 barticle
2024 doi
-
[32]
, Nyarko , J
bchapter Guha , N. , Nyarko , J. , Ho , D.E. , R\' e , C. , Chilton , A. , Narayana , A. , Chohlas-Wood , A. , Peters , A. , Waldon , B. , Rockmore , D.N. , Zambrano , D. , Talisman , D. , Hoque , E. , Surani , F. , Fagan , F. , Sarfaty , G. , Dickinson , G.M. , Porat , H. , H...
2023
-
[33]
, Pathak , S
botherref Gemma Team , Riviere , M. , Pathak , S. , Sessa , P.G. , Hardin , C. , Bhupatiraju , S. , Hussenot , L. , Mesnard , T. , Shahriari , B. , Ram \'e , A. , Ferret , J. , Liu , P. , Tafti , P. , Friesen , A. , Casbon , M. , Ramos , S. , Kumar , R. , Lan , C.L. , Jerome ,...
2024
-
[34]
, Tagarelli , A
barticle Greco , C.M. , Tagarelli , A. : Bringing order into the realm of Transformer-based language models for artificial intelligence and law . Artificial Intelligence and Law 32 ( 4 ), 863 -- 1010 ( 2024 ) 10.1007/s10506-023-09374-7 barticle
2024 doi
-
[35]
, Burns , C
bchapter Hendrycks , D. , Burns , C. , Basart , S. , Zou , A. , Mazeika , M. , Song , D. , Steinhardt , J. : Measuring massive multitask language understanding . In: International Conference on Learning Representations ( 2021 ). https://openreview.net/forum?id=d7KBjmI3GmQ bchapter
2021
-
[36]
, Gao , J
bchapter He , P. , Gao , J. , Chen , W. : De BERT av3: Improving de BERT a using ELECTRA -style pre-training with gradient-disentangled embedding sharing . In: The Eleventh International Conference on Learning Representations ( 2023 ). https://openreview.net/forum?id=sE7-XhLxH...
2023
-
[37]
, Zhuge , M
botherref Hong , S. , Zhuge , M. , Chen , J. , Zheng , X. , Cheng , Y. , Zhang , C. , Wang , J. , Wang , Z. , Yau , S.K.S. , Lin , Z. , Zhou , L. , Ran , C. , Xiao , L. , Wu , C. , Schmidhuber , J. : MetaGPT : Meta Programming for A Multi-Agent Collaborative Framework . arXiv ...
-
[38]
, Ba , J.L
bchapter Kingma , D.P. , Ba , J.L. : ADAM : A Method for Stochastic Optimization . In: International Conference on Learning Representations ( 2015 ) bchapter
2015
-
[39]
, Contissa , G
barticle Lippi , M. , Contissa , G. , Jablonowska , A. , Lagioia , F. , Micklitz , H.-W. , Palka , P. , Sartor , G. , Torroni , P. : The Force Awakens : Artificial Intelligence for Consumer Law . Journal of Artificial Intelligence Research 67 , 169 -- 190 ( 2020 ) 10.1613/jair...
2020 doi
-
[40]
: The Hyper Vulnerable Consumer as a Weak Party in Chilean Law : A Taxonomy and Scope of the Applicable Legal Protection
barticle L \'o pez D \'i az , P.V. : The Hyper Vulnerable Consumer as a Weak Party in Chilean Law : A Taxonomy and Scope of the Applicable Legal Protection . Latin American Legal Studies 10 ( 2 ), 340 -- 415 ( 2022 ) 10.15691/0719-9112Vol10n2a7 barticle
2022 doi
-
[41]
, Ning , X
bchapter Li , S. , Ning , X. , Wang , L. , Liu , T. , Shi , X. , Yan , S. , Dai , G. , Yang , H. , Wang , Y. : Evaluating Quantized Large Language Models . In: Proceedings of the 41st International Conference on Machine Learning , Vienna, Austria ( 2024 ) bchapter
2024
-
[42]
, Ott , M
botherref Liu , Y. , Ott , M. , Goyal , N. , Du , J. , Joshi , M. , Chen , D. , Levy , O. , Lewis , M. , Zettlemoyer , L. , Stoyanov , V. : RoBERTa : A Robustly Optimized BERT Pretraining Approach . arXiv (2019) botherref
2019
-
[43]
, Palka , P
barticle Lippi , M. , Palka , P. , Contissa , G. , Lagioia , F. , Micklitz , H.-W. , Sartor , G. , Torroni , P. : CLAUDETTE : An Automated Detector of Potentially Unfair Clauses in Online Terms of Service . Artificial Intelligence and Law 27 ( 2 ), 117 -- 139 ( 2019 ) 10.1007/...
2019 arXiv
-
[44]
botherref Mistral AI Team : AI in Abundance (2024) botherref
2024
-
[45]
botherref Mistral AI Team : Mistral NeMo (2024) botherref
2024
-
[46]
: Human-in-the- Loop Machine Learning : Active Learning and Annotation for Human-Centered AI
bbook Monarch , R. : Human-in-the- Loop Machine Learning : Active Learning and Annotation for Human-Centered AI . Simon and Schuster , Sherlter Island, NY ( 2021 ) bbook
2021
-
[47]
: Algunos problemas de la extensi \'o n del Derecho del consumo a contratos entre empresarios en el ordenamiento jur \'i dico chileno
bchapter Morales , M.E. : Algunos problemas de la extensi \'o n del Derecho del consumo a contratos entre empresarios en el ordenamiento jur \'i dico chileno . In: Estudios de Derecho Del Consumidor II , 2021 edn. Jornadas Nacionales de Derecho Del Consumo , p. 176 . Rubic \'o...
2021
-
[48]
, Pimentel , T
bchapter Mosbach , M. , Pimentel , T. , Ravfogel , S. , Klakow , D. , Elazar , Y. : Few-shot Fine-tuning vs. In-context Learning : A Fair Comparison and Evaluation . In: Findings of the Association for Computational Linguistics : ACL 2023 , pp. 12284 -- 12314 . Association for...
2023 doi
-
[49]
, Piscaglia , N
barticle Moro , G. , Piscaglia , N. , Ragazzi , L. , Italiani , P. : Multi-language transfer learning for low-resource legal case summarization . Artificial Intelligence and Law 32 ( 4 ), 1111 -- 1139 ( 2024 ) 10.1007/s10506-023-09373-8 barticle
2024 doi
-
[50]
, Matoshi , V
bchapter Niklaus , J. , Matoshi , V. , Rani , P. , Galassi , A. , St \"u rmer , M. , Chalkidis , I. : LEXTREME : A Multi-Lingual and Multi-Task Benchmark for the Legal Domain . In: Findings of the Association for Computational Linguistics : EMNLP 2023 , pp. 3016 -- 3054 ( 2023...
2023 doi
-
[51]
, Adler , S
botherref OpenAI , Achiam , J. , Adler , S. , Agarwal , S. , Ahmad , L. , Akkaya , I. , Aleman , F.L. , Almeida , D. , Altenschmidt , J. , Altman , S. , Anadkat , S. , Avila , R. , Babuschkin , I. , Balaji , S. , Balcom , V. , Baltescu , P. , Bao , H. , Bavarian , M. , Belgum ...
2024
-
[52]
botherref OpenAI : GPT-4o System Card (2024) botherref
2024
-
[53]
, Neumann , M
bchapter Peters , M.E. , Neumann , M. , Iyyer , M. , Gardner , M. , Clark , C. , Lee , K. , Zettlemoyer , L. : Deep contextualized word representations . In: Walker , M. , Ji , H. , Stent , A. (eds.) Proceedings of the 2018 Conference of the North A merican Chapter of the Asso...
2018 doi
-
[54]
, Schlinger , E
bchapter Pires , T. , Schlinger , E. , Garrette , D. : How Multilingual is Multilingual BERT ? In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics , pp. 4996 -- 5001 . Association for Computational Linguistics , Florence, Italy ( 2019 )....
2019 doi
-
[55]
: El fracaso de un sistema: An \'a lisis emp \'i rico y dogm \'a tico del control de cl \'a usulas abusivas en contratos por adhesi \'o n
botherref Pizarro Wilson , C. : El fracaso de un sistema: An \'a lisis emp \'i rico y dogm \'a tico del control de cl \'a usulas abusivas en contratos por adhesi \'o n. Revista de derecho (Valdivia) 20(2) (2007) 10.4067/S0718-09502007000200002 botherref
2007 doi
-
[56]
, Lagioia , F
barticle Ruggeri , F. , Lagioia , F. , Lippi , M. , Torroni , P. : Detecting and explaining unfairness in consumer contracts through memory networks . Artificial Intelligence and Law 30 ( 1 ), 59 -- 92 ( 2022 ) 10.1007/s10506-021-09288-2 barticle
2022 doi
-
[57]
, Wu , J
barticle Radford , A. , Wu , J. , Child , R. , Luan , D. , Amodei , D. , Sutskever , I. , : Language models are unsupervised multitask learners . OpenAI blog 1 ( 8 ), 9 ( 2019 ) barticle
2019
-
[58]
: Dynamic Time Warping Algorithm Review
botherref Senin , P. : Dynamic Time Warping Algorithm Review . Technical report, Information and Computer Science Department, University of Hawaii at Manoa , Honolulu, HI (2008) botherref
2008
-
[59]
Aprueba Circular Interpretativa Sobre Criterios de Equidad En Las Estipulaciones Contenidas En Contratos de Adhesi \'o n de Consumo
botherref SERNAC : Resoluci \'o n Exenta N ^ 931. Aprueba Circular Interpretativa Sobre Criterios de Equidad En Las Estipulaciones Contenidas En Contratos de Adhesi \'o n de Consumo. (2021) botherref
2021
-
[60]
, Medvedeva , M
barticle Schepers , I. , Medvedeva , M. , Bruijn , M. , Wieling , M. , Vols , M. : Predicting citations in Dutch case law with natural language processing . Artificial Intelligence and Law 32 ( 3 ), 807 -- 837 ( 2024 ) 10.1007/s10506-023-09368-5 barticle
2024 doi
-
[61]
, Suzgun , M
bchapter Shi , F. , Suzgun , M. , Freitag , M. , Wang , X. , Srivats , S. , Vosoughi , S. , Chung , H.W. , Tay , Y. , Ruder , S. , Zhou , D. , Das , D. , Wei , J. : Language models are multilingual chain-of-thought reasoners . In: The Eleventh International Conference on Learn...
2023
-
[62]
, Tsoumakas , G
bchapter Sechidis , K. , Tsoumakas , G. , Vlahavas , I. : On the Stratification of Multi-label Data . In: Gunopulos , D. , Hofmann , T. , Malerba , D. , Vazirgiannis , M. (eds.) Machine Learning and Knowledge Discovery in Databases vol. 6913 , pp. 145 -- 158 . Springer , Berli...
2011 doi
-
[63]
, Rocha , I.M
bchapter Tocchini , M. , Rocha , I.M. , de Barros , R.M. , e Silva , J.O. , Garcia , A.F. , Zular , F. , Maranh \ a o , J. , Sichman , J. : Detection of Potentially Non-compliant Clauses in Online ToS in Portuguese . In: Santos , M.F. , Machado , J. , Novais , P. , Cortez , P....
2024 doi
-
[64]
, Han , K
bchapter Vaze , S. , Han , K. , Vedaldi , A. , Zisserman , A. : Open-set recognition: A good closed-set classifier is all you need . In: International Conference on Learning Representations ( 2022 ). https://openreview.net/forum?id=5hLP5JY9S2d bchapter
2022
-
[65]
, Shazeer , N
bchapter Vaswani , A. , Shazeer , N. , Parmar , N. , Uszkoreit , J. , Jones , L. , Gomez , A.N. , Kaiser , L. , Polosukhin , I. : Attention is all you need . In: Proceedings of the 31st International Conference on Neural Information Processing Systems . NIPS'17 , pp. 6000 -- 6...
2017
-
[66]
, Hu , L
botherref Xu , Y. , Hu , L. , Zhao , J. , Qiu , Z. , Ye , Y. , Gu , H. : A Survey on Multilingual Large Language Models : Corpora , Alignment , and Bias . arXiv (2024) botherref
2024
-
[67]
, Yang , B
botherref Yang , A. , Yang , B. , Hui , B. , Zheng , B. , Yu , B. , Zhou , C. , Li , C. , Li , C. , Liu , D. , Huang , F. , Dong , G. , Wei , H. , Lin , H. , Tang , J. , Wang , J. , Yang , J. , Tu , J. , Zhang , J. , Ma , J. , Yang , J. , Xu , J. , Zhou , J. , Bai , J. , He , ...
2024
-
[68]
, Chen , H
barticle Zhao , H. , Chen , H. , Yang , F. , Liu , N. , Deng , H. , Cai , H. , Wang , S. , Yin , D. , Du , M. : Explainability for Large Language Models : A Survey . ACM Transactions on Intelligent Systems and Technology 15 ( 2 ), 1 -- 38 ( 2024 ) 10.1145/3639372 barticle
2024 doi
-
[69]
, " * write output.state after.block = add.period write newline
ENTRY address archive author booktitle chapter doi edition editor eid eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year archivePrefix primaryClass adsurl adsnote version label extra.labe...
-
[70]
write newline
" write newline "" before.all 'output.state := FUNCTION add.period duplicate empty 'skip "." * add.blank if FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap dupl...
-
[71]
write newline
" write newline "" before.all 'output.state := FUNCTION output.doi doi empty skip "doi:" doi * "" * output if FUNCTION format.archive archivePrefix empty "" archivePrefix ":" * if FUNCTION format.primaryClass primaryClass empty "" " [" primaryClass * "] " * if FUNCTION format....
-
[72]
write newline
" write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTI...
-
[73]
write newline
" write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTI...
-
[74]
, " * write output.state after.block = add.period write newline
ENTRY address archive author booktitle chapter edition editor eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url doi volume year archivePrefix primaryClass eid adsurl adsnote version label INTEGERS o...
-
[75]
write newline
" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...
-
[76]
Available from:
ENTRY address assignee author booktitle chapter cartographer day edition editor howpublished institution inventor journal key keywords month note number organization pages part publisher school series title type volume word year eprint doi url lastchecked updated archive archi...
-
[77]
write newline
" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...
Reviewed August 9, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.