{"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/slot-filling/papers/ran/1","list_of":"/task/slot-filling","task":"Slot Filling","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,18],"of":18,"counts":{"archive_papers_tagged":458,"with_a_code_link":140,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":458,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/slot-filling/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/middle-layer-representation-alignment-for","slug":"middle-layer-representation-alignment-for","title":"Middle-Layer Representation Alignment for Cross-Lingual Transfer in Fine-Tuned LLMs","date":"2025-02-20","arxiv_id":"2502.14830","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/middle-layer-representation-alignment-for#ran","syntology_url":"https://syntology.ai/paper/2502.14830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14830"}},"official":{"repos":["dannigt/mid-align"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-information-refinement-training","slug":"unsupervised-information-refinement-training","title":"Unsupervised Information Refinement Training of Large Language Models for Retrieval-Augmented Generation","date":"2024-02-28","arxiv_id":"2402.18150","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-information-refinement-training#ran","syntology_url":"https://syntology.ai/paper/2402.18150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18150"}},"official":{"repos":["xsc1234/info-rag"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/api-blend-a-comprehensive-corpora-for","slug":"api-blend-a-comprehensive-corpora-for","title":"API-BLEND: A Comprehensive Corpora for Training and Benchmarking API LLMs","date":"2024-02-23","arxiv_id":"2402.15491","repositories_listed":1,"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/api-blend-a-comprehensive-corpora-for#ran","syntology_url":"https://syntology.ai/paper/2402.15491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15491"}},"official":{"repos":["ibm/api-blend"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-sequence-transduction-by-jointly","slug":"efficient-sequence-transduction-by-jointly","title":"Efficient Sequence Transduction by Jointly Predicting Tokens and Durations","date":"2023-04-13","arxiv_id":"2304.06795","repositories_listed":4,"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/efficient-sequence-transduction-by-jointly#ran","syntology_url":"https://syntology.ai/paper/2304.06795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06795"}},"official":{"repos":["NVIDIA/NeMo"],"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/re2g-retrieve-rerank-generate-2","slug":"re2g-retrieve-rerank-generate-2","title":"Re2G: Retrieve, Rerank, Generate","date":"2022-07-13","arxiv_id":"2207.06300","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/re2g-retrieve-rerank-generate-2#ran","syntology_url":"https://syntology.ai/paper/2207.06300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06300"}},"official":{"repos":["ibm/kgi-slot-filling"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/massive-a-1m-example-multilingual-natural","slug":"massive-a-1m-example-multilingual-natural","title":"MASSIVE: A 1M-Example Multilingual Natural Language Understanding Dataset with 51 Typologically-Diverse Languages","date":"2022-04-18","arxiv_id":"2204.08582","repositories_listed":6,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/massive-a-1m-example-multilingual-natural#ran","syntology_url":"https://syntology.ai/paper/2204.08582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08582"}},"official":{"repos":["alexa/massive"],"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/phrase-retrieval-learns-passage-retrieval-too","slug":"phrase-retrieval-learns-passage-retrieval-too","title":"Phrase Retrieval Learns Passage Retrieval, Too","date":"2021-09-16","arxiv_id":"2109.08133","repositories_listed":1,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":8,"n_honours":2,"n_violates":1,"n_no_contract":3,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/phrase-retrieval-learns-passage-retrieval-too#ran","syntology_url":"https://syntology.ai/paper/2109.08133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08133"}},"official":{"repos":["princeton-nlp/DensePhrases"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-retrieval-augmented-generation-for","slug":"robust-retrieval-augmented-generation-for","title":"Robust Retrieval Augmented Generation for Zero-shot Slot Filling","date":"2021-08-31","arxiv_id":"2108.13934","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-retrieval-augmented-generation-for#ran","syntology_url":"https://syntology.ai/paper/2108.13934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13934"}},"official":{"repos":["ibm/kgi-slot-filling"],"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/sead-end-to-end-text-to-sql-generation-with","slug":"sead-end-to-end-text-to-sql-generation-with","title":"SeaD: End-to-end Text-to-SQL Generation with Schema-aware Denoising","date":"2021-05-17","arxiv_id":"2105.07911","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/sead-end-to-end-text-to-sql-generation-with#ran","syntology_url":"https://syntology.ai/paper/2105.07911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.07911"}},"official":{"repos":["salesforce/WikiSQL"],"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/multilingual-code-switching-for-zero-shot","slug":"multilingual-code-switching-for-zero-shot","title":"Multilingual Code-Switching for Zero-Shot Cross-Lingual Intent Prediction and Slot Filling","date":"2021-03-13","arxiv_id":"2103.07792","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multilingual-code-switching-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2103.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07792"}},"official":{"repos":["jitinkrishnan/Multilingual-ZeroShot-SlotFilling"],"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/neural-data-augmentation-via-example","slug":"neural-data-augmentation-via-example","title":"Neural Data Augmentation via Example Extrapolation","date":"2021-02-02","arxiv_id":"2102.01335","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/neural-data-augmentation-via-example#ran","syntology_url":"https://syntology.ai/paper/2102.01335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.01335"}},"official":{"repos":["google/example_extrapolation"],"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/kilt-a-benchmark-for-knowledge-intensive","slug":"kilt-a-benchmark-for-knowledge-intensive","title":"KILT: a Benchmark for Knowledge Intensive Language Tasks","date":"2020-09-04","arxiv_id":"2009.02252","repositories_listed":3,"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/kilt-a-benchmark-for-knowledge-intensive#ran","syntology_url":"https://syntology.ai/paper/2009.02252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02252"}},"official":{"repos":["facebookresearch/KILT"],"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/coach-a-coarse-to-fine-approach-for-cross","slug":"coach-a-coarse-to-fine-approach-for-cross","title":"Coach: A Coarse-to-Fine Approach for Cross-domain Slot Filling","date":"2020-04-24","arxiv_id":"2004.11727","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/coach-a-coarse-to-fine-approach-for-cross#ran","syntology_url":"https://syntology.ai/paper/2004.11727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11727"}},"official":{"repos":["zliucr/coach"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ryansql-recursively-applying-sketch-based","slug":"ryansql-recursively-applying-sketch-based","title":"RYANSQL: Recursively Applying Sketch-based Slot Fillings for Complex Text-to-SQL in Cross-Domain Databases","date":"2020-04-07","arxiv_id":"2004.03125","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/ryansql-recursively-applying-sketch-based#ran","syntology_url":"https://syntology.ai/paper/2004.03125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03125"}},"official":{"repos":["kakaoenterprise/RYANSQL"],"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/bert-for-joint-intent-classification-and-slot","slug":"bert-for-joint-intent-classification-and-slot","title":"BERT for Joint Intent Classification and Slot Filling","date":"2019-02-28","arxiv_id":"1902.10909","repositories_listed":16,"syntology":{"n":32,"n_ran":26,"n_constructed":0,"n_ran_checked":19,"n_instrument":7,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":18,"n_pointer_only":5,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 7 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bert-for-joint-intent-classification-and-slot#ran","syntology_url":"https://syntology.ai/paper/1902.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10909"}},"official":null}},{"url":"/paper/neural-baby-talk","slug":"neural-baby-talk","title":"Neural Baby Talk","date":"2018-03-27","arxiv_id":"1803.09845","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-baby-talk#ran","syntology_url":"https://syntology.ai/paper/1803.09845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09845"}},"official":{"repos":["jiasenlu/NeuralBabyTalk"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-based-recurrent-neural-network","slug":"attention-based-recurrent-neural-network","title":"Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Filling","date":"2016-09-06","arxiv_id":"1609.01454","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1609.01454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.01454"}},"official":null}},{"url":"/paper/data-programming-creating-large-training-sets","slug":"data-programming-creating-large-training-sets","title":"Data Programming: Creating Large Training Sets, Quickly","date":"2016-05-25","arxiv_id":"1605.07723","repositories_listed":4,"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/data-programming-creating-large-training-sets#ran","syntology_url":"https://syntology.ai/paper/1605.07723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.07723"}},"official":null}}],"record_sha256":"8a614178d5c2186be8d18c49d8c951ed6c02444b8ec18ac3df27fe9dcd44cf3f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}