{"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":"/dataset/sst","name":"SST","full_name":"Stanford Sentiment Treebank","description_markdown":"The **Stanford Sentiment Treebank** is a corpus with fully labeled parse trees that allows for a\r\ncomplete analysis of the compositional effects of\r\nsentiment in language. The corpus is based on\r\nthe dataset introduced by Pang and Lee (2005) and\r\nconsists of 11,855 single sentences extracted from\r\nmovie reviews. It was parsed with the Stanford\r\nparser and includes a total of 215,154 unique phrases\r\nfrom those parse trees, each annotated by 3 human judges.\r\n\r\nEach phrase is labelled as either *negative*, *somewhat negative*, *neutral*, *somewhat positive* or *positive*.\r\nThe corpus with all 5 labels is referred to as SST-5 or SST fine-grained. Binary classification experiments on full sentences (*negative* or *somewhat negative* vs *somewhat positive* or *positive* with *neutral* sentences discarded) refer to the dataset as SST-2 or SST binary.","description_withheld":null,"homepage":"https://nlp.stanford.edu/sentiment","introduced_date":"2013-10-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/recursive-deep-models-for-semantic","title":"Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank","first_author":"Richard Socher","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Classification","url":"/task/classification-1","datasets_with_task":"/datasets/task/classification-1"},{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","datasets_with_task":"/datasets/task/sentiment-analysis"},{"name":"Few-Shot Learning","url":"/task/few-shot-learning","datasets_with_task":"/datasets/task/few-shot-learning"},{"name":"Out-of-Distribution Detection","url":"/task/out-of-distribution-detection","datasets_with_task":"/datasets/task/out-of-distribution-detection"},{"name":"Few-Shot Text Classification","url":"/task/few-shot-text-classification","datasets_with_task":"/datasets/task/few-shot-text-classification"},{"name":"Explanation Fidelity Evaluation","url":"/task/explanation-fidelity-evaluation","datasets_with_task":"/datasets/task/explanation-fidelity-evaluation"},{"name":"Chinese Sentiment Analysis","url":"/task/chinese-sentiment-analysis","datasets_with_task":"/datasets/task/chinese-sentiment-analysis"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["SST-2","SST-2 Binary classification Dev","SST-5","sst2-es-mt","SST2","SST-2 Binary classification","SST-5 Fine-grained classification","SST"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/stanfordnlp/sst","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/sst","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/sst2","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/stanfordnlp/sst2","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#stanford-sentiment-treebank-dataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/facebookresearch/ParlAI","url":"https://parl.ai/docs/tasks.html#sst-sentiment-analysis","frameworks":["pytorch"]},{"repo":"https://github.com/allenai/allennlp-models","url":"https://docs.allennlp.org/models/main/models/classification/dataset_readers/stanford_sentiment_tree_bank/","frameworks":["pytorch"]}],"num_papers_in_archive":2354,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/sentiment-analysis-on-sst-2-binary","task":"Sentiment Analysis","dataset_variant":"SST-2 Binary classification","rows":87,"metrics":["Accuracy","Dev Accuracy","Attack Success Rate"],"first_row_in_archive_order":{"model":"T5-11B","paper":"/paper/exploring-the-limits-of-transfer-learning","metrics":{"Accuracy":"97.5"},"code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"PaddlePaddle/PaddleNLP","url":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/language_model/t5"},{"title":"google-research/text-to-text-transfer-transformer","url":"https://github.com/google-research/text-to-text-transfer-transformer"},{"title":"amazon-science/chronos-forecasting","url":"https://github.com/amazon-science/chronos-forecasting"},{"title":"google-research/t5x","url":"https://github.com/google-research/t5x"},{"title":"allenai/dolma","url":"https://github.com/allenai/dolma"},{"title":"thudm/swissarmytransformer","url":"https://github.com/thudm/swissarmytransformer"},{"title":"Ki6an/fastT5","url":"https://github.com/Ki6an/fastT5"},{"title":"google/seqio","url":"https://github.com/google/seqio"},{"title":"facebookresearch/atlas","url":"https://github.com/facebookresearch/atlas"},{"title":"conceptofmind/LaMDA-pytorch","url":"https://github.com/conceptofmind/LaMDA-pytorch"},{"title":"conceptofmind/lamda-rlhf-pytorch","url":"https://github.com/conceptofmind/lamda-rlhf-pytorch"},{"title":"thu-keg/omnievent","url":"https://github.com/thu-keg/omnievent"},{"title":"asahi417/lm-question-generation","url":"https://github.com/asahi417/lm-question-generation"},{"title":"abelriboulot/onnxt5","url":"https://github.com/abelriboulot/onnxt5"},{"title":"volcengine/vegiantmodel","url":"https://github.com/volcengine/vegiantmodel"},{"title":"airc-keti/ke-t5","url":"https://github.com/airc-keti/ke-t5"},{"title":"yizhongw/tk-instruct","url":"https://github.com/yizhongw/tk-instruct"},{"title":"asahi417/lmppl","url":"https://github.com/asahi417/lmppl"},{"title":"gulucaptain/dynamictrl","url":"https://github.com/gulucaptain/dynamictrl"},{"title":"google-research/t5x_retrieval","url":"https://github.com/google-research/t5x_retrieval"},{"title":"bigscience-workshop/architecture-objective","url":"https://github.com/bigscience-workshop/architecture-objective"},{"title":"dawn0815/UniSA","url":"https://github.com/dawn0815/UniSA"},{"title":"ibm/graph_ensemble_learning","url":"https://github.com/ibm/graph_ensemble_learning"},{"title":"wangcongcong123/ttt","url":"https://github.com/wangcongcong123/ttt"},{"title":"safakkbilici/Academic-Paper-Title-Recommendation","url":"https://github.com/safakkbilici/Academic-Paper-Title-Recommendation"},{"title":"bayer-science-for-a-better-life/data2text-bioleaflets","url":"https://github.com/bayer-science-for-a-better-life/data2text-bioleaflets"},{"title":"allenai/c4-documentation","url":"https://github.com/allenai/c4-documentation"},{"title":"um-arm-lab/efficient-eng-2-ltl","url":"https://github.com/um-arm-lab/efficient-eng-2-ltl"},{"title":"lesterpjy/numeric-t5","url":"https://github.com/lesterpjy/numeric-t5"},{"title":"zhiqic/chartreader","url":"https://github.com/zhiqic/chartreader"},{"title":"LeoLaugier/conditional-auto-encoder-text-to-text-transfer-transformer","url":"https://github.com/LeoLaugier/conditional-auto-encoder-text-to-text-transfer-transformer"},{"title":"s-nlp/russe_detox_2022","url":"https://github.com/s-nlp/russe_detox_2022"},{"title":"skoltech-nlp/russe_detox_2022","url":"https://github.com/skoltech-nlp/russe_detox_2022"},{"title":"jongwooko/nash-pruning-official","url":"https://github.com/jongwooko/nash-pruning-official"},{"title":"xiuyu0000/new_papers_codes","url":"https://github.com/xiuyu0000/new_papers_codes/tree/main/t5"},{"title":"luomancs/retriever_reader_for_okvqa","url":"https://github.com/luomancs/retriever_reader_for_okvqa"},{"title":"qipengguo/p2_webnlg2020","url":"https://github.com/qipengguo/p2_webnlg2020"},{"title":"JunnYu/x-transformers-paddle","url":"https://github.com/JunnYu/x-transformers-paddle"},{"title":"Sharif-SLPL/t5-fa","url":"https://github.com/Sharif-SLPL/t5-fa"},{"title":"shivamraval98/multitask-t5_ae","url":"https://github.com/shivamraval98/multitask-t5_ae"},{"title":"junnyu/paddle_t5","url":"https://github.com/junnyu/paddle_t5"},{"title":"ChernovAndrey/chronos-forecasting-wasserstein","url":"https://github.com/ChernovAndrey/chronos-forecasting-wasserstein"},{"title":"cccntu/ft5-demo","url":"https://github.com/cccntu/ft5-demo"},{"title":"ArvinZhuang/BiTAG","url":"https://github.com/ArvinZhuang/BiTAG"},{"title":"MS-P3/code5","url":"https://github.com/MS-P3/code5/tree/main/t5"},{"title":"cccntu/ft5-demo-space","url":"https://github.com/cccntu/ft5-demo-space"},{"title":"xuetianci/pacit","url":"https://github.com/xuetianci/pacit"},{"title":"vgaraujov/seq2seq-spanish-plms","url":"https://github.com/vgaraujov/seq2seq-spanish-plms"},{"title":"yli-z/ml4h_are_clinical_t5_models_better_for_clinical_text","url":"https://github.com/yli-z/ml4h_are_clinical_t5_models_better_for_clinical_text"},{"title":"thecodemasterk/Text-to-Text-transfer-transformers","url":"https://github.com/thecodemasterk/Text-to-Text-transfer-transformers"},{"title":"2023-MindSpore-4/Code12","url":"https://github.com/2023-MindSpore-4/Code12/tree/main/MindFormers/t5"},{"title":"KAGUYAHONGLAI/SRC","url":"https://github.com/KAGUYAHONGLAI/SRC"},{"title":"Nimesh-Patel/text-to-text-transfer-transformer","url":"https://github.com/Nimesh-Patel/text-to-text-transfer-transformer"},{"title":"souvikshanku/translit-former","url":"https://github.com/souvikshanku/translit-former"},{"title":"itzprashu1/prashant","url":"https://github.com/itzprashu1/prashant"},{"title":"2023-MindSpore-1/ms-code-164","url":"https://github.com/2023-MindSpore-1/ms-code-164"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/sentiment-analysis-on-sst-5-fine-grained","task":"Sentiment Analysis","dataset_variant":"SST-5 Fine-grained classification","rows":31,"metrics":["Accuracy","Accuracy "],"first_row_in_archive_order":{"model":"Llama-3.3-70B + CAPO","paper":"/paper/capo-cost-aware-prompt-optimization","metrics":{"Accuracy":"62.27"},"code_links":[{"title":"finitearth/promptolution","url":"https://github.com/finitearth/promptolution"},{"title":"finitearth/capo","url":"https://github.com/finitearth/capo"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/explanation-fidelity-evaluation-on-sst2","task":"Explanation Fidelity Evaluation","dataset_variant":"SST2","rows":1,"metrics":["fidelity"],"first_row_in_archive_order":{"model":"GCN","paper":"/paper/same-uncovering-gnn-black-box-with-structure","metrics":{"fidelity":"0.373"},"code_links":[{"title":"same2023neurips/same","url":"https://github.com/same2023neurips/same"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/few-shot-learning-on-sst-2-binary","task":"Few-Shot Learning","dataset_variant":"SST-2 Binary classification","rows":1,"metrics":["Acc"],"first_row_in_archive_order":{"model":"DART","paper":"/paper/differentiable-prompt-makes-pre-trained","metrics":{"Acc":"93.5(0.5)"},"code_links":[{"title":"zjunlp/DART","url":"https://github.com/zjunlp/DART"},{"title":"zhengxiangshi/powerfulpromptft","url":"https://github.com/zhengxiangshi/powerfulpromptft"},{"title":"paperspapers/badprompt","url":"https://github.com/paperspapers/badprompt"},{"title":"zhaohan-xi/plm-prompt-defense","url":"https://github.com/zhaohan-xi/plm-prompt-defense"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/out-of-distribution-detection-on-sst","task":"Out-of-Distribution Detection","dataset_variant":"SST","rows":1,"metrics":["AUROC","FPR95"],"first_row_in_archive_order":{"model":"2-Layered GRU","paper":"/paper/an-effective-baseline-for-robustness-to","metrics":{"AUROC":"99.7","FPR95":"20.9"},"code_links":[{"title":"Sushil-Thapa/Abstention-OoD","url":"https://github.com/Sushil-Thapa/Abstention-OoD"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-classification-on-sst2","task":"Text Classification","dataset_variant":"SST2","rows":0,"metrics":["Accuracy","F1 Macro","F1 Micro","F1 Weighted","Precision Macro","Precision Micro","Precision Weighted","Recall Macro","Recall Micro","Recall Weighted","loss"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":84,"of":84,"counts":{"papers_with_a_benchmark_row":84,"with_a_code_link":74,"where_syntology_ran_a_sample":36,"not_listed_spam_title":0,"listed":84,"listed_where_code_ran":36,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":34,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/capo-cost-aware-prompt-optimization","slug":"capo-cost-aware-prompt-optimization","title":"CAPO: Cost-Aware Prompt Optimization","date":"2025-04-22","arxiv_id":"2504.16005","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/subregweigh-effective-and-efficient","slug":"subregweigh-effective-and-efficient","title":"SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization","date":"2024-09-10","arxiv_id":"2409.06216","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/same-uncovering-gnn-black-box-with-structure","slug":"same-uncovering-gnn-black-box-with-structure","title":"SAME: Uncovering GNN Black Box with Structure-aware Shapley-based Multipiece Explanations","date":"2023-09-21","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lm-cppf-paraphrasing-guided-data-augmentation","slug":"lm-cppf-paraphrasing-guided-data-augmentation","title":"LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning","date":"2023-05-29","arxiv_id":"2305.18169","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-algorithm-for-routing-vectors-in-sequences","slug":"an-algorithm-for-routing-vectors-in-sequences","title":"An Algorithm for Routing Vectors in Sequences","date":"2022-11-20","arxiv_id":"2211.11754","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/fine-mixing-mitigating-backdoors-in-fine","slug":"fine-mixing-mitigating-backdoors-in-fine","title":"Fine-mixing: Mitigating Backdoors in Fine-tuned Language Models","date":"2022-10-18","arxiv_id":"2210.09545","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":10,"pointer_only_for_licence":19,"official":{"repos":["huggingface/pytorch-transformers"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":10,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-mixing-mitigating-backdoors-in-fine#ran","syntology_url":"https://syntology.ai/paper/2210.09545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09545"}}}},{"paper":"/paper/llm-int8-8-bit-matrix-multiplication-for","slug":"llm-int8-8-bit-matrix-multiplication-for","title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","date":"2022-08-15","arxiv_id":"2208.07339","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["timdettmers/bitsandbytes"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llm-int8-8-bit-matrix-multiplication-for#ran","syntology_url":"https://syntology.ai/paper/2208.07339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07339"}}}},{"paper":"/paper/adversarial-self-attention-for-language","slug":"adversarial-self-attention-for-language","title":"Adversarial Self-Attention for Language Understanding","date":"2022-06-25","arxiv_id":"2206.12608","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/dual-contrastive-learning-text-classification","slug":"dual-contrastive-learning-text-classification","title":"Dual Contrastive Learning: Text Classification via Label-Aware Data Augmentation","date":"2022-01-21","arxiv_id":"2201.08702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/differentiable-prompt-makes-pre-trained","slug":"differentiable-prompt-makes-pre-trained","title":"Differentiable Prompt Makes Pre-trained Language Models Better Few-shot Learners","date":"2021-08-30","arxiv_id":"2108.13161","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["zjunlp/DART"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/differentiable-prompt-makes-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2108.13161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13161"}}}},{"paper":"/paper/charformer-fast-character-transformers-via","slug":"charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","arxiv_id":"2106.12672","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/charformer-fast-character-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2106.12672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12672"}}}},{"paper":"/paper/pay-attention-to-mlps","slug":"pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","arxiv_id":"2105.08050","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":44,"samples_ran":34,"samples_constructed":15,"samples_ran_checked":31,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":11,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pay-attention-to-mlps#ran","syntology_url":"https://syntology.ai/paper/2105.08050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08050"}}}},{"paper":"/paper/an-effective-baseline-for-robustness-to","slug":"an-effective-baseline-for-robustness-to","title":"An Effective Baseline for Robustness to Distributional Shift","date":"2021-05-15","arxiv_id":"2105.07107","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","slug":"fnet-mixing-tokens-with-fourier-transforms","title":"FNet: Mixing Tokens with Fourier Transforms","date":"2021-05-09","arxiv_id":"2105.03824","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fnet-mixing-tokens-with-fourier-transforms#ran","syntology_url":"https://syntology.ai/paper/2105.03824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03824"}}}},{"paper":"/paper/entailment-as-few-shot-learner","slug":"entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","arxiv_id":"2104.14690","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entailment-as-few-shot-learner#ran","syntology_url":"https://syntology.ai/paper/2104.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14690"}}}},{"paper":"/paper/how-to-train-bert-with-an-academic-budget","slug":"how-to-train-bert-with-an-academic-budget","title":"How to Train BERT with an Academic Budget","date":"2021-04-15","arxiv_id":"2104.07705","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/nystromformer-a-nystrom-based-algorithm-for","slug":"nystromformer-a-nystrom-based-algorithm-for","title":"Nyströmformer: A Nyström-Based Algorithm for Approximating Self-Attention","date":"2021-02-07","arxiv_id":"2102.03902","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["mlpen/Nystromformer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/nystromformer-a-nystrom-based-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2102.03902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03902"}}}},{"paper":"/paper/muppet-massive-multi-task-representations","slug":"muppet-massive-multi-task-representations","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","date":"2021-01-26","arxiv_id":"2101.11038","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/clear-contrastive-learning-for-sentence","slug":"clear-contrastive-learning-for-sentence","title":"CLEAR: Contrastive Learning for Sentence Representation","date":"2020-12-31","arxiv_id":"2012.15466","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/informer-transformer-likes-informed-attention","slug":"informer-transformer-likes-informed-attention","title":"RealFormer: Transformer Likes Residual Attention","date":"2020-12-21","arxiv_id":"2012.11747","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/self-explaining-structures-improve-nlp-models","slug":"self-explaining-structures-improve-nlp-models","title":"Self-Explaining Structures Improve NLP Models","date":"2020-12-03","arxiv_id":"2012.01786","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-statistical-framework-for-low-bitwidth","slug":"a-statistical-framework-for-low-bitwidth","title":"A Statistical Framework for Low-bitwidth Training of Deep Neural Networks","date":"2020-10-27","arxiv_id":"2010.14298","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["cjf00000/StatQuant"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-statistical-framework-for-low-bitwidth#ran","syntology_url":"https://syntology.ai/paper/2010.14298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14298"}}}},{"paper":"/paper/pay-attention-when-required","slug":"pay-attention-when-required","title":"Pay Attention when Required","date":"2020-09-09","arxiv_id":"2009.04534","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/squeezebert-what-can-computer-vision-teach","slug":"squeezebert-what-can-computer-vision-teach","title":"SqueezeBERT: What can computer vision teach NLP about efficient neural networks?","date":"2020-06-19","arxiv_id":"2006.11316","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["huggingface/transformers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/squeezebert-what-can-computer-vision-teach#ran","syntology_url":"https://syntology.ai/paper/2006.11316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11316"}}}},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"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","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/electra-pre-training-text-encoders-as-1","slug":"electra-pre-training-text-encoders-as-1","title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","date":"2020-03-23","arxiv_id":"2003.10555","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":40,"samples_ran":31,"samples_constructed":7,"samples_ran_checked":18,"samples_ran_instrument_failed":13,"samples_unverified":9,"pointer_only_for_licence":10,"official":{"repos":["google-research/electra"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/electra-pre-training-text-encoders-as-1#ran","syntology_url":"https://syntology.ai/paper/2003.10555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10555"}}}},{"paper":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}}}},{"paper":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}}}},{"paper":"/paper/smart-robust-and-efficient-fine-tuning-for","slug":"smart-robust-and-efficient-fine-tuning-for","title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","date":"2019-11-08","arxiv_id":"1911.03437","rows_on_this_dataset":6,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["namisan/mt-dnn"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/smart-robust-and-efficient-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1911.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03437"}}}},{"paper":"/paper/an-algorithm-for-routing-capsules-in-all","slug":"an-algorithm-for-routing-capsules-in-all","title":"An Algorithm for Routing Capsules in All Domains","date":"2019-11-02","arxiv_id":"1911.00792","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":5,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/q8bert-quantized-8bit-bert","slug":"q8bert-quantized-8bit-bert","title":"Q8BERT: Quantized 8Bit BERT","date":"2019-10-14","arxiv_id":"1910.06188","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["intellabs/model-compression-research-package","NervanaSystems/nlp-architect"],"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":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/q8bert-quantized-8bit-bert#ran","syntology_url":"https://syntology.ai/paper/1910.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06188"}}}},{"paper":"/paper/fine-grained-sentiment-classification-using","slug":"fine-grained-sentiment-classification-using","title":"Fine-grained Sentiment Classification using BERT","date":"2019-10-04","arxiv_id":"1910.03474","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-grained-sentiment-classification-using#ran","syntology_url":"https://syntology.ai/paper/1910.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03474"}}}},{"paper":"/paper/distilbert-a-distilled-version-of-bert","slug":"distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","arxiv_id":"1910.01108","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":27,"samples_ran":21,"samples_constructed":5,"samples_ran_checked":12,"samples_ran_instrument_failed":9,"samples_unverified":6,"pointer_only_for_licence":2,"official":{"repos":["huggingface/swift-coreml-transformers","huggingface/transformers"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilbert-a-distilled-version-of-bert#ran","syntology_url":"https://syntology.ai/paper/1910.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01108"}}}},{"paper":"/paper/albert-a-lite-bert-for-self-supervised","slug":"albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","arxiv_id":"1909.11942","rows_on_this_dataset":1,"code_links":48,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":126,"samples_ran":81,"samples_constructed":17,"samples_ran_checked":56,"samples_ran_instrument_failed":25,"samples_unverified":45,"pointer_only_for_licence":28,"official":{"repos":["google-research/ALBERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/albert-a-lite-bert-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/1909.11942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11942"}}}},{"paper":"/paper/190910351","slug":"190910351","title":"TinyBERT: Distilling BERT for Natural Language Understanding","date":"2019-09-23","arxiv_id":"1909.10351","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190910351#ran","syntology_url":"https://syntology.ai/paper/1909.10351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10351"}}}},{"paper":"/paper/q-bert-hessian-based-ultra-low-precision","slug":"q-bert-hessian-based-ultra-low-precision","title":"Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT","date":"2019-09-12","arxiv_id":"1909.05840","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/message-passing-attention-networks-for","slug":"message-passing-attention-networks-for","title":"Message Passing Attention Networks for Document Understanding","date":"2019-08-17","arxiv_id":"1908.06267","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/structbert-incorporating-language-structures","slug":"structbert-incorporating-language-structures","title":"StructBERT: Incorporating Language Structures into Pre-training for Deep Language Understanding","date":"2019-08-13","arxiv_id":"1908.04577","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/ernie-20-a-continual-pre-training-framework","slug":"ernie-20-a-continual-pre-training-framework","title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","date":"2019-07-29","arxiv_id":"1907.12412","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["PaddlePaddle/ERNIE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ernie-20-a-continual-pre-training-framework#ran","syntology_url":"https://syntology.ai/paper/1907.12412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12412"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":2,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/190600095","slug":"190600095","title":"The Pupil Has Become the Master: Teacher-Student Model-Based Word Embedding Distillation with Ensemble Learning","date":"2019-05-31","arxiv_id":"1906.00095","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ernie-enhanced-language-representation-with","slug":"ernie-enhanced-language-representation-with","title":"ERNIE: Enhanced Language Representation with Informative Entities","date":"2019-05-17","arxiv_id":"1905.07129","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["thunlp/ERNIE"],"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","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ernie-enhanced-language-representation-with#ran","syntology_url":"https://syntology.ai/paper/1905.07129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07129"}}}},{"paper":"/paper/improving-multi-task-deep-neural-networks-via","slug":"improving-multi-task-deep-neural-networks-via","title":"Improving Multi-Task Deep Neural Networks via Knowledge Distillation for Natural Language Understanding","date":"2019-04-20","arxiv_id":"1904.09482","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/distilling-task-specific-knowledge-from-bert","slug":"distilling-task-specific-knowledge-from-bert","title":"Distilling Task-Specific Knowledge from BERT into Simple Neural Networks","date":"2019-03-28","arxiv_id":"1903.12136","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilling-task-specific-knowledge-from-bert#ran","syntology_url":"https://syntology.ai/paper/1903.12136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12136"}}}},{"paper":"/paper/cloze-driven-pretraining-of-self-attention","slug":"cloze-driven-pretraining-of-self-attention","title":"Cloze-driven Pretraining of Self-attention Networks","date":"2019-03-19","arxiv_id":"1903.07785","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/star-transformer","slug":"star-transformer","title":"Star-Transformer","date":"2019-02-25","arxiv_id":"1902.09113","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["dmlc/dgl"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/star-transformer#ran","syntology_url":"https://syntology.ai/paper/1902.09113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09113"}}}},{"paper":"/paper/multi-task-deep-neural-networks-for-natural","slug":"multi-task-deep-neural-networks-for-natural","title":"Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2019-01-31","arxiv_id":"1901.11504","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["namisan/mt-dnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-task-deep-neural-networks-for-natural#ran","syntology_url":"https://syntology.ai/paper/1901.11504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11504"}}}},{"paper":"/paper/leveraging-multi-grained-sentiment-lexicon","slug":"leveraging-multi-grained-sentiment-lexicon","title":"Leveraging Multi-grained Sentiment Lexicon Information for Neural Sequence Models","date":"2018-12-04","arxiv_id":"1812.01527","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/practical-text-classification-with-large-pre","slug":"practical-text-classification-with-large-pre","title":"Practical Text Classification With Large Pre-Trained Language Models","date":"2018-12-04","arxiv_id":"1812.01207","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":534,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":234,"samples_ran_instrument_failed":66,"samples_unverified":359,"pointer_only_for_licence":164,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/training-complex-models-with-multi-task-weak","slug":"training-complex-models-with-multi-task-weak","title":"Training Complex Models with Multi-Task Weak Supervision","date":"2018-10-05","arxiv_id":"1810.02840","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/emo2vec-learning-generalized-emotion","slug":"emo2vec-learning-generalized-emotion","title":"Emo2Vec: Learning Generalized Emotion Representation by Multi-task Training","date":"2018-09-12","arxiv_id":"1809.04505","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/cell-aware-stacked-lstms-for-modeling","slug":"cell-aware-stacked-lstms-for-modeling","title":"Cell-aware Stacked LSTMs for Modeling Sentences","date":"2018-09-07","arxiv_id":"1809.02279","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/convolutional-neural-networks-with-recurrent","slug":"convolutional-neural-networks-with-recurrent","title":"Convolutional Neural Networks with Recurrent Neural Filters","date":"2018-08-28","arxiv_id":"1808.09315","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/task-oriented-word-embedding-for-text","slug":"task-oriented-word-embedding-for-text","title":"Task-oriented Word Embedding for Text Classification","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-multi-sentiment-resource-enhanced-attention","slug":"a-multi-sentiment-resource-enhanced-attention","title":"A Multi-sentiment-resource Enhanced Attention Network for Sentiment Classification","date":"2018-07-13","arxiv_id":"1807.04990","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-helping-hand-transfer-learning-for-deep","slug":"a-helping-hand-transfer-learning-for-deep","title":"A Helping Hand: Transfer Learning for Deep Sentiment Analysis","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/information-aggregation-via-dynamic-routing","slug":"information-aggregation-via-dynamic-routing","title":"Information Aggregation via Dynamic Routing for Sequence Encoding","date":"2018-06-05","arxiv_id":"1806.01501","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/baseline-needs-more-love-on-simple-word","slug":"baseline-needs-more-love-on-simple-word","title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","date":"2018-05-24","arxiv_id":"1805.09843","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/improved-sentence-modeling-using-suffix","slug":"improved-sentence-modeling-using-suffix","title":"Improved Sentence Modeling using Suffix Bidirectional LSTM","date":"2018-05-18","arxiv_id":"1805.07340","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/a-la-carte-embedding-cheap-but-effective","slug":"a-la-carte-embedding-cheap-but-effective","title":"A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors","date":"2018-05-14","arxiv_id":"1805.05388","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["NLPrinceton/ALaCarte"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-la-carte-embedding-cheap-but-effective#ran","syntology_url":"https://syntology.ai/paper/1805.05388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05388"}}}},{"paper":"/paper/investigating-capsule-networks-with-dynamic","slug":"investigating-capsule-networks-with-dynamic","title":"Investigating Capsule Networks with Dynamic Routing for Text Classification","date":"2018-03-29","arxiv_id":"1804.00538","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/universal-sentence-encoder","slug":"universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","arxiv_id":"1803.11175","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-sentence-encoder#ran","syntology_url":"https://syntology.ai/paper/1803.11175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11175"}}}},{"paper":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","rows_on_this_dataset":1,"code_links":46,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":30,"samples_constructed":12,"samples_ran_checked":24,"samples_ran_instrument_failed":6,"samples_unverified":28,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sentiment-analysis-by-capsules","slug":"sentiment-analysis-by-capsules","title":"Sentiment Analysis by Capsules","date":"2018-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gpu-kernels-for-block-sparse-weights","slug":"gpu-kernels-for-block-sparse-weights","title":"GPU Kernels for Block-Sparse Weights","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/exploring-joint-neural-model-for-sentence","slug":"exploring-joint-neural-model-for-sentence","title":"Exploring Joint Neural Model for Sentence Level Discourse Parsing and Sentiment Analysis","date":"2017-08-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/on-the-role-of-text-preprocessing-in-neural","slug":"on-the-role-of-text-preprocessing-in-neural","title":"On the Role of Text Preprocessing in Neural Network Architectures: An Evaluation Study on Text Categorization and Sentiment Analysis","date":"2017-07-06","arxiv_id":"1707.01780","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/learning-to-generate-reviews-and-discovering","slug":"learning-to-generate-reviews-and-discovering","title":"Learning to Generate Reviews and Discovering Sentiment","date":"2017-04-05","arxiv_id":"1704.01444","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-generate-reviews-and-discovering#ran","syntology_url":"https://syntology.ai/paper/1704.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01444"}}}},{"paper":"/paper/all-but-the-top-simple-and-effective","slug":"all-but-the-top-simple-and-effective","title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","date":"2017-02-05","arxiv_id":"1702.01417","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":21,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/all-but-the-top-simple-and-effective#ran","syntology_url":"https://syntology.ai/paper/1702.01417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.01417"}}}},{"paper":"/paper/text-classification-improved-by-integrating","slug":"text-classification-improved-by-integrating","title":"Text Classification Improved by Integrating Bidirectional LSTM with Two-dimensional Max Pooling","date":"2016-11-21","arxiv_id":"1611.06639","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/neural-semantic-encoders","slug":"neural-semantic-encoders","title":"Neural Semantic Encoders","date":"2016-07-14","arxiv_id":"1607.04315","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/harnessing-deep-neural-networks-with-logic","slug":"harnessing-deep-neural-networks-with-logic","title":"Harnessing Deep Neural Networks with Logic Rules","date":"2016-03-21","arxiv_id":"1603.06318","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-c-lstm-neural-network-for-text","slug":"a-c-lstm-neural-network-for-text","title":"A C-LSTM Neural Network for Text Classification","date":"2015-11-27","arxiv_id":"1511.08630","rows_on_this_dataset":2,"code_links":10,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/improved-semantic-representations-from-tree","slug":"improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","arxiv_id":"1503.00075","rows_on_this_dataset":3,"code_links":16,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":6,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["stanfordnlp/treelstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-semantic-representations-from-tree#ran","syntology_url":"https://syntology.ai/paper/1503.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00075"}}}},{"paper":"/paper/convolutional-neural-networks-for-sentence","slug":"convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","arxiv_id":"1408.5882","rows_on_this_dataset":1,"code_links":118,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":77,"samples_ran":53,"samples_constructed":0,"samples_ran_checked":40,"samples_ran_instrument_failed":13,"samples_unverified":24,"pointer_only_for_licence":21,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/convolutional-neural-networks-for-sentence#ran","syntology_url":"https://syntology.ai/paper/1408.5882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1408.5882"}}}},{"paper":"/paper/less-grammar-more-features","slug":"less-grammar-more-features","title":"Less Grammar, More Features","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recursive-deep-models-for-semantic","slug":"recursive-deep-models-for-semantic","title":"Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank","date":"2013-10-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/capo-cost-aware-prompt-optimization","slug":"capo-cost-aware-prompt-optimization","title":"CAPO: Cost-Aware Prompt Optimization","date":"2025-04-22","arxiv_id":"2504.16005","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/subregweigh-effective-and-efficient","slug":"subregweigh-effective-and-efficient","title":"SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization","date":"2024-09-10","arxiv_id":"2409.06216","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/same-uncovering-gnn-black-box-with-structure","slug":"same-uncovering-gnn-black-box-with-structure","title":"SAME: Uncovering GNN Black Box with Structure-aware Shapley-based Multipiece Explanations","date":"2023-09-21","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lm-cppf-paraphrasing-guided-data-augmentation","slug":"lm-cppf-paraphrasing-guided-data-augmentation","title":"LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning","date":"2023-05-29","arxiv_id":"2305.18169","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-algorithm-for-routing-vectors-in-sequences","slug":"an-algorithm-for-routing-vectors-in-sequences","title":"An Algorithm for Routing Vectors in Sequences","date":"2022-11-20","arxiv_id":"2211.11754","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/fine-mixing-mitigating-backdoors-in-fine","slug":"fine-mixing-mitigating-backdoors-in-fine","title":"Fine-mixing: Mitigating Backdoors in Fine-tuned Language Models","date":"2022-10-18","arxiv_id":"2210.09545","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":10,"pointer_only_for_licence":19,"official":{"repos":["huggingface/pytorch-transformers"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":10,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-mixing-mitigating-backdoors-in-fine#ran","syntology_url":"https://syntology.ai/paper/2210.09545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09545"}}}},{"paper":"/paper/llm-int8-8-bit-matrix-multiplication-for","slug":"llm-int8-8-bit-matrix-multiplication-for","title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","date":"2022-08-15","arxiv_id":"2208.07339","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["timdettmers/bitsandbytes"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llm-int8-8-bit-matrix-multiplication-for#ran","syntology_url":"https://syntology.ai/paper/2208.07339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07339"}}}},{"paper":"/paper/adversarial-self-attention-for-language","slug":"adversarial-self-attention-for-language","title":"Adversarial Self-Attention for Language Understanding","date":"2022-06-25","arxiv_id":"2206.12608","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/dual-contrastive-learning-text-classification","slug":"dual-contrastive-learning-text-classification","title":"Dual Contrastive Learning: Text Classification via Label-Aware Data Augmentation","date":"2022-01-21","arxiv_id":"2201.08702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/differentiable-prompt-makes-pre-trained","slug":"differentiable-prompt-makes-pre-trained","title":"Differentiable Prompt Makes Pre-trained Language Models Better Few-shot Learners","date":"2021-08-30","arxiv_id":"2108.13161","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":3,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["zjunlp/DART"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/differentiable-prompt-makes-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2108.13161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13161"}}}},{"paper":"/paper/charformer-fast-character-transformers-via","slug":"charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","arxiv_id":"2106.12672","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/charformer-fast-character-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2106.12672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12672"}}}},{"paper":"/paper/pay-attention-to-mlps","slug":"pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","arxiv_id":"2105.08050","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":44,"samples_ran":34,"samples_constructed":15,"samples_ran_checked":31,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":11,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pay-attention-to-mlps#ran","syntology_url":"https://syntology.ai/paper/2105.08050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08050"}}}},{"paper":"/paper/an-effective-baseline-for-robustness-to","slug":"an-effective-baseline-for-robustness-to","title":"An Effective Baseline for Robustness to Distributional Shift","date":"2021-05-15","arxiv_id":"2105.07107","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","slug":"fnet-mixing-tokens-with-fourier-transforms","title":"FNet: Mixing Tokens with Fourier Transforms","date":"2021-05-09","arxiv_id":"2105.03824","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fnet-mixing-tokens-with-fourier-transforms#ran","syntology_url":"https://syntology.ai/paper/2105.03824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03824"}}}},{"paper":"/paper/entailment-as-few-shot-learner","slug":"entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","arxiv_id":"2104.14690","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entailment-as-few-shot-learner#ran","syntology_url":"https://syntology.ai/paper/2104.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14690"}}}},{"paper":"/paper/how-to-train-bert-with-an-academic-budget","slug":"how-to-train-bert-with-an-academic-budget","title":"How to Train BERT with an Academic Budget","date":"2021-04-15","arxiv_id":"2104.07705","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/nystromformer-a-nystrom-based-algorithm-for","slug":"nystromformer-a-nystrom-based-algorithm-for","title":"Nyströmformer: A Nyström-Based Algorithm for Approximating Self-Attention","date":"2021-02-07","arxiv_id":"2102.03902","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["mlpen/Nystromformer"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/nystromformer-a-nystrom-based-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2102.03902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03902"}}}},{"paper":"/paper/muppet-massive-multi-task-representations","slug":"muppet-massive-multi-task-representations","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","date":"2021-01-26","arxiv_id":"2101.11038","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/clear-contrastive-learning-for-sentence","slug":"clear-contrastive-learning-for-sentence","title":"CLEAR: Contrastive Learning for Sentence Representation","date":"2020-12-31","arxiv_id":"2012.15466","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/informer-transformer-likes-informed-attention","slug":"informer-transformer-likes-informed-attention","title":"RealFormer: Transformer Likes Residual Attention","date":"2020-12-21","arxiv_id":"2012.11747","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/self-explaining-structures-improve-nlp-models","slug":"self-explaining-structures-improve-nlp-models","title":"Self-Explaining Structures Improve NLP Models","date":"2020-12-03","arxiv_id":"2012.01786","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-statistical-framework-for-low-bitwidth","slug":"a-statistical-framework-for-low-bitwidth","title":"A Statistical Framework for Low-bitwidth Training of Deep Neural Networks","date":"2020-10-27","arxiv_id":"2010.14298","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["cjf00000/StatQuant"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-statistical-framework-for-low-bitwidth#ran","syntology_url":"https://syntology.ai/paper/2010.14298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14298"}}}},{"paper":"/paper/pay-attention-when-required","slug":"pay-attention-when-required","title":"Pay Attention when Required","date":"2020-09-09","arxiv_id":"2009.04534","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/squeezebert-what-can-computer-vision-teach","slug":"squeezebert-what-can-computer-vision-teach","title":"SqueezeBERT: What can computer vision teach NLP about efficient neural networks?","date":"2020-06-19","arxiv_id":"2006.11316","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["huggingface/transformers"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/squeezebert-what-can-computer-vision-teach#ran","syntology_url":"https://syntology.ai/paper/2006.11316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11316"}}}},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"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","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/electra-pre-training-text-encoders-as-1","slug":"electra-pre-training-text-encoders-as-1","title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","date":"2020-03-23","arxiv_id":"2003.10555","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":40,"samples_ran":31,"samples_constructed":7,"samples_ran_checked":18,"samples_ran_instrument_failed":13,"samples_unverified":9,"pointer_only_for_licence":10,"official":{"repos":["google-research/electra"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/electra-pre-training-text-encoders-as-1#ran","syntology_url":"https://syntology.ai/paper/2003.10555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10555"}}}},{"paper":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}}}},{"paper":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}}}},{"paper":"/paper/smart-robust-and-efficient-fine-tuning-for","slug":"smart-robust-and-efficient-fine-tuning-for","title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","date":"2019-11-08","arxiv_id":"1911.03437","rows_on_this_dataset":6,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["namisan/mt-dnn"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/smart-robust-and-efficient-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1911.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03437"}}}},{"paper":"/paper/an-algorithm-for-routing-capsules-in-all","slug":"an-algorithm-for-routing-capsules-in-all","title":"An Algorithm for Routing Capsules in All Domains","date":"2019-11-02","arxiv_id":"1911.00792","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":5,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/q8bert-quantized-8bit-bert","slug":"q8bert-quantized-8bit-bert","title":"Q8BERT: Quantized 8Bit BERT","date":"2019-10-14","arxiv_id":"1910.06188","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["intellabs/model-compression-research-package","NervanaSystems/nlp-architect"],"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":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/q8bert-quantized-8bit-bert#ran","syntology_url":"https://syntology.ai/paper/1910.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06188"}}}},{"paper":"/paper/fine-grained-sentiment-classification-using","slug":"fine-grained-sentiment-classification-using","title":"Fine-grained Sentiment Classification using BERT","date":"2019-10-04","arxiv_id":"1910.03474","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fine-grained-sentiment-classification-using#ran","syntology_url":"https://syntology.ai/paper/1910.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03474"}}}},{"paper":"/paper/distilbert-a-distilled-version-of-bert","slug":"distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","arxiv_id":"1910.01108","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":27,"samples_ran":21,"samples_constructed":5,"samples_ran_checked":12,"samples_ran_instrument_failed":9,"samples_unverified":6,"pointer_only_for_licence":2,"official":{"repos":["huggingface/swift-coreml-transformers","huggingface/transformers"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilbert-a-distilled-version-of-bert#ran","syntology_url":"https://syntology.ai/paper/1910.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01108"}}}},{"paper":"/paper/albert-a-lite-bert-for-self-supervised","slug":"albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","arxiv_id":"1909.11942","rows_on_this_dataset":1,"code_links":48,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":126,"samples_ran":81,"samples_constructed":17,"samples_ran_checked":56,"samples_ran_instrument_failed":25,"samples_unverified":45,"pointer_only_for_licence":28,"official":{"repos":["google-research/ALBERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/albert-a-lite-bert-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/1909.11942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11942"}}}},{"paper":"/paper/190910351","slug":"190910351","title":"TinyBERT: Distilling BERT for Natural Language Understanding","date":"2019-09-23","arxiv_id":"1909.10351","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190910351#ran","syntology_url":"https://syntology.ai/paper/1909.10351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10351"}}}},{"paper":"/paper/q-bert-hessian-based-ultra-low-precision","slug":"q-bert-hessian-based-ultra-low-precision","title":"Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT","date":"2019-09-12","arxiv_id":"1909.05840","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/message-passing-attention-networks-for","slug":"message-passing-attention-networks-for","title":"Message Passing Attention Networks for Document Understanding","date":"2019-08-17","arxiv_id":"1908.06267","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/structbert-incorporating-language-structures","slug":"structbert-incorporating-language-structures","title":"StructBERT: Incorporating Language Structures into Pre-training for Deep Language Understanding","date":"2019-08-13","arxiv_id":"1908.04577","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/ernie-20-a-continual-pre-training-framework","slug":"ernie-20-a-continual-pre-training-framework","title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","date":"2019-07-29","arxiv_id":"1907.12412","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["PaddlePaddle/ERNIE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ernie-20-a-continual-pre-training-framework#ran","syntology_url":"https://syntology.ai/paper/1907.12412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12412"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":2,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/190600095","slug":"190600095","title":"The Pupil Has Become the Master: Teacher-Student Model-Based Word Embedding Distillation with Ensemble Learning","date":"2019-05-31","arxiv_id":"1906.00095","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ernie-enhanced-language-representation-with","slug":"ernie-enhanced-language-representation-with","title":"ERNIE: Enhanced Language Representation with Informative Entities","date":"2019-05-17","arxiv_id":"1905.07129","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["thunlp/ERNIE"],"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","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ernie-enhanced-language-representation-with#ran","syntology_url":"https://syntology.ai/paper/1905.07129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07129"}}}},{"paper":"/paper/improving-multi-task-deep-neural-networks-via","slug":"improving-multi-task-deep-neural-networks-via","title":"Improving Multi-Task Deep Neural Networks via Knowledge Distillation for Natural Language Understanding","date":"2019-04-20","arxiv_id":"1904.09482","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/distilling-task-specific-knowledge-from-bert","slug":"distilling-task-specific-knowledge-from-bert","title":"Distilling Task-Specific Knowledge from BERT into Simple Neural Networks","date":"2019-03-28","arxiv_id":"1903.12136","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/distilling-task-specific-knowledge-from-bert#ran","syntology_url":"https://syntology.ai/paper/1903.12136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12136"}}}},{"paper":"/paper/cloze-driven-pretraining-of-self-attention","slug":"cloze-driven-pretraining-of-self-attention","title":"Cloze-driven Pretraining of Self-attention Networks","date":"2019-03-19","arxiv_id":"1903.07785","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/star-transformer","slug":"star-transformer","title":"Star-Transformer","date":"2019-02-25","arxiv_id":"1902.09113","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["dmlc/dgl"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/star-transformer#ran","syntology_url":"https://syntology.ai/paper/1902.09113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09113"}}}},{"paper":"/paper/multi-task-deep-neural-networks-for-natural","slug":"multi-task-deep-neural-networks-for-natural","title":"Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2019-01-31","arxiv_id":"1901.11504","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["namisan/mt-dnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-task-deep-neural-networks-for-natural#ran","syntology_url":"https://syntology.ai/paper/1901.11504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11504"}}}},{"paper":"/paper/leveraging-multi-grained-sentiment-lexicon","slug":"leveraging-multi-grained-sentiment-lexicon","title":"Leveraging Multi-grained Sentiment Lexicon Information for Neural Sequence Models","date":"2018-12-04","arxiv_id":"1812.01527","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/practical-text-classification-with-large-pre","slug":"practical-text-classification-with-large-pre","title":"Practical Text Classification With Large Pre-Trained Language Models","date":"2018-12-04","arxiv_id":"1812.01207","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":534,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":234,"samples_ran_instrument_failed":66,"samples_unverified":359,"pointer_only_for_licence":164,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/training-complex-models-with-multi-task-weak","slug":"training-complex-models-with-multi-task-weak","title":"Training Complex Models with Multi-Task Weak Supervision","date":"2018-10-05","arxiv_id":"1810.02840","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/emo2vec-learning-generalized-emotion","slug":"emo2vec-learning-generalized-emotion","title":"Emo2Vec: Learning Generalized Emotion Representation by Multi-task Training","date":"2018-09-12","arxiv_id":"1809.04505","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/cell-aware-stacked-lstms-for-modeling","slug":"cell-aware-stacked-lstms-for-modeling","title":"Cell-aware Stacked LSTMs for Modeling Sentences","date":"2018-09-07","arxiv_id":"1809.02279","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/convolutional-neural-networks-with-recurrent","slug":"convolutional-neural-networks-with-recurrent","title":"Convolutional Neural Networks with Recurrent Neural Filters","date":"2018-08-28","arxiv_id":"1808.09315","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/task-oriented-word-embedding-for-text","slug":"task-oriented-word-embedding-for-text","title":"Task-oriented Word Embedding for Text Classification","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-multi-sentiment-resource-enhanced-attention","slug":"a-multi-sentiment-resource-enhanced-attention","title":"A Multi-sentiment-resource Enhanced Attention Network for Sentiment Classification","date":"2018-07-13","arxiv_id":"1807.04990","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-helping-hand-transfer-learning-for-deep","slug":"a-helping-hand-transfer-learning-for-deep","title":"A Helping Hand: Transfer Learning for Deep Sentiment Analysis","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/information-aggregation-via-dynamic-routing","slug":"information-aggregation-via-dynamic-routing","title":"Information Aggregation via Dynamic Routing for Sequence Encoding","date":"2018-06-05","arxiv_id":"1806.01501","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/baseline-needs-more-love-on-simple-word","slug":"baseline-needs-more-love-on-simple-word","title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","date":"2018-05-24","arxiv_id":"1805.09843","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/improved-sentence-modeling-using-suffix","slug":"improved-sentence-modeling-using-suffix","title":"Improved Sentence Modeling using Suffix Bidirectional LSTM","date":"2018-05-18","arxiv_id":"1805.07340","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/a-la-carte-embedding-cheap-but-effective","slug":"a-la-carte-embedding-cheap-but-effective","title":"A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors","date":"2018-05-14","arxiv_id":"1805.05388","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["NLPrinceton/ALaCarte"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-la-carte-embedding-cheap-but-effective#ran","syntology_url":"https://syntology.ai/paper/1805.05388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05388"}}}},{"paper":"/paper/investigating-capsule-networks-with-dynamic","slug":"investigating-capsule-networks-with-dynamic","title":"Investigating Capsule Networks with Dynamic Routing for Text Classification","date":"2018-03-29","arxiv_id":"1804.00538","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/universal-sentence-encoder","slug":"universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","arxiv_id":"1803.11175","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-sentence-encoder#ran","syntology_url":"https://syntology.ai/paper/1803.11175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11175"}}}},{"paper":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","rows_on_this_dataset":1,"code_links":46,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":30,"samples_constructed":12,"samples_ran_checked":24,"samples_ran_instrument_failed":6,"samples_unverified":28,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/sentiment-analysis-by-capsules","slug":"sentiment-analysis-by-capsules","title":"Sentiment Analysis by Capsules","date":"2018-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gpu-kernels-for-block-sparse-weights","slug":"gpu-kernels-for-block-sparse-weights","title":"GPU Kernels for Block-Sparse Weights","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/exploring-joint-neural-model-for-sentence","slug":"exploring-joint-neural-model-for-sentence","title":"Exploring Joint Neural Model for Sentence Level Discourse Parsing and Sentiment Analysis","date":"2017-08-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/on-the-role-of-text-preprocessing-in-neural","slug":"on-the-role-of-text-preprocessing-in-neural","title":"On the Role of Text Preprocessing in Neural Network Architectures: An Evaluation Study on Text Categorization and Sentiment Analysis","date":"2017-07-06","arxiv_id":"1707.01780","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/learning-to-generate-reviews-and-discovering","slug":"learning-to-generate-reviews-and-discovering","title":"Learning to Generate Reviews and Discovering Sentiment","date":"2017-04-05","arxiv_id":"1704.01444","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-generate-reviews-and-discovering#ran","syntology_url":"https://syntology.ai/paper/1704.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01444"}}}},{"paper":"/paper/all-but-the-top-simple-and-effective","slug":"all-but-the-top-simple-and-effective","title":"All-but-the-Top: Simple and Effective Postprocessing for Word Representations","date":"2017-02-05","arxiv_id":"1702.01417","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":21,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/all-but-the-top-simple-and-effective#ran","syntology_url":"https://syntology.ai/paper/1702.01417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.01417"}}}},{"paper":"/paper/text-classification-improved-by-integrating","slug":"text-classification-improved-by-integrating","title":"Text Classification Improved by Integrating Bidirectional LSTM with Two-dimensional Max Pooling","date":"2016-11-21","arxiv_id":"1611.06639","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/neural-semantic-encoders","slug":"neural-semantic-encoders","title":"Neural Semantic Encoders","date":"2016-07-14","arxiv_id":"1607.04315","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/harnessing-deep-neural-networks-with-logic","slug":"harnessing-deep-neural-networks-with-logic","title":"Harnessing Deep Neural Networks with Logic Rules","date":"2016-03-21","arxiv_id":"1603.06318","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-c-lstm-neural-network-for-text","slug":"a-c-lstm-neural-network-for-text","title":"A C-LSTM Neural Network for Text Classification","date":"2015-11-27","arxiv_id":"1511.08630","rows_on_this_dataset":2,"code_links":10,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/improved-semantic-representations-from-tree","slug":"improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","arxiv_id":"1503.00075","rows_on_this_dataset":3,"code_links":16,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":6,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["stanfordnlp/treelstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-semantic-representations-from-tree#ran","syntology_url":"https://syntology.ai/paper/1503.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00075"}}}},{"paper":"/paper/convolutional-neural-networks-for-sentence","slug":"convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","arxiv_id":"1408.5882","rows_on_this_dataset":1,"code_links":118,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":77,"samples_ran":53,"samples_constructed":0,"samples_ran_checked":40,"samples_ran_instrument_failed":13,"samples_unverified":24,"pointer_only_for_licence":21,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/convolutional-neural-networks-for-sentence#ran","syntology_url":"https://syntology.ai/paper/1408.5882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1408.5882"}}}},{"paper":"/paper/less-grammar-more-features","slug":"less-grammar-more-features","title":"Less Grammar, More Features","date":"2014-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recursive-deep-models-for-semantic","slug":"recursive-deep-models-for-semantic","title":"Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank","date":"2013-10-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":2,"syntology":null}],"papers_where_code_ran":36,"papers_where_code_ran_first_page":"/dataset/sst/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/sst/papers/ran/1","json":"/dataset/sst/papers/ran/1.json","rows":36}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":40,"samples_harvested":1367,"samples_ran":782,"samples_constructed":153,"samples_ran_checked":594,"samples_ran_instrument_failed":188,"samples_unverified":585,"pointer_only_for_licence":364,"papers_with_no_sample_that_ran":4,"papers_with_a_sample_that_ran":36,"papers_with_a_run_with_no_instrument_failure":34,"papers_where_every_run_was_an_instrument_failure":2,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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":21,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/sentiment-analysis-on-sst-2-binary","since_archive":"/sota/sentiment-analysis-on-sst-2-binary#since-judged","papers_judged":17,"placed":0},{"leaderboard":"/sota/sentiment-analysis-on-sst-5-fine-grained","since_archive":"/sota/sentiment-analysis-on-sst-5-fine-grained#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/explanation-fidelity-evaluation-on-sst2","since_archive":"/sota/explanation-fidelity-evaluation-on-sst2#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/few-shot-learning-on-sst-2-binary","since_archive":"/sota/few-shot-learning-on-sst-2-binary#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/out-of-distribution-detection-on-sst","since_archive":"/sota/out-of-distribution-detection-on-sst#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"bf771bfe94dddd9732a4bae28953496e1a6d6af2962454519004d1ffb243eff6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}