{"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/text-infilling","name":"Text Infilling","slug":"text-infilling","description_markdown":"**Text Infilling** is the task of predicting missing spans of text which are consistent with the preceding and subsequent text. Text Infilling is a generalization of the cloze task—cloze historically refers to infilling individual words.\n\n\n<span class=\"description-source\">Source: [Enabling Language Models to Fill in the Blanks ](https://arxiv.org/abs/2005.05339)</span>","categories":[{"name":"Adversarial","url":"/area/adversarial"},{"name":"Computer Code","url":"/area/computer-code"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"},{"name":"Speech","url":"/area/speech"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":43,"papers_with_code":25,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/wiqa","name":"WIQA","full_name":"What-If Question Answering","num_papers_in_archive":21}],"subtasks":[],"parent_tasks":[{"url":"/task/text-generation","name":"Text Generation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":43,"of":43,"of_with_code":25,"tagged_in_all":43,"counts":{"archive_papers_tagged":43,"with_a_code_link":25,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":43,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"items":[{"url":"/paper/enabling-language-models-to-fill-in-the","slug":"enabling-language-models-to-fill-in-the","title":"Enabling Language Models to Fill in the Blanks","date":"2020-05-11","arxiv_id":"2005.05339","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/enabling-language-models-to-fill-in-the#ran","syntology_url":"https://syntology.ai/paper/2005.05339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05339"}},"official":{"repos":["chrisdonahue/ilm","worksheets.codalab.org/worksheets/0x9987b5d9cce74cf4b2a5f84b54ee447b"],"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/lot-a-benchmark-for-evaluating-chinese-long","slug":"lot-a-benchmark-for-evaluating-chinese-long","title":"LOT: A Story-Centric Benchmark for Evaluating Chinese Long Text Understanding and Generation","date":"2021-08-30","arxiv_id":"2108.12960","repositories_listed":2,"syntology":null},{"url":"/paper/nutribullets-hybrid-multi-document-health","slug":"nutribullets-hybrid-multi-document-health","title":"Nutribullets Hybrid: Multi-document Health Summarization","date":"2021-04-08","arxiv_id":"2104.03465","repositories_listed":2,"syntology":null},{"url":"/paper/the-devil-behind-the-mask-an-emergent-safety","slug":"the-devil-behind-the-mask-an-emergent-safety","title":"The Devil behind the mask: An emergent safety vulnerability of Diffusion LLMs","date":"2025-07-15","arxiv_id":"2507.11097","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":3,"n_instrument":13,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":15,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 13 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-devil-behind-the-mask-an-emergent-safety#ran","syntology_url":"https://syntology.ai/paper/2507.11097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.11097"}},"official":{"repos":["zichenwen1/dija"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lavida-a-large-diffusion-language-model-for","slug":"lavida-a-large-diffusion-language-model-for","title":"LaViDa: A Large Diffusion Language Model for Multimodal Understanding","date":"2025-05-22","arxiv_id":"2505.16839","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 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; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/lavida-a-large-diffusion-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2505.16839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16839"}},"official":{"repos":["jacklishufan/lavida"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/trajgpt-controlled-synthetic-trajectory","slug":"trajgpt-controlled-synthetic-trajectory","title":"TrajGPT: Controlled Synthetic Trajectory Generation Using a Multitask Transformer-Based Spatiotemporal Model","date":"2024-11-07","arxiv_id":"2411.04381","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trajgpt-controlled-synthetic-trajectory#ran","syntology_url":"https://syntology.ai/paper/2411.04381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.04381"}},"official":{"repos":["ktxlh/TrajGPT"],"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/empowering-character-level-text-infilling-by","slug":"empowering-character-level-text-infilling-by","title":"Empowering Character-level Text Infilling by Eliminating Sub-Tokens","date":"2024-05-27","arxiv_id":"2405.17103","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/empowering-character-level-text-infilling-by#ran","syntology_url":"https://syntology.ai/paper/2405.17103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17103"}},"official":{"repos":["sensellm/fim-se"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistically-sound-beam-search-with","slug":"probabilistically-sound-beam-search-with","title":"Towards Probabilistically-Sound Beam Search with Masked Language Models","date":"2024-02-22","arxiv_id":"2402.15020","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-yet-effective-framework-for-few-shot","slug":"a-simple-yet-effective-framework-for-few-shot","title":"A Simple yet Effective Framework for Few-Shot Aspect-Based Sentiment Analysis","date":"2023-07-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/having-beer-after-prayer-measuring-cultural","slug":"having-beer-after-prayer-measuring-cultural","title":"Having Beer after Prayer? Measuring Cultural Bias in Large Language Models","date":"2023-05-23","arxiv_id":"2305.14456","repositories_listed":1,"syntology":null},{"url":"/paper/magvlt-masked-generative-vision-and-language","slug":"magvlt-masked-generative-vision-and-language","title":"MAGVLT: Masked Generative Vision-and-Language Transformer","date":"2023-03-21","arxiv_id":"2303.12208","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":5,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 5 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) · 3 unverified","sample_list":"/paper/magvlt-masked-generative-vision-and-language#ran","syntology_url":"https://syntology.ai/paper/2303.12208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12208"}},"official":{"repos":["kakaobrain/magvlt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/model-tuning-via-prompts-makes-nlp-models","slug":"model-tuning-via-prompts-makes-nlp-models","title":"Model-tuning Via Prompts Makes NLP Models Adversarially Robust","date":"2023-03-13","arxiv_id":"2303.07320","repositories_listed":1,"syntology":null},{"url":"/paper/generative-prompt-tuning-for-relation-1","slug":"generative-prompt-tuning-for-relation-1","title":"Generative Prompt Tuning for Relation Classification","date":"2022-10-22","arxiv_id":"2210.12435","repositories_listed":1,"syntology":null},{"url":"/paper/metafill-text-infilling-for-meta-path","slug":"metafill-text-infilling-for-meta-path","title":"MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks","date":"2022-10-14","arxiv_id":"2210.07488","repositories_listed":1,"syntology":null},{"url":"/paper/reprogramming-large-pretrained-language","slug":"reprogramming-large-pretrained-language","title":"Reprogramming Pretrained Language Models for Antibody Sequence Infilling","date":"2022-10-05","arxiv_id":"2210.07144","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":4,"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 4 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/reprogramming-large-pretrained-language#ran","syntology_url":"https://syntology.ai/paper/2210.07144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07144"}},"official":{"repos":["ibm/reprogbert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/prompting-electra-few-shot-learning-with","slug":"prompting-electra-few-shot-learning-with","title":"Prompting ELECTRA: Few-Shot Learning with Discriminative Pre-Trained Models","date":"2022-05-30","arxiv_id":"2205.15223","repositories_listed":1,"syntology":null},{"url":"/paper/ctrleval-an-unsupervised-reference-free","slug":"ctrleval-an-unsupervised-reference-free","title":"CTRLEval: An Unsupervised Reference-Free Metric for Evaluating Controlled Text Generation","date":"2022-04-02","arxiv_id":"2204.00862","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/ctrleval-an-unsupervised-reference-free#ran","syntology_url":"https://syntology.ai/paper/2204.00862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00862"}},"official":{"repos":["thu-coai/ctrleval"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/language-modeling-via-stochastic-processes-1","slug":"language-modeling-via-stochastic-processes-1","title":"Language modeling via stochastic processes","date":"2022-03-21","arxiv_id":"2203.11370","repositories_listed":1,"syntology":null},{"url":"/paper/conformal-prediction-for-text-infilling-and","slug":"conformal-prediction-for-text-infilling-and","title":"Conformal prediction for text infilling and part-of-speech prediction","date":"2021-11-04","arxiv_id":"2111.02592","repositories_listed":1,"syntology":null},{"url":"/paper/show-me-how-to-revise-improving-lexically","slug":"show-me-how-to-revise-improving-lexically","title":"Show Me How To Revise: Improving Lexically Constrained Sentence Generation with XLNet","date":"2021-09-13","arxiv_id":"2109.05797","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/show-me-how-to-revise-improving-lexically#ran","syntology_url":"https://syntology.ai/paper/2109.05797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05797"}},"official":{"repos":["nlpcode/mcmcxlnet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/improving-sequence-to-sequence-pre-training","slug":"improving-sequence-to-sequence-pre-training","title":"Improving Sequence-to-Sequence Pre-training via Sequence Span Rewriting","date":"2021-01-02","arxiv_id":"2101.00416","repositories_listed":1,"syntology":null},{"url":"/paper/back-to-the-future-unsupervised-backprop","slug":"back-to-the-future-unsupervised-backprop","title":"Back to the Future: Unsupervised Backprop-based Decoding for Counterfactual and Abductive Commonsense Reasoning","date":"2020-10-12","arxiv_id":"2010.05906","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"5 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; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/back-to-the-future-unsupervised-backprop#ran","syntology_url":"https://syntology.ai/paper/2010.05906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05906"}},"official":{"repos":["qkaren/unsup_gen_for_cms_reasoning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/keep-calm-and-switch-on-preserving-sentiment","slug":"keep-calm-and-switch-on-preserving-sentiment","title":"Keep Calm and Switch On! Preserving Sentiment and Fluency in Semantic Text Exchange","date":"2019-08-30","arxiv_id":"1909.00088","repositories_listed":1,"syntology":null},{"url":"/paper/190510752","slug":"190510752","title":"TIGS: An Inference Algorithm for Text Infilling with Gradient Search","date":"2019-05-26","arxiv_id":"1905.10752","repositories_listed":1,"syntology":null},{"url":"/paper/text-infilling","slug":"text-infilling","title":"Text Infilling","date":"2019-01-01","arxiv_id":"1901.00158","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/text-infilling#ran","syntology_url":"https://syntology.ai/paper/1901.00158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00158"}},"official":{"repos":["VegB/Text_Infilling"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":null,"slug":"flexible-length-text-infilling-for-discrete","title":"Flexible-length Text Infilling for Discrete Diffusion Models","date":"2025-06-16","arxiv_id":"2506.13579","repositories_listed":0,"syntology":null},{"url":null,"slug":"insertion-language-models-sequence-generation","title":"Insertion Language Models: Sequence Generation with Arbitrary-Position Insertions","date":"2025-05-09","arxiv_id":"2505.05755","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-spoken-discourse-modeling-in","title":"Enhancing Spoken Discourse Modeling in Language Models Using Gestural Cues","date":"2025-03-05","arxiv_id":"2503.03474","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-benchmark-for-text-expansion-datasets","title":"A Benchmark for Text Expansion: Datasets, Metrics, and Baselines","date":"2023-09-17","arxiv_id":"2309.09198","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-to-sequence-pre-training-with","title":"Sequence-to-Sequence Pre-training with Unified Modality Masking for Visual Document Understanding","date":"2023-05-16","arxiv_id":"2305.10448","repositories_listed":0,"syntology":null},{"url":null,"slug":"don-t-prompt-search-mining-based-zero-shot","title":"Don't Prompt, Search! Mining-based Zero-Shot Learning with Language Models","date":"2022-10-26","arxiv_id":"2210.14803","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tip-attribute-aware-text-infilling-via-pre","title":"A-TIP: Attribute-aware Text Infilling via Pre-trained Language Model","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coordination-generation-via-synchronized-text","title":"Coordination Generation via Synchronized Text-Infilling","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"building-a-knowledge-based-dialogue-system","title":"Building a Knowledge-Based Dialogue System with Text Infilling","date":"2022-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-role-of-bidirectionality-in-language","title":"On the Role of Bidirectionality in Language Model Pre-Training","date":"2022-05-24","arxiv_id":"2205.11726","repositories_listed":0,"syntology":null},{"url":null,"slug":"bitiimt-a-bilingual-text-infilling-method-for","title":"BiTIIMT: A Bilingual Text-infilling Method for Interactive Machine Translation","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-scalar-diversity-with-context","title":"Predicting scalar diversity with context-driven uncertainty over alternatives","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-prompt-tuning-for-relation","title":"Generative Prompt Tuning for Relation Classification","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nutri-bullets-hybrid-consensual-multi","title":"Nutri-bullets Hybrid: Consensual Multi-document Summarization","date":"2021-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"infillmore-neural-frame-lexicalization-for","title":"InFillmore: Frame-Guided Language Generation with Bidirectional Context","date":"2021-03-08","arxiv_id":"2103.04941","repositories_listed":0,"syntology":null},{"url":null,"slug":"reflective-decoding-unsupervised-paraphrasing-1","title":"Reflective Decoding: Beyond Unidirectional Generation with Off-the-Shelf Language Models","date":"2020-10-16","arxiv_id":"2010.08566","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoding-as-dynamic-programming-for-recurrent","title":"Decoding As Dynamic Programming For Recurrent Autoregressive Models","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mask-and-infill-applying-masked-language","title":"\"Mask and Infill\" : Applying Masked Language Model to Sentiment Transfer","date":"2019-08-21","arxiv_id":"1908.08039","repositories_listed":0,"syntology":null}],"syntology_records":11,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/task/text-infilling/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/text-infilling/papers/ran/1","json":"/task/text-infilling/papers/ran/1.json","rows":9}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c539a5e9eb2c544bd50847dbc6ced9e1da71c92c907b97384a143317e98ac89a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}