{"url":"/sota/reading-comprehension-on-race","task":{"name":"Reading Comprehension","url":"/task/reading-comprehension","note":null},"dataset":{"name":"RACE","url":"/dataset/race"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"Most current question answering datasets frame the task as reading comprehension where the question is about a paragraph or document and the answer often is a span in the document. \r\n\r\nSome specific tasks of reading comprehension include multi-modal machine reading comprehension and textual machine reading comprehension, among others. In the literature, machine reading comprehension can be divide into four categories: **cloze style**, **multiple choice**, **span prediction**, and **free-form answer**.  Read more about each category [here](https://paperswithcode.com/paper/a-survey-on-machine-reading-comprehension-1).\r\n\r\nBenchmark datasets used for testing a model's reading comprehension abilities include [MovieQA](/dataset/movieqa), [ReCoRD](dataset/record), and [RACE](/dataset/race), among others.\r\n\r\nThe Machine Reading group at UCL also provides an [overview of reading comprehension tasks](https://uclnlp.github.io/ai4exams/data.html).\r\n\r\nFigure source: [A Survey on Machine Reading Comprehension: Tasks, Evaluation Metrics and Benchmark Datasets](https://arxiv.org/pdf/2006.11880.pdf)","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","Accuracy (Middle)","Accuracy (High)"],"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","Accuracy (Middle)":"higher","Accuracy (High)":"higher"}},"counts":{"rows":24,"rows_with_code":20,"rows_with_paper_page":24,"rows_dated":24,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"ALBERT (Ensemble)","metrics":{"Accuracy":"91.4"},"uses_additional_data":false,"paper_date":"2020-11-06","paper":"/paper/improving-machine-reading-comprehension-with-2","paper_url":"https://arxiv.org/abs/2011.03292v2","paper_title":"Improving Machine Reading Comprehension with Single-choice Decision and Transfer Learning","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"Megatron-BERT (ensemble)","metrics":{"Accuracy":"90.9","Accuracy (High)":"90.0","Accuracy (Middle)":"93.1"},"uses_additional_data":false,"paper_date":"2019-09-17","paper":"/paper/megatron-lm-training-multi-billion-parameter","paper_url":"https://arxiv.org/abs/1909.08053v4","paper_title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","code":"https://github.com/NVIDIA/Megatron-LM","n_code_links":10,"syntology":{"n_ran":12,"n_unverified":35,"n_samples":47,"n_pointer_only_licence":15}},{"rank_in_archive_order":3,"model":"ALBERTxxlarge+DUMA(ensemble)","metrics":{"Accuracy":"89.8","Accuracy (High)":"92.6","Accuracy (Middle)":"88.7"},"uses_additional_data":false,"paper_date":"2020-01-26","paper":"/paper/dual-multi-head-co-attention-for-multi-choice","paper_url":"https://arxiv.org/abs/2001.09415v5","paper_title":"DUMA: Reading Comprehension with Transposition Thinking","code":"https://github.com/pfZhu/duma_code","n_code_links":3,"syntology":null},{"rank_in_archive_order":4,"model":"Megatron-BERT","metrics":{"Accuracy":"89.5","Accuracy (High)":"88.6","Accuracy (Middle)":"91.8"},"uses_additional_data":false,"paper_date":"2019-09-17","paper":"/paper/megatron-lm-training-multi-billion-parameter","paper_url":"https://arxiv.org/abs/1909.08053v4","paper_title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","code":"https://github.com/NVIDIA/Megatron-LM","n_code_links":10,"syntology":{"n_ran":12,"n_unverified":35,"n_samples":47,"n_pointer_only_licence":15}},{"rank_in_archive_order":5,"model":"DeBERTalarge","metrics":{"Accuracy":"86.8"},"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":6,"model":"B10-10-10","metrics":{"Accuracy":"85.7","Accuracy (High)":"84.4","Accuracy (Middle)":"88.8"},"uses_additional_data":false,"paper_date":"2020-06-05","paper":"/paper/funnel-transformer-filtering-out-sequential","paper_url":"https://arxiv.org/abs/2006.03236v1","paper_title":"Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processing","code":"https://github.com/huggingface/transformers","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"RoBERTa","metrics":{"Accuracy":"83.2","Accuracy (High)":"81.3","Accuracy (Middle)":"86.5"},"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":8,"model":"Orca 2-13B","metrics":{"Accuracy":"82.87"},"uses_additional_data":false,"paper_date":"2023-11-18","paper":"/paper/orca-2-teaching-small-language-models-how-to","paper_url":"https://arxiv.org/abs/2311.11045v2","paper_title":"Orca 2: Teaching Small Language Models How to Reason","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"Orca 2-7B","metrics":{"Accuracy":"80.79"},"uses_additional_data":false,"paper_date":"2023-11-18","paper":"/paper/orca-2-teaching-small-language-models-how-to","paper_url":"https://arxiv.org/abs/2311.11045v2","paper_title":"Orca 2: Teaching Small Language Models How to Reason","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"HAT (Encoder)","metrics":{"Accuracy":"67.3"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/hierarchical-learning-for-generation-with","paper_url":"https://arxiv.org/abs/2104.07545v2","paper_title":"Hierarchical Learning for Generation with Long Source Sequences","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":11,"model":"XLNet","metrics":{"Accuracy (High)":"84.0","Accuracy (Middle)":"88.6"},"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":12,"model":"PaLM 540B (zero-shot)","metrics":{"Accuracy (High)":"49.1","Accuracy (Middle)":"68.1"},"uses_additional_data":false,"paper_date":"2022-04-05","paper":"/paper/palm-scaling-language-modeling-with-pathways-1","paper_url":"https://arxiv.org/abs/2204.02311v5","paper_title":"PaLM: Scaling Language Modeling with Pathways","code":"https://github.com/lucidrains/CoCa-pytorch","n_code_links":7,"syntology":{"n_ran":30,"n_unverified":7,"n_samples":37,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"LLaMA 65B (zero-shot)","metrics":{"Accuracy (High)":"51.6","Accuracy (Middle)":"67.9"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":26,"n_unverified":32,"n_samples":58,"n_pointer_only_licence":4}},{"rank_in_archive_order":14,"model":"PaLM 62B (zero-shot)","metrics":{"Accuracy (High)":"47.5","Accuracy (Middle)":"64.3"},"uses_additional_data":false,"paper_date":"2022-04-05","paper":"/paper/palm-scaling-language-modeling-with-pathways-1","paper_url":"https://arxiv.org/abs/2204.02311v5","paper_title":"PaLM: Scaling Language Modeling with Pathways","code":"https://github.com/lucidrains/CoCa-pytorch","n_code_links":7,"syntology":{"n_ran":30,"n_unverified":7,"n_samples":37,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"LLaMA 33B (zero-shot)","metrics":{"Accuracy (High)":"48.3","Accuracy (Middle)":"64.1"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":26,"n_unverified":32,"n_samples":58,"n_pointer_only_licence":4}},{"rank_in_archive_order":16,"model":"LLaMA 13B (zero-shot)","metrics":{"Accuracy (High)":"47.2","Accuracy (Middle)":"61.6"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":26,"n_unverified":32,"n_samples":58,"n_pointer_only_licence":4}},{"rank_in_archive_order":17,"model":"LLaMA 7B (zero-shot)","metrics":{"Accuracy (High)":"46.9","Accuracy (Middle)":"61.1"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":26,"n_unverified":32,"n_samples":58,"n_pointer_only_licence":4}},{"rank_in_archive_order":18,"model":"GPT-3 175B (0-shot)","metrics":{"Accuracy (Middle)":"58.4"},"uses_additional_data":false,"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":15,"n_unverified":50,"n_samples":65,"n_pointer_only_licence":4}},{"rank_in_archive_order":19,"model":"PaLM 8B (zero-shot)","metrics":{"Accuracy (High)":"42.3","Accuracy (Middle)":"57.9"},"uses_additional_data":false,"paper_date":"2022-04-05","paper":"/paper/palm-scaling-language-modeling-with-pathways-1","paper_url":"https://arxiv.org/abs/2204.02311v5","paper_title":"PaLM: Scaling Language Modeling with Pathways","code":"https://github.com/lucidrains/CoCa-pytorch","n_code_links":7,"syntology":{"n_ran":30,"n_unverified":7,"n_samples":37,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"Bloomberg GPT (one-shot)","metrics":{"Accuracy (High)":"41.74","Accuracy (Middle)":"54.32"},"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":21,"model":"BLOOM 176B (one-shot)","metrics":{"Accuracy (High)":"39.14","Accuracy (Middle)":"52.3"},"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":22,"model":"OPT 66B (one-shot)","metrics":{"Accuracy (High)":"37.02","Accuracy (Middle)":"47.42"},"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":23,"model":"GPT-NeoX (one-shot)","metrics":{"Accuracy (High)":"34.33","Accuracy (Middle)":"41.23"},"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":24,"model":"GPT-3 175B (zero-shot)","metrics":{"Accuracy (High)":"45.5"},"uses_additional_data":false,"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":15,"n_unverified":50,"n_samples":65,"n_pointer_only_licence":4}}],"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":15,"rows_with_any_sample_ran":15,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":121,"n_unverified":173,"n_samples":294,"n_pointer_only_licence":52,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":286,"n_unverified":368,"n_samples":654,"n_pointer_only_licence":83,"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"}}}