{"url":"/dataset/duorc","name":"DuoRC","full_name":"DuoRC","description_markdown":"DuoRC contains 186,089 unique question-answer pairs created from a collection of 7680 pairs of movie plots where each pair in the collection reflects two versions of the same movie.\r\n\r\n**Why another RC dataset?**\r\n\r\nDuoRC pushes the NLP community to address challenges on incorporating knowledge and reasoning in neural architectures for reading comprehension. It poses several interesting challenges such as:\r\n\r\n- DuoRC using parallel plots is especially designed to contain a large number of questions with low lexical overlap between questions and their corresponding passages\r\n- It requires models to go beyond the content of the given passage itself and incorporate world-knowledge, background knowledge, and common-sense knowledge to arrive at the answer\r\n- It revolves around narrative passages from movie plots describing complex events and therefore naturally require complex reasoning (e.g. temporal reasoning, entailment, long-distance anaphoras, etc.) across multiple sentences to infer the answer to questions\r\n- Several of the questions in DuoRC, while seeming relevant, cannot actually be answered from the given passage. This requires the model to detect the unanswerability of questions. This aspect is important for machines to achieve in industrial settings in particular\r\n\r\nSource: [DuoRC](https://duorc.github.io/)","description_withheld":null,"homepage":"https://duorc.github.io/","introduced_date":"2018-04-21","introduced_date_note":null,"introduced_by":{"paper":"/paper/duorc-towards-complex-language-understanding","title":"DuoRC: Towards Complex Language Understanding with Paraphrased Reading Comprehension","first_author":"Amrita Saha","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Reading Comprehension","url":"/task/reading-comprehension","datasets_with_task":"/datasets/task/reading-comprehension"},{"name":"Machine Reading Comprehension","url":"/task/machine-reading-comprehension","datasets_with_task":"/datasets/task/machine-reading-comprehension"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["DuoRC"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/asoria/duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/polinaeterna/duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/KETI-AIR/duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/KETI-AIR/kor_duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/ibm/duorc","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/ibm-research/duorc","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":42,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-duorc","task":"Question Answering","dataset_variant":"DuoRC","rows":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Vector Database (ChromaDB)","paper":"/paper/recallm-an-architecture-for-temporal-context","metrics":{"Accuracy":"55.71"},"code_links":[{"title":"cisco-open/DeepVision","url":"https://github.com/cisco-open/DeepVision/tree/main/recallm"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/recallm-an-architecture-for-temporal-context","title":"RecallM: An Adaptable Memory Mechanism with Temporal Understanding for Large Language Models","date":"2023-07-06","rows_on_this_dataset":3,"code_links":1,"syntology":null}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}