{"url":"/sota/question-answering-on-quora-question-pairs","task":{"name":"Question Answering","url":"/task/question-answering","note":null},"dataset":{"name":"Quora Question Pairs","url":"/dataset/quora-question-pairs"},"category":"Natural Language Processing","categories":["Miscellaneous","Natural Language Processing","Reasoning"],"category_note":null,"description":"Question answering can be segmented into domain-specific tasks like community question answering and knowledge-base question answering. Popular benchmark datasets for evaluation question answering systems include [SQuAD](/dataset/squad), [HotPotQA](/dataset/hotpotqa), [bAbI](/dataset/babi-1), [TriviaQA](/dataset/triviaqa), [WikiQA](/dataset/wikiqa), and many others. Models for question answering are typically evaluated on metrics like EM and F1. Some recent top performing models are T5 and XLNet.\r\n\r\n( Image credit: [SQuAD](https://rajpurkar.github.io/mlx/qa-and-squad/) )","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":19,"rows_with_code":18,"rows_with_paper_page":19,"rows_dated":19,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"XLNet (single model)","metrics":{"Accuracy":"92.3%"},"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":2,"model":"DeBERTa (large)","metrics":{"Accuracy":"92.3%"},"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":"ALBERT","metrics":{"Accuracy":"90.5%"},"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":4,"model":"T5-11B","metrics":{"Accuracy":"90.4%"},"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":5,"model":"MLM+ subs+ del-span","metrics":{"Accuracy":"90.3%"},"uses_additional_data":false,"paper_date":"2020-12-31","paper":"/paper/clear-contrastive-learning-for-sentence","paper_url":"https://arxiv.org/abs/2012.15466v1","paper_title":"CLEAR: Contrastive Learning for Sentence Representation","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"RoBERTa (ensemble)","metrics":{"Accuracy":"90.2%"},"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":7,"model":"ERNIE 2.0 Large","metrics":{"Accuracy":"90.1%"},"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":8,"model":"ELECTRA","metrics":{"Accuracy":"90.1%"},"uses_additional_data":false,"paper_date":"2020-03-23","paper":"/paper/electra-pre-training-text-encoders-as-1","paper_url":"https://arxiv.org/abs/2003.10555v1","paper_title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","code":"https://github.com/huggingface/transformers","n_code_links":19,"syntology":{"n_ran":26,"n_unverified":14,"n_samples":40,"n_pointer_only_licence":10}},{"rank_in_archive_order":9,"model":"T5-Large 770M","metrics":{"Accuracy":"89.9%"},"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":10,"model":"ERNIE 2.0 Base","metrics":{"Accuracy":"89.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":11,"model":"T5-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":12,"model":"T5-Base","metrics":{"Accuracy":"89.4%"},"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":"RE2","metrics":{"Accuracy":"89.2 %"},"uses_additional_data":false,"paper_date":"2019-08-01","paper":"/paper/simple-and-effective-text-matching-with-1","paper_url":"https://arxiv.org/abs/1908.00300v1","paper_title":"Simple and Effective Text Matching with Richer Alignment Features","code":"https://github.com/alibaba-edu/simple-effective-text-matching","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"DistilBERT 66M","metrics":{"Accuracy":"89.2%"},"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}},{"rank_in_archive_order":15,"model":"BigBird","metrics":{"Accuracy":"88.6%"},"uses_additional_data":false,"paper_date":"2020-07-28","paper":"/paper/big-bird-transformers-for-longer-sequences","paper_url":"https://arxiv.org/abs/2007.14062v2","paper_title":"Big Bird: Transformers for Longer Sequences","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":{"n_ran":10,"n_unverified":5,"n_samples":15,"n_pointer_only_licence":11}},{"rank_in_archive_order":16,"model":"T5-Small","metrics":{"Accuracy":"88.0%"},"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":17,"model":"SWEM-concat","metrics":{"Accuracy":"83.03%"},"uses_additional_data":false,"paper_date":"2018-05-24","paper":"/paper/baseline-needs-more-love-on-simple-word","paper_url":"http://arxiv.org/abs/1805.09843v1","paper_title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","code":"https://github.com/dinghanshen/SWEM","n_code_links":2,"syntology":null},{"rank_in_archive_order":18,"model":"SqueezeBERT","metrics":{"Accuracy":"80.3%"},"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":19,"model":"24hBERT","metrics":{"Accuracy":"70.7"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/how-to-train-bert-with-an-academic-budget","paper_url":"https://arxiv.org/abs/2104.07705v2","paper_title":"How to Train BERT with an Academic Budget","code":"https://github.com/peteriz/academic-budget-bert","n_code_links":4,"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,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":16,"rows_with_any_sample_ran":13,"distinct_papers_with_graph_line":11,"distinct_papers_with_any_sample_ran":9,"samples_over_distinct_papers":{"n_ran":140,"n_unverified":187,"n_samples":327,"n_pointer_only_licence":73,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":148,"n_unverified":304,"n_samples":452,"n_pointer_only_licence":74,"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"}}}