{"url":"/sota/natural-language-inference-on-wnli","task":{"name":"Natural Language Inference","url":"/task/natural-language-inference","note":null},"dataset":{"name":"WNLI","url":"/dataset/wnli"},"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":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":23,"rows_with_code":21,"rows_with_paper_page":22,"rows_dated":22,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Turing NLR v5 XXL 5.4B (fine-tuned)","metrics":{"Accuracy":"95.9"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"DeBERTa","metrics":{"Accuracy":"94.5"},"uses_additional_data":false,"paper_date":"2020-06-05","paper":"/paper/deberta-decoding-enhanced-bert-with","paper_url":"https://arxiv.org/abs/2006.03654v6","paper_title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":{"n_ran":4,"n_unverified":9,"n_samples":13,"n_pointer_only_licence":3}},{"rank_in_archive_order":3,"model":"T5-XXL 11B","metrics":{"Accuracy":"93.2"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":2,"n_unverified":29,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"XLNet","metrics":{"Accuracy":"92.5"},"uses_additional_data":false,"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":5,"model":"ALBERT","metrics":{"Accuracy":"91.8"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/albert-a-lite-bert-for-self-supervised","paper_url":"https://arxiv.org/abs/1909.11942v6","paper_title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","code":"https://github.com/huggingface/transformers","n_code_links":48,"syntology":{"n_ran":46,"n_unverified":80,"n_samples":126,"n_pointer_only_licence":22}},{"rank_in_archive_order":6,"model":"T5-XL 3B","metrics":{"Accuracy":"89.7"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":2,"n_unverified":29,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"StructBERTRoBERTa ensemble","metrics":{"Accuracy":"89.7"},"uses_additional_data":false,"paper_date":"2019-08-13","paper":"/paper/structbert-incorporating-language-structures","paper_url":"https://arxiv.org/abs/1908.04577v3","paper_title":"StructBERT: Incorporating Language Structures into Pre-training for Deep Language Understanding","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":8,"model":"HNNensemble","metrics":{"Accuracy":"89"},"uses_additional_data":false,"paper_date":"2019-07-27","paper":"/paper/a-hybrid-neural-network-model-for-commonsense","paper_url":"https://arxiv.org/abs/1907.11983v1","paper_title":"A Hybrid Neural Network Model for Commonsense Reasoning","code":"https://github.com/namisan/mt-dnn","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"RoBERTa (ensemble)","metrics":{"Accuracy":"89"},"uses_additional_data":false,"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":22,"n_unverified":26,"n_samples":48,"n_pointer_only_licence":23}},{"rank_in_archive_order":10,"model":"T5-Large 770M","metrics":{"Accuracy":"85.6"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":2,"n_unverified":29,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":11,"model":"HNN","metrics":{"Accuracy":"83.6"},"uses_additional_data":false,"paper_date":"2019-07-27","paper":"/paper/a-hybrid-neural-network-model-for-commonsense","paper_url":"https://arxiv.org/abs/1907.11983v1","paper_title":"A Hybrid Neural Network Model for Commonsense Reasoning","code":"https://github.com/namisan/mt-dnn","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"T5-Base 220M","metrics":{"Accuracy":"78.8"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":2,"n_unverified":29,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"BERTwiki 340M (fine-tuned on WSCR)","metrics":{"Accuracy":"74.7"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/a-surprisingly-robust-trick-for-winograd","paper_url":"https://arxiv.org/abs/1905.06290v2","paper_title":"A Surprisingly Robust Trick for Winograd Schema Challenge","code":"https://github.com/vid-koci/bert-commonsense","n_code_links":2,"syntology":null},{"rank_in_archive_order":14,"model":"FLAN 137B (zero-shot)","metrics":{"Accuracy":"74.6"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"BERT-large 340M (fine-tuned on WSCR)","metrics":{"Accuracy":"71.9"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/a-surprisingly-robust-trick-for-winograd","paper_url":"https://arxiv.org/abs/1905.06290v2","paper_title":"A Surprisingly Robust Trick for Winograd Schema Challenge","code":"https://github.com/vid-koci/bert-commonsense","n_code_links":2,"syntology":null},{"rank_in_archive_order":16,"model":"BERT-base 110M (fine-tuned on WSCR)","metrics":{"Accuracy":"70.5"},"uses_additional_data":false,"paper_date":"2019-05-15","paper":"/paper/a-surprisingly-robust-trick-for-winograd","paper_url":"https://arxiv.org/abs/1905.06290v2","paper_title":"A Surprisingly Robust Trick for Winograd Schema Challenge","code":"https://github.com/vid-koci/bert-commonsense","n_code_links":2,"syntology":null},{"rank_in_archive_order":17,"model":"FLAN 137B (few-shot, k=4)","metrics":{"Accuracy":"70.4"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"T5-Small 60M","metrics":{"Accuracy":"69.2"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":2,"n_unverified":29,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"ERNIE 2.0 Large","metrics":{"Accuracy":"67.8"},"uses_additional_data":false,"paper_date":"2019-07-29","paper":"/paper/ernie-20-a-continual-pre-training-framework","paper_url":"https://arxiv.org/abs/1907.12412v2","paper_title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/model_zoo/ernie-1.0","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":20,"model":"SqueezeBERT","metrics":{"Accuracy":"65.1"},"uses_additional_data":false,"paper_date":"2020-06-19","paper":"/paper/squeezebert-what-can-computer-vision-teach","paper_url":"https://arxiv.org/abs/2006.11316v1","paper_title":"SqueezeBERT: What can computer vision teach NLP about efficient neural networks?","code":"https://github.com/huggingface/transformers/blob/main/src/transformers/models/squeezebert/modeling_squeezebert.py","n_code_links":6,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"BERT-large 340M","metrics":{"Accuracy":"65.1"},"uses_additional_data":false,"paper_date":"2018-10-11","paper":"/paper/bert-pre-training-of-deep-bidirectional","paper_url":"https://arxiv.org/abs/1810.04805v2","paper_title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","code":"https://github.com/huggingface/transformers","n_code_links":534,"syntology":{"n_ran":204,"n_unverified":455,"n_samples":659,"n_pointer_only_licence":149}},{"rank_in_archive_order":22,"model":"RWKV-4-Raven-14B","metrics":{"Accuracy":"49.3"},"uses_additional_data":false,"paper_date":"2023-05-22","paper":"/paper/rwkv-reinventing-rnns-for-the-transformer-era","paper_url":"https://arxiv.org/abs/2305.13048v2","paper_title":"RWKV: Reinventing RNNs for the Transformer Era","code":"https://github.com/BlinkDL/RWKV-LM","n_code_links":14,"syntology":{"n_ran":3,"n_unverified":8,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":23,"model":"DistilBERT 66M","metrics":{"Accuracy":"44.4"},"uses_additional_data":false,"paper_date":"2019-10-02","paper":"/paper/distilbert-a-distilled-version-of-bert","paper_url":"https://arxiv.org/abs/1910.01108v4","paper_title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","code":"https://github.com/huggingface/transformers","n_code_links":37,"syntology":{"n_ran":19,"n_unverified":8,"n_samples":27,"n_pointer_only_licence":0}}],"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,795 of the 9,581 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":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+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":18,"rows_with_any_sample_ran":12,"distinct_papers_with_graph_line":12,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":310,"n_unverified":633,"n_samples":943,"n_pointer_only_licence":201,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":318,"n_unverified":751,"n_samples":1069,"n_pointer_only_licence":201,"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"}}}