{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/question-answering/papers/ran/13","list_of":"/task/question-answering","task":"Question Answering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":13,"pages_in_order":13,"rows_per_page":100,"rows":[1201,1274],"of":1274,"counts":{"archive_papers_tagged":10817,"with_a_code_link":4171,"where_syntology_ran_a_sample":1274,"not_listed_spam_title":0,"listed":10817,"listed_where_code_ran":1274,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1073,"every_run_a_failure_of_syntologys_instrument":201,"listed_with_a_run_with_no_instrument_failure":1073,"listed_every_run_a_failure_of_syntologys_instrument":201,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/question-answering/papers/ran/1","prev":"/task/question-answering/papers/ran/12","next":null,"papers":[{"url":"/paper/analysing-mathematical-reasoning-abilities-of-1","slug":"analysing-mathematical-reasoning-abilities-of-1","title":"Analysing Mathematical Reasoning Abilities of Neural Models","date":"2019-04-02","arxiv_id":"1904.01557","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/analysing-mathematical-reasoning-abilities-of-1#ran","syntology_url":"https://syntology.ai/paper/1904.01557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01557"}},"official":null}},{"url":"/paper/reducing-bert-pre-training-time-from-3-days","slug":"reducing-bert-pre-training-time-from-3-days","title":"Large Batch Optimization for Deep Learning: Training BERT in 76 minutes","date":"2019-04-01","arxiv_id":"1904.00962","repositories_listed":32,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/reducing-bert-pre-training-time-from-3-days#ran","syntology_url":"https://syntology.ai/paper/1904.00962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00962"}},"official":{"repos":["tensorflow/addons"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/relation-aware-graph-attention-network-for","slug":"relation-aware-graph-attention-network-for","title":"Relation-Aware Graph Attention Network for Visual Question Answering","date":"2019-03-29","arxiv_id":"1903.12314","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relation-aware-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1903.12314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12314"}},"official":{"repos":["linjieli222/VQA_ReGAT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/utilizing-bert-for-aspect-based-sentiment","slug":"utilizing-bert-for-aspect-based-sentiment","title":"Utilizing BERT for Aspect-Based Sentiment Analysis via Constructing Auxiliary Sentence","date":"2019-03-22","arxiv_id":"1903.09588","repositories_listed":8,"syntology":{"n":27,"n_ran":19,"n_constructed":0,"n_ran_checked":15,"n_instrument":4,"n_unverified":8,"n_honours":3,"n_violates":0,"n_no_contract":12,"n_pointer_only":9,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/utilizing-bert-for-aspect-based-sentiment#ran","syntology_url":"https://syntology.ai/paper/1903.09588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09588"}},"official":{"repos":["HSLCY/ABSA-BERT-pair"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bidirectional-attentive-memory-networks-for","slug":"bidirectional-attentive-memory-networks-for","title":"Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases","date":"2019-03-06","arxiv_id":"1903.02188","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidirectional-attentive-memory-networks-for#ran","syntology_url":"https://syntology.ai/paper/1903.02188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02188"}},"official":{"repos":["hugochan/BAMnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/dual-attention-networks-for-visual-reference","slug":"dual-attention-networks-for-visual-reference","title":"Dual Attention Networks for Visual Reference Resolution in Visual Dialog","date":"2019-02-25","arxiv_id":"1902.09368","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dual-attention-networks-for-visual-reference#ran","syntology_url":"https://syntology.ai/paper/1902.09368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09368"}},"official":{"repos":["gicheonkang/DAN-VisDial"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/end-to-end-open-domain-question-answering","slug":"end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","arxiv_id":"1902.01718","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-open-domain-question-answering#ran","syntology_url":"https://syntology.ai/paper/1902.01718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01718"}},"official":{"repos":["rsvp-ai/bertserini"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/block-bilinear-superdiagonal-fusion-for","slug":"block-bilinear-superdiagonal-fusion-for","title":"BLOCK: Bilinear Superdiagonal Fusion for Visual Question Answering and Visual Relationship Detection","date":"2019-01-31","arxiv_id":"1902.00038","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/block-bilinear-superdiagonal-fusion-for#ran","syntology_url":"https://syntology.ai/paper/1902.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00038"}},"official":{"repos":["Cadene/block.bootstrap.pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/biobert-a-pre-trained-biomedical-language","slug":"biobert-a-pre-trained-biomedical-language","title":"BioBERT: a pre-trained biomedical language representation model for biomedical text mining","date":"2019-01-25","arxiv_id":"1901.08746","repositories_listed":19,"syntology":{"n":25,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/biobert-a-pre-trained-biomedical-language#ran","syntology_url":"https://syntology.ai/paper/1901.08746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08746"}},"official":{"repos":["dmis-lab/biobert","naver/biobert-pretrained"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/a-bert-baseline-for-the-natural-questions","slug":"a-bert-baseline-for-the-natural-questions","title":"A BERT Baseline for the Natural Questions","date":"2019-01-24","arxiv_id":"1901.08634","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-bert-baseline-for-the-natural-questions#ran","syntology_url":"https://syntology.ai/paper/1901.08634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08634"}},"official":{"repos":["google-research/language"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/clevr-ref-diagnosing-visual-reasoning-with","slug":"clevr-ref-diagnosing-visual-reasoning-with","title":"CLEVR-Ref+: Diagnosing Visual Reasoning with Referring Expressions","date":"2019-01-03","arxiv_id":"1901.00850","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/clevr-ref-diagnosing-visual-reasoning-with#ran","syntology_url":"https://syntology.ai/paper/1901.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00850"}},"official":null}},{"url":"/paper/learning-representations-of-sets-through","slug":"learning-representations-of-sets-through","title":"Learning Representations of Sets through Optimized Permutations","date":"2018-12-10","arxiv_id":"1812.03928","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-representations-of-sets-through#ran","syntology_url":"https://syntology.ai/paper/1812.03928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03928"}},"official":{"repos":["Cyanogenoid/perm-optim","iclr2019-anon123456/perm-optim"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tf-ranking-scalable-tensorflow-library-for","slug":"tf-ranking-scalable-tensorflow-library-for","title":"TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank","date":"2018-11-30","arxiv_id":"1812.00073","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tf-ranking-scalable-tensorflow-library-for#ran","syntology_url":"https://syntology.ai/paper/1812.00073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00073"}},"official":{"repos":["tensorflow/ranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/blindfold-baselines-for-embodied-qa","slug":"blindfold-baselines-for-embodied-qa","title":"Blindfold Baselines for Embodied QA","date":"2018-11-12","arxiv_id":"1811.05013","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/blindfold-baselines-for-embodied-qa#ran","syntology_url":"https://syntology.ai/paper/1811.05013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05013"}},"official":{"repos":["ankeshanand/blindfold-baselines-eqa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/commonsenseqa-a-question-answering-challenge","slug":"commonsenseqa-a-question-answering-challenge","title":"CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledge","date":"2018-11-02","arxiv_id":"1811.00937","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/commonsenseqa-a-question-answering-challenge#ran","syntology_url":"https://syntology.ai/paper/1811.00937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00937"}},"official":{"repos":["jonathanherzig/commonsenseqa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-modular-control-for-embodied-question","slug":"neural-modular-control-for-embodied-question","title":"Neural Modular Control for Embodied Question Answering","date":"2018-10-26","arxiv_id":"1810.11181","repositories_listed":2,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neural-modular-control-for-embodied-question#ran","syntology_url":"https://syntology.ai/paper/1810.11181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11181"}},"official":null}},{"url":"/paper/bert-pre-training-of-deep-bidirectional","slug":"bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","arxiv_id":"1810.04805","repositories_listed":534,"syntology":{"n":659,"n_ran":300,"n_constructed":75,"n_ran_checked":235,"n_instrument":65,"n_unverified":359,"n_honours":17,"n_violates":4,"n_no_contract":214,"n_pointer_only":164,"phrase":"300 ran (of which 75 constructed an object rather than computing a result; 235 with no instrument failure: 17 honoured, 4 violated, 214 with no contract checked; 65 where Syntology's instrument failed) · 359 unverified","sample_list":"/paper/bert-pre-training-of-deep-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1810.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04805"}},"official":{"repos":["google-research/bert"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/neural-symbolic-vqa-disentangling-reasoning","slug":"neural-symbolic-vqa-disentangling-reasoning","title":"Neural-Symbolic VQA: Disentangling Reasoning from Vision and Language Understanding","date":"2018-10-04","arxiv_id":"1810.02338","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-symbolic-vqa-disentangling-reasoning#ran","syntology_url":"https://syntology.ai/paper/1810.02338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.02338"}},"official":null}},{"url":"/paper/hotpotqa-a-dataset-for-diverse-explainable","slug":"hotpotqa-a-dataset-for-diverse-explainable","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","date":"2018-09-25","arxiv_id":"1809.09600","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hotpotqa-a-dataset-for-diverse-explainable#ran","syntology_url":"https://syntology.ai/paper/1809.09600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.09600"}},"official":{"repos":["hotpotqa/hotpot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/commonsense-for-generative-multi-hop-question","slug":"commonsense-for-generative-multi-hop-question","title":"Commonsense for Generative Multi-Hop Question Answering Tasks","date":"2018-09-17","arxiv_id":"1809.06309","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/commonsense-for-generative-multi-hop-question#ran","syntology_url":"https://syntology.ai/paper/1809.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.06309"}},"official":{"repos":["yicheng-w/CommonSenseMultiHopQA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transforming-question-answering-datasets-into","slug":"transforming-question-answering-datasets-into","title":"Transforming Question Answering Datasets Into Natural Language Inference Datasets","date":"2018-09-09","arxiv_id":"1809.02922","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transforming-question-answering-datasets-into#ran","syntology_url":"https://syntology.ai/paper/1809.02922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02922"}},"official":null}},{"url":"/paper/can-a-suit-of-armor-conduct-electricity-a-new","slug":"can-a-suit-of-armor-conduct-electricity-a-new","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","date":"2018-09-08","arxiv_id":"1809.02789","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-a-suit-of-armor-conduct-electricity-a-new#ran","syntology_url":"https://syntology.ai/paper/1809.02789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02789"}},"official":{"repos":["allenai/arc-solvers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/open-domain-question-answering-using-early","slug":"open-domain-question-answering-using-early","title":"Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text","date":"2018-09-04","arxiv_id":"1809.00782","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/open-domain-question-answering-using-early#ran","syntology_url":"https://syntology.ai/paper/1809.00782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00782"}},"official":{"repos":["OceanskySun/GraftNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/coqa-a-conversational-question-answering","slug":"coqa-a-conversational-question-answering","title":"CoQA: A Conversational Question Answering Challenge","date":"2018-08-21","arxiv_id":"1808.07042","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/coqa-a-conversational-question-answering#ran","syntology_url":"https://syntology.ai/paper/1808.07042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.07042"}},"official":null}},{"url":"/paper/a-joint-sequence-fusion-model-for-video","slug":"a-joint-sequence-fusion-model-for-video","title":"A Joint Sequence Fusion Model for Video Question Answering and Retrieval","date":"2018-08-07","arxiv_id":"1808.02559","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-joint-sequence-fusion-model-for-video#ran","syntology_url":"https://syntology.ai/paper/1808.02559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.02559"}},"official":null}},{"url":"/paper/explainable-neural-computation-via-stack","slug":"explainable-neural-computation-via-stack","title":"Explainable Neural Computation via Stack Neural Module Networks","date":"2018-07-23","arxiv_id":"1807.08556","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/explainable-neural-computation-via-stack#ran","syntology_url":"https://syntology.ai/paper/1807.08556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.08556"}},"official":null}},{"url":"/paper/latent-alignment-and-variational-attention","slug":"latent-alignment-and-variational-attention","title":"Latent Alignment and Variational Attention","date":"2018-07-10","arxiv_id":"1807.03756","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-alignment-and-variational-attention#ran","syntology_url":"https://syntology.ai/paper/1807.03756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03756"}},"official":{"repos":["harvardnlp/var-attn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-audio-visual-scene-aware-dialog","slug":"end-to-end-audio-visual-scene-aware-dialog","title":"End-to-End Audio Visual Scene-Aware Dialog using Multimodal Attention-Based Video Features","date":"2018-06-21","arxiv_id":"1806.08409","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-audio-visual-scene-aware-dialog#ran","syntology_url":"https://syntology.ai/paper/1806.08409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08409"}},"official":null}},{"url":"/paper/the-natural-language-decathlon-multitask","slug":"the-natural-language-decathlon-multitask","title":"The Natural Language Decathlon: Multitask Learning as Question Answering","date":"2018-06-20","arxiv_id":"1806.08730","repositories_listed":6,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-natural-language-decathlon-multitask#ran","syntology_url":"https://syntology.ai/paper/1806.08730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08730"}},"official":{"repos":["salesforce/decaNLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-conditioned-graph-structures-for","slug":"learning-conditioned-graph-structures-for","title":"Learning Conditioned Graph Structures for Interpretable Visual Question Answering","date":"2018-06-19","arxiv_id":"1806.07243","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-conditioned-graph-structures-for#ran","syntology_url":"https://syntology.ai/paper/1806.07243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07243"}},"official":{"repos":["aimbrain/vqa-project"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-network-models-for-paraphrase","slug":"neural-network-models-for-paraphrase","title":"Neural Network Models for Paraphrase Identification, Semantic Textual Similarity, Natural Language Inference, and Question Answering","date":"2018-06-12","arxiv_id":"1806.04330","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-network-models-for-paraphrase#ran","syntology_url":"https://syntology.ai/paper/1806.04330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04330"}},"official":{"repos":["lanwuwei/SPM_toolkit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/did-the-model-understand-the-question","slug":"did-the-model-understand-the-question","title":"Did the Model Understand the Question?","date":"2018-05-14","arxiv_id":"1805.05492","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/did-the-model-understand-the-question#ran","syntology_url":"https://syntology.ai/paper/1805.05492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05492"}},"official":{"repos":["pramodkaushik/acl18_results"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/qanet-combining-local-convolution-with-global","slug":"qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","arxiv_id":"1804.09541","repositories_listed":15,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qanet-combining-local-convolution-with-global#ran","syntology_url":"https://syntology.ai/paper/1804.09541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09541"}},"official":null}},{"url":"/paper/unsupervised-natural-language-generation-with","slug":"unsupervised-natural-language-generation-with","title":"Unsupervised Natural Language Generation with Denoising Autoencoders","date":"2018-04-21","arxiv_id":"1804.07899","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-natural-language-generation-with#ran","syntology_url":"https://syntology.ai/paper/1804.07899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07899"}},"official":null}},{"url":"/paper/phrase-indexed-question-answering-a-new","slug":"phrase-indexed-question-answering-a-new","title":"Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension","date":"2018-04-20","arxiv_id":"1804.07726","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/phrase-indexed-question-answering-a-new#ran","syntology_url":"https://syntology.ai/paper/1804.07726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07726"}},"official":{"repos":["uwnlp/piqa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-semantic-textual-similarity-from","slug":"learning-semantic-textual-similarity-from","title":"Learning Semantic Textual Similarity from Conversations","date":"2018-04-20","arxiv_id":"1804.07754","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-semantic-textual-similarity-from#ran","syntology_url":"https://syntology.ai/paper/1804.07754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07754"}},"official":null}},{"url":"/paper/transparency-by-design-closing-the-gap","slug":"transparency-by-design-closing-the-gap","title":"Transparency by Design: Closing the Gap Between Performance and Interpretability in Visual Reasoning","date":"2018-03-14","arxiv_id":"1803.05268","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/transparency-by-design-closing-the-gap#ran","syntology_url":"https://syntology.ai/paper/1803.05268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05268"}},"official":{"repos":["davidmascharka/tbd-nets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","repositories_listed":46,"syntology":{"n":58,"n_ran":30,"n_constructed":12,"n_ran_checked":24,"n_instrument":6,"n_unverified":28,"n_honours":2,"n_violates":0,"n_no_contract":22,"n_pointer_only":25,"phrase":"30 ran (of which 12 constructed an object rather than computing a result; 24 with no instrument failure: 2 honoured, 0 violated, 22 with no contract checked; 6 where Syntology's instrument failed) · 28 unverified","sample_list":"/paper/deep-contextualized-word-representations#ran","syntology_url":"https://syntology.ai/paper/1802.05365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05365"}},"official":null}},{"url":"/paper/multimodal-explanations-justifying-decisions","slug":"multimodal-explanations-justifying-decisions","title":"Multimodal Explanations: Justifying Decisions and Pointing to the Evidence","date":"2018-02-15","arxiv_id":"1802.08129","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-explanations-justifying-decisions#ran","syntology_url":"https://syntology.ai/paper/1802.08129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.08129"}},"official":{"repos":["Seth-Park/MultimodalExplanations"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ai2-thor-an-interactive-3d-environment-for","slug":"ai2-thor-an-interactive-3d-environment-for","title":"AI2-THOR: An Interactive 3D Environment for Visual AI","date":"2017-12-14","arxiv_id":"1712.05474","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai2-thor-an-interactive-3d-environment-for#ran","syntology_url":"https://syntology.ai/paper/1712.05474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.05474"}},"official":{"repos":["allenai/ai2thor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evidence-aggregation-for-answer-re-ranking-in","slug":"evidence-aggregation-for-answer-re-ranking-in","title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering","date":"2017-11-14","arxiv_id":"1711.05116","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evidence-aggregation-for-answer-re-ranking-in#ran","syntology_url":"https://syntology.ai/paper/1711.05116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05116"}},"official":{"repos":["shuohangwang/mprc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/simple-and-effective-multi-paragraph-reading","slug":"simple-and-effective-multi-paragraph-reading","title":"Simple and Effective Multi-Paragraph Reading Comprehension","date":"2017-10-29","arxiv_id":"1710.10723","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/simple-and-effective-multi-paragraph-reading#ran","syntology_url":"https://syntology.ai/paper/1710.10723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10723"}},"official":{"repos":["allenai/document-qa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-recurrent-units-for-highly#ran","syntology_url":"https://syntology.ai/paper/1709.02755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.02755"}},"official":{"repos":["asappresearch/sru"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learned-in-translation-contextualized-word","slug":"learned-in-translation-contextualized-word","title":"Learned in Translation: Contextualized Word Vectors","date":"2017-08-01","arxiv_id":"1708.00107","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learned-in-translation-contextualized-word#ran","syntology_url":"https://syntology.ai/paper/1708.00107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00107"}},"official":{"repos":["salesforce/cove"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/quasar-datasets-for-question-answering-by","slug":"quasar-datasets-for-question-answering-by","title":"Quasar: Datasets for Question Answering by Search and Reading","date":"2017-07-12","arxiv_id":"1707.03904","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quasar-datasets-for-question-answering-by#ran","syntology_url":"https://syntology.ai/paper/1707.03904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.03904"}},"official":{"repos":["bdhingra/quasar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","repositories_listed":595,"syntology":{"n":946,"n_ran":610,"n_constructed":293,"n_ran_checked":529,"n_instrument":81,"n_unverified":336,"n_honours":45,"n_violates":15,"n_no_contract":469,"n_pointer_only":451,"phrase":"610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}},"official":{"repos":["tensorflow/tensor2tensor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/a-simple-neural-network-module-for-relational","slug":"a-simple-neural-network-module-for-relational","title":"A simple neural network module for relational reasoning","date":"2017-06-05","arxiv_id":"1706.01427","repositories_listed":20,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-simple-neural-network-module-for-relational#ran","syntology_url":"https://syntology.ai/paper/1706.01427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.01427"}},"official":null}},{"url":"/paper/irgan-a-minimax-game-for-unifying-generative","slug":"irgan-a-minimax-game-for-unifying-generative","title":"IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models","date":"2017-05-30","arxiv_id":"1705.10513","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/irgan-a-minimax-game-for-unifying-generative#ran","syntology_url":"https://syntology.ai/paper/1705.10513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.10513"}},"official":{"repos":["geek-ai/irgan"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reading-wikipedia-to-answer-open-domain","slug":"reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reading-wikipedia-to-answer-open-domain#ran","syntology_url":"https://syntology.ai/paper/1704.00051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.00051"}},"official":{"repos":["facebookresearch/DrQA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/making-neural-qa-as-simple-as-possible-but","slug":"making-neural-qa-as-simple-as-possible-but","title":"Making Neural QA as Simple as Possible but not Simpler","date":"2017-03-14","arxiv_id":"1703.04816","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/making-neural-qa-as-simple-as-possible-but#ran","syntology_url":"https://syntology.ai/paper/1703.04816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04816"}},"official":null}},{"url":"/paper/question-answering-through-transfer-learning","slug":"question-answering-through-transfer-learning","title":"Question Answering through Transfer Learning from Large Fine-grained Supervision Data","date":"2017-02-07","arxiv_id":"1702.02171","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/question-answering-through-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1702.02171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02171"}},"official":null}},{"url":"/paper/clevr-a-diagnostic-dataset-for-compositional","slug":"clevr-a-diagnostic-dataset-for-compositional","title":"CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoning","date":"2016-12-20","arxiv_id":"1612.06890","repositories_listed":5,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/clevr-a-diagnostic-dataset-for-compositional#ran","syntology_url":"https://syntology.ai/paper/1612.06890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.06890"}},"official":null}},{"url":"/paper/ms-marco-a-human-generated-machine-reading","slug":"ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","date":"2016-11-28","arxiv_id":"1611.09268","repositories_listed":14,"syntology":{"n":33,"n_ran":28,"n_constructed":0,"n_ran_checked":27,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":27,"n_pointer_only":0,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 27 with no instrument failure: 0 honoured, 0 violated, 27 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ms-marco-a-human-generated-machine-reading#ran","syntology_url":"https://syntology.ai/paper/1611.09268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09268"}},"official":null}},{"url":"/paper/a-dataset-and-exploration-of-models-for","slug":"a-dataset-and-exploration-of-models-for","title":"A dataset and exploration of models for understanding video data through fill-in-the-blank question-answering","date":"2016-11-23","arxiv_id":"1611.07810","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-dataset-and-exploration-of-models-for#ran","syntology_url":"https://syntology.ai/paper/1611.07810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07810"}},"official":null}},{"url":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","repositories_listed":27,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}},"official":{"repos":["allenai/bi-att-flow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/gated-end-to-end-memory-networks","slug":"gated-end-to-end-memory-networks","title":"Gated End-to-End Memory Networks","date":"2016-10-13","arxiv_id":"1610.04211","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/gated-end-to-end-memory-networks#ran","syntology_url":"https://syntology.ai/paper/1610.04211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.04211"}},"official":null}},{"url":"/paper/machine-comprehension-using-match-lstm-and","slug":"machine-comprehension-using-match-lstm-and","title":"Machine Comprehension Using Match-LSTM and Answer Pointer","date":"2016-08-29","arxiv_id":"1608.07905","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/machine-comprehension-using-match-lstm-and#ran","syntology_url":"https://syntology.ai/paper/1608.07905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.07905"}},"official":{"repos":["shuohangwang/SeqMatchSeq"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/analyzing-the-behavior-of-visual-question","slug":"analyzing-the-behavior-of-visual-question","title":"Analyzing the Behavior of Visual Question Answering Models","date":"2016-06-23","arxiv_id":"1606.07356","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/analyzing-the-behavior-of-visual-question#ran","syntology_url":"https://syntology.ai/paper/1606.07356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07356"}},"official":{"repos":["akirafukui/vqa-mcb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/squad-100000-questions-for-machine","slug":"squad-100000-questions-for-machine","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","date":"2016-06-16","arxiv_id":"1606.05250","repositories_listed":21,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/squad-100000-questions-for-machine#ran","syntology_url":"https://syntology.ai/paper/1606.05250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.05250"}},"official":{"repos":["worksheets.codalab.org/worksheets/0xd53d03a48ef64b329c16b9baf0f99b0c"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/query-reduction-networks-for-question","slug":"query-reduction-networks-for-question","title":"Query-Reduction Networks for Question Answering","date":"2016-06-14","arxiv_id":"1606.04582","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/query-reduction-networks-for-question#ran","syntology_url":"https://syntology.ai/paper/1606.04582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04582"}},"official":{"repos":["uwnlp/qrn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gated-attention-readers-for-text","slug":"gated-attention-readers-for-text","title":"Gated-Attention Readers for Text Comprehension","date":"2016-06-05","arxiv_id":"1606.01549","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gated-attention-readers-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01549"}},"official":{"repos":["bdhingra/ga-reader"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/end-to-end-instance-segmentation-with","slug":"end-to-end-instance-segmentation-with","title":"End-to-End Instance Segmentation with Recurrent Attention","date":"2016-05-30","arxiv_id":"1605.09410","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-instance-segmentation-with#ran","syntology_url":"https://syntology.ai/paper/1605.09410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09410"}},"official":null}},{"url":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}},"official":null}},{"url":"/paper/dynamic-memory-networks-for-visual-and","slug":"dynamic-memory-networks-for-visual-and","title":"Dynamic Memory Networks for Visual and Textual Question Answering","date":"2016-03-04","arxiv_id":"1603.01417","repositories_listed":10,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":0,"n_instrument":7,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-memory-networks-for-visual-and#ran","syntology_url":"https://syntology.ai/paper/1603.01417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01417"}},"official":null}},{"url":"/paper/text-understanding-with-the-attention-sum","slug":"text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","arxiv_id":"1603.01547","repositories_listed":2,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/text-understanding-with-the-attention-sum#ran","syntology_url":"https://syntology.ai/paper/1603.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01547"}},"official":{"repos":["rkadlec/asreader"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-compose-neural-networks-for","slug":"learning-to-compose-neural-networks-for","title":"Learning to Compose Neural Networks for Question Answering","date":"2016-01-07","arxiv_id":"1601.01705","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-compose-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1601.01705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.01705"}},"official":{"repos":["jacobandreas/nmn2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adding-gradient-noise-improves-learning-for","slug":"adding-gradient-noise-improves-learning-for","title":"Adding Gradient Noise Improves Learning for Very Deep Networks","date":"2015-11-21","arxiv_id":"1511.06807","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adding-gradient-noise-improves-learning-for#ran","syntology_url":"https://syntology.ai/paper/1511.06807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06807"}},"official":null}},{"url":"/paper/neural-variational-inference-for-text","slug":"neural-variational-inference-for-text","title":"Neural Variational Inference for Text Processing","date":"2015-11-19","arxiv_id":"1511.06038","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-variational-inference-for-text#ran","syntology_url":"https://syntology.ai/paper/1511.06038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06038"}},"official":null}},{"url":"/paper/ask-me-anything-dynamic-memory-networks-for","slug":"ask-me-anything-dynamic-memory-networks-for","title":"Ask Me Anything: Dynamic Memory Networks for Natural Language Processing","date":"2015-06-24","arxiv_id":"1506.07285","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ask-me-anything-dynamic-memory-networks-for#ran","syntology_url":"https://syntology.ai/paper/1506.07285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.07285"}},"official":null}},{"url":"/paper/exploring-models-and-data-for-image-question","slug":"exploring-models-and-data-for-image-question","title":"Exploring Models and Data for Image Question Answering","date":"2015-05-08","arxiv_id":"1505.02074","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-models-and-data-for-image-question#ran","syntology_url":"https://syntology.ai/paper/1505.02074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.02074"}},"official":{"repos":["renmengye/imageqa-public"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/end-to-end-memory-networks","slug":"end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","arxiv_id":"1503.08895","repositories_listed":44,"syntology":{"n":15,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/end-to-end-memory-networks#ran","syntology_url":"https://syntology.ai/paper/1503.08895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.08895"}},"official":{"repos":["facebook/MemNN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-ai-complete-question-answering-a-set","slug":"towards-ai-complete-question-answering-a-set","title":"Towards AI-Complete Question Answering: A Set of Prerequisite Toy Tasks","date":"2015-02-19","arxiv_id":"1502.05698","repositories_listed":20,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-ai-complete-question-answering-a-set#ran","syntology_url":"https://syntology.ai/paper/1502.05698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05698"}},"official":{"repos":["facebook/bAbI-tasks"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/distributed-representations-of-sentences-and","slug":"distributed-representations-of-sentences-and","title":"Distributed Representations of Sentences and Documents","date":"2014-05-16","arxiv_id":"1405.4053","repositories_listed":27,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distributed-representations-of-sentences-and#ran","syntology_url":"https://syntology.ai/paper/1405.4053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1405.4053"}},"official":null}}],"record_sha256":"0c3166ebdc105b70afc9491db2e79f78bf19df8e97d2a797c3cbdb33c7926b9f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}