{"url":"/sota/natural-language-inference-on-anli-test","task":{"name":"Natural Language Inference","url":"/task/natural-language-inference","note":null},"dataset":{"name":"ANLI test","url":"/dataset/anli"},"category":"Natural Language Processing","categories":["Natural Language Processing","Reasoning"],"category_note":null,"description":"**Natural language inference (NLI)** is the task of determining whether a \"hypothesis\" is \r\ntrue (entailment), false (contradiction), or undetermined (neutral) given a \"premise\".\r\n\r\nExample:\r\n\r\n| Premise | Label | Hypothesis |\r\n| --- | ---| --- |\r\n| A man inspects the uniform of a figure in some East Asian country. | contradiction | The man is sleeping. |\r\n| An older and younger man smiling. | neutral  | Two men are smiling and laughing at the cats playing on the floor. |\r\n| A soccer game with multiple males playing. | entailment | Some men are playing a sport. |\r\n\r\nApproaches used for NLI include earlier symbolic and statistical approaches to more recent deep learning approaches. Benchmark datasets used for NLI include [SNLI](/dataset/snli), [MultiNLI](/dataset/multinli), [SciTail](/dataset/scitail), among others. You can get hands-on practice on the SNLI task by following this [d2l.ai chapter](https://d2l.ai/chapter_natural-language-processing-applications/natural-language-inference-and-dataset.html).\r\n\r\nFurther readings:\r\n\r\n- [Recent Advances in Natural Language Inference: A Survey of Benchmarks, Resources, and Approaches](https://arxiv.org/abs/1904.01172)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["A1","A2","A3"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"A1":null,"A2":null,"A3":null}},"counts":{"rows":25,"rows_with_code":16,"rows_with_paper_page":25,"rows_dated":25,"rows_using_additional_data":5},"rows":[{"rank_in_archive_order":1,"model":"T5-3B (explanation prompting)","metrics":{"A1":"81.8","A2":"72.5","A3":"74.8"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/prompting-for-explanations-improves","paper_url":"https://aclanthology.org/2023.findings-eacl.162/","paper_title":"Prompting for explanations improves Adversarial NLI. Is this true? {Yes} it is {true} because {it weakens superficial cues}","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"T0-11B (explanation prompting)","metrics":{"A1":"75.6","A2":"60.6","A3":"59.9"},"uses_additional_data":false,"paper_date":"2023-05-01","paper":"/paper/prompting-for-explanations-improves","paper_url":"https://aclanthology.org/2023.findings-eacl.162/","paper_title":"Prompting for explanations improves Adversarial NLI. Is this true? {Yes} it is {true} because {it weakens superficial cues}","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"InfoBERT (RoBERTa)","metrics":{"A1":"75","A2":"50.5","A3":"47.7"},"uses_additional_data":true,"paper_date":"2020-10-05","paper":"/paper/infobert-improving-robustness-of-language-1","paper_url":"https://arxiv.org/abs/2010.02329v4","paper_title":"InfoBERT: Improving Robustness of Language Models from An Information Theoretic Perspective","code":"https://github.com/facebookresearch/anli","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":4}},{"rank_in_archive_order":4,"model":"PaLM 2-L (one-shot)","metrics":{"A1":"73.1","A2":"63.4","A3":"67.1"},"uses_additional_data":false,"paper_date":"2023-05-17","paper":"/paper/palm-2-technical-report-1","paper_url":"https://arxiv.org/abs/2305.10403v3","paper_title":"PaLM 2 Technical Report","code":"https://github.com/eternityyw/tram-benchmark","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"RoBERTa (Large)","metrics":{"A1":"72.4","A2":"49.8","A3":"44.4"},"uses_additional_data":true,"paper_date":"2019-07-26","paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","paper_url":"https://arxiv.org/abs/1907.11692v1","paper_title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","code":"https://github.com/huggingface/transformers","n_code_links":67,"syntology":{"n_ran":37,"n_unverified":11,"n_samples":48,"n_pointer_only_licence":23}},{"rank_in_archive_order":6,"model":"ALUM (RoBERTa-LARGE)","metrics":{"A1":"72.3","A2":"52.1","A3":"48.4"},"uses_additional_data":true,"paper_date":"2020-04-20","paper":"/paper/adversarial-training-for-large-neural","paper_url":"https://arxiv.org/abs/2004.08994v2","paper_title":"Adversarial Training for Large Neural Language Models","code":"https://github.com/namisan/mt-dnn","n_code_links":3,"syntology":null},{"rank_in_archive_order":7,"model":"XLNet (Large)","metrics":{"A1":"70.3","A2":"50.9","A3":"49.4"},"uses_additional_data":true,"paper_date":"2019-06-19","paper":"/paper/xlnet-generalized-autoregressive-pretraining","paper_url":"https://arxiv.org/abs/1906.08237v2","paper_title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","code":"https://github.com/huggingface/transformers","n_code_links":27,"syntology":{"n_ran":10,"n_unverified":14,"n_samples":24,"n_pointer_only_licence":3}},{"rank_in_archive_order":8,"model":"ChatGPT","metrics":{"A1":"62.3","A2":"52.6","A3":"54.1"},"uses_additional_data":false,"paper_date":"2023-05-29","paper":"/paper/a-systematic-study-and-comprehensive","paper_url":"https://arxiv.org/abs/2305.18486v4","paper_title":"A Systematic Study and Comprehensive Evaluation of ChatGPT on Benchmark Datasets","code":"https://github.com/ntunlp/chatgpt_eval","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"PaLM 2-M (one-shot)","metrics":{"A1":"58.1","A2":"49.5","A3":"54.5"},"uses_additional_data":false,"paper_date":"2023-05-17","paper":"/paper/palm-2-technical-report-1","paper_url":"https://arxiv.org/abs/2305.10403v3","paper_title":"PaLM 2 Technical Report","code":"https://github.com/eternityyw/tram-benchmark","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"PaLM 2-S (one-shot)","metrics":{"A1":"53.1","A2":"48.8","A3":"53.2"},"uses_additional_data":false,"paper_date":"2023-05-17","paper":"/paper/palm-2-technical-report-1","paper_url":"https://arxiv.org/abs/2305.10403v3","paper_title":"PaLM 2 Technical Report","code":"https://github.com/eternityyw/tram-benchmark","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"T0-3B (CoT fine-tuned)","metrics":{"A1":"41.7","A2":"37.2","A3":"41.9"},"uses_additional_data":false,"paper_date":"2023-05-23","paper":"/paper/the-cot-collection-improving-zero-shot-and","paper_url":"https://arxiv.org/abs/2305.14045v2","paper_title":"The CoT Collection: Improving Zero-shot and Few-shot Learning of Language Models via Chain-of-Thought Fine-Tuning","code":"https://github.com/kaistai/cot-collection","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"Flipped-3B","metrics":{"A1":"39.99","A2":"37.05","A3":"37.73"},"uses_additional_data":false,"paper_date":"2022-10-06","paper":"/paper/guess-the-instruction-making-language-models","paper_url":"https://arxiv.org/abs/2210.02969v4","paper_title":"Guess the Instruction! Flipped Learning Makes Language Models Stronger Zero-Shot Learners","code":"https://github.com/seonghyeonye/flipped-learning","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"GPT-3","metrics":{"A1":"36.8","A2":"34","A3":"40.2"},"uses_additional_data":true,"paper_date":"2020-05-28","paper":"/paper/language-models-are-few-shot-learners","paper_url":"https://arxiv.org/abs/2005.14165v4","paper_title":"Language Models are Few-Shot Learners","code":"https://github.com/ggml-org/llama.cpp","n_code_links":67,"syntology":{"n_ran":41,"n_unverified":24,"n_samples":65,"n_pointer_only_licence":4}},{"rank_in_archive_order":14,"model":"KiC-770M","metrics":{"A1":"36.30","A2":"35.00","A3":"37.60"},"uses_additional_data":false,"paper_date":"2022-10-28","paper":"/paper/knowledge-in-context-towards-knowledgeable","paper_url":"https://arxiv.org/abs/2210.16433v3","paper_title":"Knowledge-in-Context: Towards Knowledgeable Semi-Parametric Language Models","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"RoE-3B","metrics":{"A1":"35.49","A2":"34.64","A3":"31.22"},"uses_additional_data":false,"paper_date":"2023-02-07","paper":"/paper/exploring-the-benefits-of-training-expert","paper_url":"https://arxiv.org/abs/2302.03202v2","paper_title":"Exploring the Benefits of Training Expert Language Models over Instruction Tuning","code":"https://github.com/joeljang/rlphf","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":16,"model":"BLOOM 176B (one-shot)","metrics":{"A1":"33.6","A2":"33.8","A3":"35.17"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/bloomberggpt-a-large-language-model-for","paper_url":"https://arxiv.org/abs/2303.17564v3","paper_title":"BloombergGPT: A Large Language Model for Finance","code":"https://github.com/yangletliu/finlora","n_code_links":2,"syntology":null},{"rank_in_archive_order":17,"model":"OPT 66B (one-shot)","metrics":{"A1":"33.1","A2":"34.2","A3":"34.92"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/bloomberggpt-a-large-language-model-for","paper_url":"https://arxiv.org/abs/2303.17564v3","paper_title":"BloombergGPT: A Large Language Model for Finance","code":"https://github.com/yangletliu/finlora","n_code_links":2,"syntology":null},{"rank_in_archive_order":18,"model":"Bloomberg GPT (one-shot)","metrics":{"A1":"32.9","A2":"34.4","A3":"37.33"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/bloomberggpt-a-large-language-model-for","paper_url":"https://arxiv.org/abs/2303.17564v3","paper_title":"BloombergGPT: A Large Language Model for Finance","code":"https://github.com/yangletliu/finlora","n_code_links":2,"syntology":null},{"rank_in_archive_order":19,"model":"GPT-NeoX (one-shot)","metrics":{"A1":"32.6","A2":"33.8","A3":"36.17"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/bloomberggpt-a-large-language-model-for","paper_url":"https://arxiv.org/abs/2303.17564v3","paper_title":"BloombergGPT: A Large Language Model for Finance","code":"https://github.com/yangletliu/finlora","n_code_links":2,"syntology":null},{"rank_in_archive_order":20,"model":"PaLM 540B (Self Improvement, Self Consistency)","metrics":{"A2":"66.5","A3":"67.9"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":21,"model":"PaLM 540B (Self Improvement, CoT Prompting)","metrics":{"A2":"65.3","A3":"67.3"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":22,"model":"PaLM 540B (Self Improvement, Standard-Prompting)","metrics":{"A2":"64.8","A3":"66.9"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":23,"model":"PaLM 540B (Self Consistency)","metrics":{"A2":"64.5","A3":"63.4"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":24,"model":"PaLM 540B (CoT Prompting)","metrics":{"A2":"58.9","A3":"60.6"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":25,"model":"PaLM 540B (Standard-Prompting)","metrics":{"A2":"55.8","A3":"55.8"},"uses_additional_data":false,"paper_date":"2022-10-20","paper":"/paper/large-language-models-can-self-improve","paper_url":"https://arxiv.org/abs/2210.11610v2","paper_title":"Large Language Models Can Self-Improve","code":null,"n_code_links":0,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,821 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6821,"papers_extracted_not_yet_verified":65,"boards_without_verdict":29,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":5,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":5,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":95,"n_unverified":49,"n_samples":144,"n_pointer_only_licence":37,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":95,"n_unverified":49,"n_samples":144,"n_pointer_only_licence":37,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}