{"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/penn-treebank","name":"Penn Treebank","full_name":null,"description_markdown":"The English **Penn Treebank** (**PTB**) corpus, and in particular the section of the corpus corresponding to the articles of Wall Street Journal (WSJ), is one of the most known and used corpus for the evaluation of models for sequence labelling. The task consists of annotating each word with its Part-of-Speech tag. In the most common split of this corpus,  sections from 0 to 18 are used for training (38 219 sentences, 912 344 tokens), sections from 19 to 21 are used for validation (5 527 sentences, 131 768 tokens), and sections from 22 to 24 are used for testing (5 462 sentences, 129 654 tokens).\r\nThe corpus is also commonly used for character-level and word-level Language Modelling.\r\n\r\nSource: [Seq2Biseq: Bidirectional Output-wise Recurrent Neural Networks for Sequence Modelling](https://arxiv.org/abs/1904.04733)\r\nImage Source: [https://dl.acm.org/doi/10.5555/972470.972475](https://dl.acm.org/doi/10.5555/972470.972475)","description_withheld":null,"homepage":"https://catalog.ldc.upenn.edu/docs/LDC95T7/cl93.html","introduced_date":"1993-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Building a Large Annotated Corpus of English: The Penn Treebank","first_author":null,"url":"http://dl.acm.org/citation.cfm?id=972470.972475"},"license":{"name":"Custom","url":"https://catalog.ldc.upenn.edu/LDC99T42"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Language Modelling","url":"/task/language-modelling","datasets_with_task":"/datasets/task/language-modelling"},{"name":"Open Information Extraction","url":"/task/open-information-extraction","datasets_with_task":"/datasets/task/open-information-extraction"},{"name":"Dependency Parsing","url":"/task/dependency-parsing","datasets_with_task":"/datasets/task/dependency-parsing"},{"name":"Part-Of-Speech Tagging","url":"/task/part-of-speech-tagging","datasets_with_task":"/datasets/task/part-of-speech-tagging"},{"name":"Stochastic Optimization","url":"/task/stochastic-optimization","datasets_with_task":"/datasets/task/stochastic-optimization"},{"name":"Constituency Parsing","url":"/task/constituency-parsing","datasets_with_task":"/datasets/task/constituency-parsing"},{"name":"Chunking","url":"/task/chunking","datasets_with_task":"/datasets/task/chunking"},{"name":"Constituency Grammar Induction","url":"/task/constituency-grammar-induction","datasets_with_task":"/datasets/task/constituency-grammar-induction"},{"name":"Missing Elements","url":"/task/missing-elements","datasets_with_task":"/datasets/task/missing-elements"},{"name":"Unsupervised Dependency Parsing","url":"/task/unsupervised-dependency-parsing","datasets_with_task":"/datasets/task/unsupervised-dependency-parsing"}],"languages":[],"variants":["Penn Treebank","Penn Treebank (Word Level)","Penn Treebank (Character Level)","Penn Treebank (Character Level) 3x1000 LSTM - 500 Epochs"],"data_loaders":[{"repo":"https://github.com/pytorch/text","url":"https://pytorch.org/text/stable/datasets.html#torchtext.datasets.PennTreebank","frameworks":["pytorch"]},{"repo":"https://github.com/allenai/allennlp-models","url":"https://docs.allennlp.org/models/main/models/structured_prediction/dataset_readers/penn_tree_bank/","frameworks":["pytorch"]}],"num_papers_in_archive":1006,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/language-modelling-on-penn-treebank-word","task":"Language Modelling","dataset_variant":"Penn Treebank (Word Level)","rows":43,"metrics":["Test perplexity","Validation perplexity","Params"],"first_row_in_archive_order":{"model":"GPT-3 (Zero-Shot)","paper":"/paper/language-models-are-few-shot-learners","metrics":{"Params":"175000M","Test perplexity":"20.5"},"code_links":[{"title":"ggml-org/llama.cpp","url":"https://github.com/ggml-org/llama.cpp"},{"title":"ggerganov/llama.cpp","url":"https://github.com/ggerganov/llama.cpp"},{"title":"karpathy/llm.c","url":"https://github.com/karpathy/llm.c"},{"title":"openai/gpt-3","url":"https://github.com/openai/gpt-3"},{"title":"PaddlePaddle/PaddleNLP","url":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/language_model/gpt-3"},{"title":"EleutherAI/lm_evaluation_harness","url":"https://github.com/EleutherAI/lm_evaluation_harness"},{"title":"EleutherAI/lm-evaluation-harness","url":"https://github.com/EleutherAI/lm-evaluation-harness"},{"title":"EleutherAI/gpt-neo","url":"https://github.com/EleutherAI/gpt-neo"},{"title":"karpathy/build-nanogpt","url":"https://github.com/karpathy/build-nanogpt"},{"title":"ncoop57/gpt-code-clippy","url":"https://github.com/ncoop57/gpt-code-clippy"},{"title":"codedotal/gpt-code-clippy","url":"https://github.com/codedotal/gpt-code-clippy"},{"title":"bigscience-workshop/promptsource","url":"https://github.com/bigscience-workshop/promptsource"},{"title":"shreyashankar/gpt3-sandbox","url":"https://github.com/shreyashankar/gpt3-sandbox"},{"title":"bigscience-workshop/Megatron-DeepSpeed","url":"https://github.com/bigscience-workshop/Megatron-DeepSpeed"},{"title":"NVIDIA/NeMo-Curator","url":"https://github.com/NVIDIA/NeMo-Curator"},{"title":"RUCAIBox/LLMBox","url":"https://github.com/RUCAIBox/LLMBox"},{"title":"hazyresearch/ama_prompting","url":"https://github.com/hazyresearch/ama_prompting"},{"title":"allenai/macaw","url":"https://github.com/allenai/macaw"},{"title":"facebookresearch/anli","url":"https://github.com/facebookresearch/anli"},{"title":"tonyzhaozh/few-shot-learning","url":"https://github.com/tonyzhaozh/few-shot-learning"},{"title":"haiyang-w/git","url":"https://github.com/haiyang-w/git"},{"title":"volcengine/vegiantmodel","url":"https://github.com/volcengine/vegiantmodel"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/nlp/gpt"},{"title":"asahi417/lmppl","url":"https://github.com/asahi417/lmppl"},{"title":"ethanjperez/true_few_shot","url":"https://github.com/ethanjperez/true_few_shot"},{"title":"ai21labs/lm-evaluation","url":"https://github.com/ai21labs/lm-evaluation"},{"title":"lambert-x/prolab","url":"https://github.com/lambert-x/prolab"},{"title":"asahi417/relbert","url":"https://github.com/asahi417/relbert"},{"title":"grantslatton/llama.cpp","url":"https://github.com/grantslatton/llama.cpp"},{"title":"milmor/GPT","url":"https://github.com/milmor/GPT"},{"title":"um-arm-lab/efficient-eng-2-ltl","url":"https://github.com/um-arm-lab/efficient-eng-2-ltl"},{"title":"abhaskumarsinha/MinimalGPT","url":"https://github.com/abhaskumarsinha/MinimalGPT"},{"title":"turkunlp/megatron-deepspeed","url":"https://github.com/turkunlp/megatron-deepspeed"},{"title":"contextlab/abstract2paper","url":"https://github.com/contextlab/abstract2paper"},{"title":"kyegomez/GPT3","url":"https://github.com/kyegomez/GPT3"},{"title":"Samyu0304/thought-propagation","url":"https://github.com/Samyu0304/thought-propagation"},{"title":"smarton-empower/smarton-ai","url":"https://github.com/smarton-empower/smarton-ai"},{"title":"smile-data/smile","url":"https://github.com/smile-data/smile"},{"title":"postech-ami/smile-dataset","url":"https://github.com/postech-ami/smile-dataset"},{"title":"opengptx/lm-evaluation-harness","url":"https://github.com/opengptx/lm-evaluation-harness"},{"title":"gmum/dl-mo-2021","url":"https://github.com/gmum/dl-mo-2021"},{"title":"fywalter/label-bias","url":"https://github.com/fywalter/label-bias"},{"title":"nlx-group/overlapy","url":"https://github.com/nlx-group/overlapy"},{"title":"openbiolink/promptsource","url":"https://github.com/openbiolink/promptsource"},{"title":"insait-institute/lm-evaluation-harness-bg","url":"https://github.com/insait-institute/lm-evaluation-harness-bg"},{"title":"x-lance/neusym-rag","url":"https://github.com/x-lance/neusym-rag"},{"title":"crazydigger/Callibration-of-GPT","url":"https://github.com/crazydigger/Callibration-of-GPT"},{"title":"abhaskumarsinha/Corpus2GPT","url":"https://github.com/abhaskumarsinha/Corpus2GPT"},{"title":"vilm-ai/viet-llm-eval","url":"https://github.com/vilm-ai/viet-llm-eval"},{"title":"roberttwomey/machine-imagination-workshop","url":"https://github.com/roberttwomey/machine-imagination-workshop"},{"title":"VachanVY/gpt.jax","url":"https://github.com/VachanVY/gpt.jax"},{"title":"neuralmagic/lm-evaluation-harness","url":"https://github.com/neuralmagic/lm-evaluation-harness"},{"title":"scrayish/ML_NLP","url":"https://github.com/scrayish/ML_NLP"},{"title":"sambanova/lm-evaluation-harness","url":"https://github.com/sambanova/lm-evaluation-harness"},{"title":"roberttwomey/machine-imagination-isea","url":"https://github.com/roberttwomey/machine-imagination-isea"},{"title":"ltruncel/Microsoft_Azure_50daysofudacity","url":"https://github.com/ltruncel/Microsoft_Azure_50daysofudacity"},{"title":"ramanakshay/nanogpt","url":"https://github.com/ramanakshay/nanogpt"},{"title":"juletx/lm-evaluation-harness","url":"https://github.com/juletx/lm-evaluation-harness"},{"title":"national-center-for-ai-saudi-arabia/lm-evaluation-harness","url":"https://github.com/national-center-for-ai-saudi-arabia/lm-evaluation-harness"},{"title":"hilberthit/gpt-3","url":"https://github.com/hilberthit/gpt-3"},{"title":"longhao-chen/aicas2024","url":"https://github.com/longhao-chen/aicas2024"},{"title":"EightRice/atn_GPT-3","url":"https://github.com/EightRice/atn_GPT-3"},{"title":"Mind23-2/MindCode-138","url":"https://github.com/Mind23-2/MindCode-138"},{"title":"mbzuai-paris/lm-evaluation-harness-atlas-chat","url":"https://github.com/mbzuai-paris/lm-evaluation-harness-atlas-chat"},{"title":"Sypherd/lm-evaluation-harness","url":"https://github.com/Sypherd/lm-evaluation-harness"},{"title":"hojjat-mokhtarabadi/promptsource","url":"https://github.com/hojjat-mokhtarabadi/promptsource"},{"title":"zphang/lm_evaluation_harness","url":"https://github.com/zphang/lm_evaluation_harness"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/constituency-parsing-on-penn-treebank","task":"Constituency Parsing","dataset_variant":"Penn Treebank","rows":27,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"Hashing + XLNet","paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","metrics":{"F1 score":"96.43"},"code_links":[{"title":"speedcell4/parserker","url":"https://github.com/speedcell4/parserker"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/dependency-parsing-on-penn-treebank","task":"Dependency Parsing","dataset_variant":"Penn Treebank","rows":22,"metrics":["LAS","UAS","POS"],"first_row_in_archive_order":{"model":"Label Attention Layer + HPSG + XLNet","paper":"/paper/rethinking-self-attention-an-interpretable","metrics":{"LAS":"96.26","POS":"97.3","UAS":"97.42"},"code_links":[{"title":"KhalilMrini/LAL-Parser","url":"https://github.com/KhalilMrini/LAL-Parser"},{"title":"kh8fb/LAL-Parser-Server","url":"https://github.com/kh8fb/LAL-Parser-Server"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/language-modelling-on-penn-treebank-character","task":"Language Modelling","dataset_variant":"Penn Treebank (Character Level)","rows":20,"metrics":["Bit per Character (BPC)","Number of params"],"first_row_in_archive_order":{"model":"Mogrifier LSTM + dynamic eval","paper":"/paper/mogrifier-lstm","metrics":{"Bit per Character (BPC)":"1.083","Number of params":"24M"},"code_links":[{"title":"deepmind/lamb","url":"https://github.com/deepmind/lamb"},{"title":"RMichaelSwan/MogrifierLSTM","url":"https://github.com/RMichaelSwan/MogrifierLSTM"},{"title":"microcoder-py/mogrifier-lstm","url":"https://github.com/microcoder-py/mogrifier-lstm"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/part-of-speech-tagging-on-penn-treebank","task":"Part-Of-Speech Tagging","dataset_variant":"Penn Treebank","rows":20,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SALE-BART encoder","paper":"/paper/sequence-alignment-ensemble-with-a-single","metrics":{"Accuracy":"98.15"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/chunking-on-penn-treebank","task":"Chunking","dataset_variant":"Penn Treebank","rows":8,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"ACE","paper":"/paper/automated-concatenation-of-embeddings-for-1","metrics":{"F1 score":"97.3"},"code_links":[{"title":"Alibaba-NLP/ACE","url":"https://github.com/Alibaba-NLP/ACE"},{"title":"zhaoyuesun/phee","url":"https://github.com/zhaoyuesun/phee"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-dependency-parsing-on-penn","task":"Unsupervised Dependency Parsing","dataset_variant":"Penn Treebank","rows":6,"metrics":["UAS"],"first_row_in_archive_order":{"model":"Ensemble (selected w/ society entropy)","paper":"/paper/error-diversity-matters-an-error-resistant","metrics":{"UAS":"67.3"},"code_links":[{"title":"manga-uofa/ed4udp","url":"https://github.com/manga-uofa/ed4udp"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/open-information-extraction-on-penn-treebank","task":"Open Information Extraction","dataset_variant":"Penn Treebank","rows":4,"metrics":["F1","AUC"],"first_row_in_archive_order":{"model":"Deepstruct zero-shot","paper":"/paper/deepstruct-pretraining-of-language-models-for-1","metrics":{"F1":"51"},"code_links":[{"title":"cgraywang/deepstruct","url":"https://github.com/cgraywang/deepstruct"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/stochastic-optimization-on-penn-treebank","task":"Stochastic Optimization","dataset_variant":"Penn Treebank (Character Level) 3x1000 LSTM - 500 Epochs","rows":4,"metrics":["Bit per Character (BPC)"],"first_row_in_archive_order":{"model":"AvaGrad","paper":"/paper/domain-independent-dominance-of-adaptive-1","metrics":{"Bit per Character (BPC)":"1.175"},"code_links":[{"title":"lolemacs/avagrad","url":"https://github.com/lolemacs/avagrad"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/constituency-grammar-induction-on-penn","task":"Constituency Grammar Induction","dataset_variant":"Penn Treebank","rows":0,"metrics":["Mean F1 (WSJ)","Sentences F-Score"],"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":2,"rows_per_page":100,"shown":100,"of":108,"counts":{"papers_with_a_benchmark_row":108,"with_a_code_link":93,"where_syntology_ran_a_sample":41,"not_listed_spam_title":0,"listed":108,"listed_where_code_ran":41,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":7,"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/error-diversity-matters-an-error-resistant","slug":"error-diversity-matters-an-error-resistant","title":"Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing","date":"2024-12-16","arxiv_id":"2412.11543","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/advancing-state-of-the-art-in-language","slug":"advancing-state-of-the-art-in-language","title":"Advancing State of the Art in Language Modeling","date":"2023-11-28","arxiv_id":"2312.03735","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/enhancing-structure-aware-encoder-with","slug":"enhancing-structure-aware-encoder-with","title":"Enhancing Structure-aware Encoder with Extremely Limited Data for Graph-based Dependency Parsing","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sequence-alignment-ensemble-with-a-single","slug":"sequence-alignment-ensemble-with-a-single","title":"Sequence Alignment Ensemble with a Single Neural Network for Sequence Labeling","date":"2022-07-07","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/sequential-alignment-methods-for-ensemble","slug":"sequential-alignment-methods-for-ensemble","title":"Sequential Alignment Methods for Ensemble Part-of-Speech Tagging","date":"2022-03-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/investigating-non-local-features-for-neural","slug":"investigating-non-local-features-for-neural","title":"Investigating Non-local Features for Neural Constituency Parsing","date":"2021-09-27","arxiv_id":"2109.12814","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/zero-shot-information-extraction-as-a-unified","slug":"zero-shot-information-extraction-as-a-unified","title":"Zero-Shot Information Extraction as a Unified Text-to-Triple Translation","date":"2021-09-23","arxiv_id":"2109.11171","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/n-ary-constituent-tree-parsing-with-recursive","slug":"n-ary-constituent-tree-parsing-with-recursive","title":"N-ary Constituent Tree Parsing with Recursive Semi-Markov Model","date":"2021-07-26","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/autodropout-learning-dropout-patterns-to","slug":"autodropout-learning-dropout-patterns-to","title":"AutoDropout: Learning Dropout Patterns to Regularize Deep Networks","date":"2021-01-05","arxiv_id":"2101.01761","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-associative-inference-using-fast-1","slug":"learning-associative-inference-using-fast-1","title":"Learning Associative Inference Using Fast Weight Memory","date":"2020-11-16","arxiv_id":"2011.07831","rows_on_this_dataset":1,"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":["ischlag/Fast-Weight-Memory-public"],"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/learning-associative-inference-using-fast-1#ran","syntology_url":"https://syntology.ai/paper/2011.07831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07831"}}}},{"paper":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}}}},{"paper":"/paper/improving-constituency-parsing-with-span","slug":"improving-constituency-parsing-with-span","title":"Improving Constituency Parsing with Span Attention","date":"2020-10-15","arxiv_id":"2010.07543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cuhksz-nlp/SAPar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-constituency-parsing-with-span#ran","syntology_url":"https://syntology.ai/paper/2010.07543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07543"}}}},{"paper":"/paper/automated-concatenation-of-embeddings-for-1","slug":"automated-concatenation-of-embeddings-for-1","title":"Automated Concatenation of Embeddings for Structured Prediction","date":"2020-10-10","arxiv_id":"2010.05006","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/second-order-neural-dependency-parsing-with","slug":"second-order-neural-dependency-parsing-with","title":"Second-Order Neural Dependency Parsing with Message Passing and End-to-End Training","date":"2020-10-10","arxiv_id":"2010.05003","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fast-and-accurate-neural-crf-constituency-1","slug":"fast-and-accurate-neural-crf-constituency-1","title":"Fast and Accurate Neural CRF Constituency Parsing","date":"2020-08-09","arxiv_id":"2008.03736","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-and-accurate-neural-crf-constituency-1#ran","syntology_url":"https://syntology.ai/paper/2008.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03736"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"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/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/efficient-second-order-treecrf-for-neural","slug":"efficient-second-order-treecrf-for-neural","title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","date":"2020-05-03","arxiv_id":"2005.00975","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-second-order-treecrf-for-neural#ran","syntology_url":"https://syntology.ai/paper/2005.00975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00975"}}}},{"paper":"/paper/recursive-non-autoregressive-graph-to-graph","slug":"recursive-non-autoregressive-graph-to-graph","title":"Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement","date":"2020-03-29","arxiv_id":"2003.13118","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/accessing-higher-level-representations-in","slug":"accessing-higher-level-representations-in","title":"Addressing Some Limitations of Transformers with Feedback Memory","date":"2020-02-21","arxiv_id":"2002.09402","rows_on_this_dataset":1,"code_links":4,"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":["facebookresearch/transformer-sequential"],"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/accessing-higher-level-representations-in#ran","syntology_url":"https://syntology.ai/paper/2002.09402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09402"}}}},{"paper":"/paper/recurrent-highway-networks-with-grouped","slug":"recurrent-highway-networks-with-grouped","title":"Recurrent Highway Networks with Grouped Auxiliary Memory","date":"2019-12-13","arxiv_id":null,"rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/domain-independent-dominance-of-adaptive-1","slug":"domain-independent-dominance-of-adaptive-1","title":"Domain-independent Dominance of Adaptive Methods","date":"2019-12-04","arxiv_id":"1912.01823","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/gating-revisited-deep-multi-layer-rnns-that-1","slug":"gating-revisited-deep-multi-layer-rnns-that-1","title":"Gating Revisited: Deep Multi-layer RNNs That Can Be Trained","date":"2019-11-25","arxiv_id":"1911.11033","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","slug":"seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","arxiv_id":"1911.06393","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["f90/Seq-U-Net"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for#ran","syntology_url":"https://syntology.ai/paper/1911.06393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06393"}}}},{"paper":"/paper/generalizing-natural-language-analysis-1","slug":"generalizing-natural-language-analysis-1","title":"Generalizing Natural Language Analysis through Span-relation Representations","date":"2019-11-10","arxiv_id":"1911.03822","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/rethinking-self-attention-an-interpretable","slug":"rethinking-self-attention-an-interpretable","title":"Rethinking Self-Attention: Towards Interpretability in Neural Parsing","date":"2019-11-10","arxiv_id":"1911.03875","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["KhalilMrini/LAL-Parser"],"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/rethinking-self-attention-an-interpretable#ran","syntology_url":"https://syntology.ai/paper/1911.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03875"}}}},{"paper":"/paper/deep-independently-recurrent-neural-network","slug":"deep-independently-recurrent-neural-network","title":"Deep Independently Recurrent Neural Network (IndRNN)","date":"2019-10-11","arxiv_id":"1910.06251","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/mogrifier-lstm","slug":"mogrifier-lstm","title":"Mogrifier LSTM","date":"2019-09-04","arxiv_id":"1909.01792","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/deep-equilibrium-models","slug":"deep-equilibrium-models","title":"Deep Equilibrium Models","date":"2019-09-03","arxiv_id":"1909.01377","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["locuslab/deq"],"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/deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/1909.01377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01377"}}}},{"paper":"/paper/hierarchically-refined-label-attention","slug":"hierarchically-refined-label-attention","title":"Hierarchically-Refined Label Attention Network for Sequence Labeling","date":"2019-08-23","arxiv_id":"1908.08676","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["DSE-MSU/R-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}}}},{"paper":"/paper/head-driven-phrase-structure-grammar-parsing","slug":"head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","arxiv_id":"1907.02684","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["DoodleJZ/HPSG-Neural-Parser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/head-driven-phrase-structure-grammar-parsing#ran","syntology_url":"https://syntology.ai/paper/1907.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02684"}}}},{"paper":"/paper/graph-based-dependency-parsing-with-graph","slug":"graph-based-dependency-parsing-with-graph","title":"Graph-based Dependency Parsing with Graph Neural Networks","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-neural-language-modeling-via","slug":"improving-neural-language-modeling-via","title":"Improving Neural Language Modeling via Adversarial Training","date":"2019-06-10","arxiv_id":"1906.03805","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discrete-flows-invertible-generative-models","slug":"discrete-flows-invertible-generative-models","title":"Discrete Flows: Invertible Generative Models of Discrete Data","date":"2019-05-24","arxiv_id":"1905.10347","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/deep-residual-output-layers-for-neural","slug":"deep-residual-output-layers-for-neural","title":"Deep Residual Output Layers for Neural Language Generation","date":"2019-05-14","arxiv_id":"1905.05513","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/tetra-tagging-word-synchronous-parsing-with","slug":"tetra-tagging-word-synchronous-parsing-with","title":"Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference","date":"2019-04-22","arxiv_id":"1904.09745","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/190409408","slug":"190409408","title":"Language Models with Transformers","date":"2019-04-20","arxiv_id":"1904.09408","rows_on_this_dataset":1,"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":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["cgraywang/gluon-nlp-1"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190409408#ran","syntology_url":"https://syntology.ai/paper/1904.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09408"}}}},{"paper":"/paper/left-to-right-dependency-parsing-with-pointer","slug":"left-to-right-dependency-parsing-with-pointer","title":"Left-to-Right Dependency Parsing with Pointer Networks","date":"2019-03-20","arxiv_id":"1903.08445","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"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/partially-shuffling-the-training-data-to-1","slug":"partially-shuffling-the-training-data-to-1","title":"Partially Shuffling the Training Data to Improve Language Models","date":"2019-03-11","arxiv_id":"1903.04167","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/language-models-are-unsupervised-multitask","slug":"language-models-are-unsupervised-multitask","title":"Language Models are Unsupervised Multitask Learners","date":"2019-02-14","arxiv_id":null,"rows_on_this_dataset":1,"code_links":21,"syntology":null},{"paper":"/paper/transformer-xl-attentive-language-models","slug":"transformer-xl-attentive-language-models","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","date":"2019-01-09","arxiv_id":"1901.02860","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":143,"samples_ran":67,"samples_constructed":37,"samples_ran_checked":49,"samples_ran_instrument_failed":18,"samples_unverified":76,"pointer_only_for_licence":43,"official":{"repos":["kimiyoung/transformer-xl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformer-xl-attentive-language-models#ran","syntology_url":"https://syntology.ai/paper/1901.02860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02860"}}}},{"paper":"/paper/learning-better-internal-structure-of-words","slug":"learning-better-internal-structure-of-words","title":"Learning Better Internal Structure of Words for Sequence Labeling","date":"2018-10-29","arxiv_id":"1810.12443","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/trellis-networks-for-sequence-modeling","slug":"trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","arxiv_id":"1810.06682","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["locuslab/trellisnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/trellis-networks-for-sequence-modeling#ran","syntology_url":"https://syntology.ai/paper/1810.06682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06682"}}}},{"paper":"/paper/semi-supervised-sequence-modeling-with-cross","slug":"semi-supervised-sequence-modeling-with-cross","title":"Semi-Supervised Sequence Modeling with Cross-View Training","date":"2018-09-22","arxiv_id":"1809.08370","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/direct-output-connection-for-a-high-rank","slug":"direct-output-connection-for-a-high-rank","title":"Direct Output Connection for a High-Rank Language Model","date":"2018-08-30","arxiv_id":"1808.10143","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/improved-language-modeling-by-decoding-the","slug":"improved-language-modeling-by-decoding-the","title":"Improved Language Modeling by Decoding the Past","date":"2018-08-14","arxiv_id":"1808.05908","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/contextual-string-embeddings-for-sequence","slug":"contextual-string-embeddings-for-sequence","title":"Contextual String Embeddings for Sequence Labeling","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-improved-neural-network-model-for-joint","slug":"an-improved-neural-network-model-for-joint","title":"An improved neural network model for joint POS tagging and dependency parsing","date":"2018-07-11","arxiv_id":"1807.03955","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-empirical-study-of-building-a-strong","slug":"an-empirical-study-of-building-a-strong","title":"An Empirical Study of Building a Strong Baseline for Constituency Parsing","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","rows_on_this_dataset":1,"code_links":59,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":156,"samples_ran":74,"samples_constructed":30,"samples_ran_checked":59,"samples_ran_instrument_failed":15,"samples_unverified":82,"pointer_only_for_licence":54,"official":{"repos":["quark0/darts"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}}}},{"paper":"/paper/ncrf-an-open-source-neural-sequence-labeling","slug":"ncrf-an-open-source-neural-sequence-labeling","title":"NCRF++: An Open-source Neural Sequence Labeling Toolkit","date":"2018-06-14","arxiv_id":"1806.05626","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiesutd/NCRFpp"],"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/ncrf-an-open-source-neural-sequence-labeling#ran","syntology_url":"https://syntology.ai/paper/1806.05626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05626"}}}},{"paper":"/paper/pushing-the-bounds-of-dropout","slug":"pushing-the-bounds-of-dropout","title":"Pushing the bounds of dropout","date":"2018-05-23","arxiv_id":"1805.09208","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/morphosyntactic-tagging-with-a-meta-bilstm","slug":"morphosyntactic-tagging-with-a-meta-bilstm","title":"Morphosyntactic Tagging with a Meta-BiLSTM Model over Context Sensitive Token Encodings","date":"2018-05-21","arxiv_id":"1805.08237","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/sentence-state-lstm-for-text-representation","slug":"sentence-state-lstm-for-text-representation","title":"Sentence-State LSTM for Text Representation","date":"2018-05-07","arxiv_id":"1805.02474","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sentence-state-lstm-for-text-representation#ran","syntology_url":"https://syntology.ai/paper/1805.02474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.02474"}}}},{"paper":"/paper/stack-pointer-networks-for-dependency-parsing","slug":"stack-pointer-networks-for-dependency-parsing","title":"Stack-Pointer Networks for Dependency Parsing","date":"2018-05-03","arxiv_id":"1805.01087","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/constituency-parsing-with-a-self-attentive","slug":"constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","arxiv_id":"1805.01052","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["nikitakit/self-attentive-parser"],"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/constituency-parsing-with-a-self-attentive#ran","syntology_url":"https://syntology.ai/paper/1805.01052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01052"}}}},{"paper":"/paper/an-analysis-of-neural-language-modeling-at","slug":"an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","arxiv_id":"1803.08240","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["salesforce/awd-lstm-lm"],"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/an-analysis-of-neural-language-modeling-at#ran","syntology_url":"https://syntology.ai/paper/1803.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08240"}}}},{"paper":"/paper/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","rows_on_this_dataset":1,"code_links":11,"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":1,"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"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/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}}}},{"paper":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","rows_on_this_dataset":3,"code_links":35,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["locuslab/TCN"],"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/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}}}},{"paper":"/paper/efficient-neural-architecture-search-via-1","slug":"efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","arxiv_id":"1802.03268","rows_on_this_dataset":1,"code_links":28,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":38,"samples_ran":18,"samples_constructed":10,"samples_ran_checked":12,"samples_ran_instrument_failed":6,"samples_unverified":20,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-neural-architecture-search-via-1#ran","syntology_url":"https://syntology.ai/paper/1802.03268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03268"}}}},{"paper":"/paper/robust-multilingual-part-of-speech-tagging","slug":"robust-multilingual-part-of-speech-tagging","title":"Robust Multilingual Part-of-Speech Tagging via Adversarial Training","date":"2017-11-14","arxiv_id":"1711.04903","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","slug":"breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","arxiv_id":"1711.03953","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":1,"official":{"repos":["zihangdai/mos"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/breaking-the-softmax-bottleneck-a-high-rank#ran","syntology_url":"https://syntology.ai/paper/1711.03953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03953"}}}},{"paper":"/paper/fraternal-dropout","slug":"fraternal-dropout","title":"Fraternal Dropout","date":"2017-10-31","arxiv_id":"1711.00066","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dynamic-evaluation-of-neural-sequence-models","slug":"dynamic-evaluation-of-neural-sequence-models","title":"Dynamic Evaluation of Neural Sequence Models","date":"2017-09-21","arxiv_id":"1709.07432","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":0,"official":{"repos":["benkrause/dynamic-evaluation"],"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/dynamic-evaluation-of-neural-sequence-models#ran","syntology_url":"https://syntology.ai/paper/1709.07432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07432"}}}},{"paper":"/paper/empower-sequence-labeling-with-task-aware","slug":"empower-sequence-labeling-with-task-aware","title":"Empower Sequence Labeling with Task-Aware Neural Language Model","date":"2017-09-13","arxiv_id":"1709.04109","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/gradual-learning-of-recurrent-neural-networks","slug":"gradual-learning-of-recurrent-neural-networks","title":"Gradual Learning of Recurrent Neural Networks","date":"2017-08-29","arxiv_id":"1708.08863","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/regularizing-and-optimizing-lstm-language","slug":"regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","arxiv_id":"1708.02182","rows_on_this_dataset":2,"code_links":45,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["salesforce/awd-lstm-lm"],"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/regularizing-and-optimizing-lstm-language#ran","syntology_url":"https://syntology.ai/paper/1708.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02182"}}}},{"paper":"/paper/in-order-transition-based-constituent-parsing","slug":"in-order-transition-based-constituent-parsing","title":"In-Order Transition-based Constituent Parsing","date":"2017-07-17","arxiv_id":"1707.05000","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/improving-neural-parsing-by-disentangling","slug":"improving-neural-parsing-by-disentangling","title":"Improving Neural Parsing by Disentangling Model Combination and Reranking Effects","date":"2017-07-10","arxiv_id":"1707.03058","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","rows_on_this_dataset":1,"code_links":595,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":946,"samples_ran":610,"samples_constructed":293,"samples_ran_checked":529,"samples_ran_instrument_failed":81,"samples_unverified":336,"pointer_only_for_licence":451,"official":{"repos":["tensorflow/tensor2tensor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"paper":"/paper/fast-slow-recurrent-neural-networks","slug":"fast-slow-recurrent-neural-networks","title":"Fast-Slow Recurrent Neural Networks","date":"2017-05-24","arxiv_id":"1705.08639","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/semi-supervised-multitask-learning-for","slug":"semi-supervised-multitask-learning-for","title":"Semi-supervised Multitask Learning for Sequence Labeling","date":"2017-04-24","arxiv_id":"1704.07156","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/transfer-learning-for-sequence-tagging-with","slug":"transfer-learning-for-sequence-tagging-with","title":"Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks","date":"2017-03-18","arxiv_id":"1703.06345","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["kimiyoung/transfer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transfer-learning-for-sequence-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1703.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06345"}}}},{"paper":"/paper/what-do-recurrent-neural-network-grammars","slug":"what-do-recurrent-neural-network-grammars","title":"What Do Recurrent Neural Network Grammars Learn About Syntax?","date":"2016-11-17","arxiv_id":"1611.05774","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/attending-to-characters-in-neural-sequence","slug":"attending-to-characters-in-neural-sequence","title":"Attending to Characters in Neural Sequence Labeling Models","date":"2016-11-14","arxiv_id":"1611.04361","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-biaffine-attention-for-neural-dependency","slug":"deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","arxiv_id":"1611.01734","rows_on_this_dataset":2,"code_links":26,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-biaffine-attention-for-neural-dependency#ran","syntology_url":"https://syntology.ai/paper/1611.01734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01734"}}}},{"paper":"/paper/a-joint-many-task-model-growing-a-neural","slug":"a-joint-many-task-model-growing-a-neural","title":"A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks","date":"2016-11-05","arxiv_id":"1611.01587","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["hassyGo/charNgram2vec"],"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/a-joint-many-task-model-growing-a-neural#ran","syntology_url":"https://syntology.ai/paper/1611.01587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01587"}}}},{"paper":"/paper/neural-architecture-search-with-reinforcement","slug":"neural-architecture-search-with-reinforcement","title":"Neural Architecture Search with Reinforcement Learning","date":"2016-11-05","arxiv_id":"1611.01578","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["tensorflow/models"],"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/neural-architecture-search-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1611.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01578"}}}},{"paper":"/paper/tying-word-vectors-and-word-classifiers-a","slug":"tying-word-vectors-and-word-classifiers-a","title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling","date":"2016-11-04","arxiv_id":"1611.01462","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/parsing-as-language-modeling","slug":"parsing-as-language-modeling","title":"Parsing as Language Modeling","date":"2016-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hypernetworks#ran","syntology_url":"https://syntology.ai/paper/1609.09106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09106"}}}},{"paper":"/paper/distilling-an-ensemble-of-greedy-dependency","slug":"distilling-an-ensemble-of-greedy-dependency","title":"Distilling an Ensemble of Greedy Dependency Parsers into One MST Parser","date":"2016-09-24","arxiv_id":"1609.07561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-multi-task-learning-with-low-level-tasks","slug":"deep-multi-task-learning-with-low-level-tasks","title":"Deep multi-task learning with low level tasks supervised at lower layers","date":"2016-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-highway-networks#ran","syntology_url":"https://syntology.ai/paper/1607.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03474"}}}},{"paper":"/paper/supertagging-with-lstms","slug":"supertagging-with-lstms","title":"Supertagging With LSTMs","date":"2016-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/multilingual-part-of-speech-tagging-with","slug":"multilingual-part-of-speech-tagging-with","title":"Multilingual Part-of-Speech Tagging with Bidirectional Long Short-Term Memory Models and Auxiliary Loss","date":"2016-04-19","arxiv_id":"1604.05529","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["bplank/bilstm-aux"],"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/multilingual-part-of-speech-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1604.05529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.05529"}}}},{"paper":"/paper/globally-normalized-transition-based-neural","slug":"globally-normalized-transition-based-neural","title":"Globally Normalized Transition-Based Neural Networks","date":"2016-03-19","arxiv_id":"1603.06042","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-accurate-dependency-parsing-using","slug":"simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","arxiv_id":"1603.04351","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["elikip/bist-parser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-accurate-dependency-parsing-using#ran","syntology_url":"https://syntology.ai/paper/1603.04351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.04351"}}}},{"paper":"/paper/training-with-exploration-improves-a-greedy","slug":"training-with-exploration-improves-a-greedy","title":"Training with Exploration Improves a Greedy Stack-LSTM Parser","date":"2016-03-11","arxiv_id":"1603.03793","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":24,"samples_constructed":0,"samples_ran_checked":22,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-sequence-labeling-via-bi#ran","syntology_url":"https://syntology.ai/paper/1603.01354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01354"}}}},{"paper":"/paper/recurrent-neural-network-grammars","slug":"recurrent-neural-network-grammars","title":"Recurrent Neural Network Grammars","date":"2016-02-25","arxiv_id":"1602.07776","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["clab/rnng"],"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/recurrent-neural-network-grammars#ran","syntology_url":"https://syntology.ai/paper/1602.07776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07776"}}}},{"paper":"/paper/a-theoretically-grounded-application-of","slug":"a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","arxiv_id":"1512.05287","rows_on_this_dataset":2,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"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/a-theoretically-grounded-application-of#ran","syntology_url":"https://syntology.ai/paper/1512.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.05287"}}}},{"paper":"/paper/syntactic-parse-fusion","slug":"syntactic-parse-fusion","title":"Syntactic Parse Fusion","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"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/bidirectional-lstm-crf-models-for-sequence#ran","syntology_url":"https://syntology.ai/paper/1508.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01991"}}}},{"paper":"/paper/finding-function-in-form-compositional-1","slug":"finding-function-in-form-compositional-1","title":"Finding Function in Form: Compositional Character Models for Open Vocabulary Word Representation","date":"2015-08-09","arxiv_id":"1508.02096","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/structured-training-for-neural-network","slug":"structured-training-for-neural-network","title":"Structured Training for Neural Network Transition-Based Parsing","date":"2015-06-19","arxiv_id":"1506.06158","rows_on_this_dataset":1,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/error-diversity-matters-an-error-resistant","slug":"error-diversity-matters-an-error-resistant","title":"Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing","date":"2024-12-16","arxiv_id":"2412.11543","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/advancing-state-of-the-art-in-language","slug":"advancing-state-of-the-art-in-language","title":"Advancing State of the Art in Language Modeling","date":"2023-11-28","arxiv_id":"2312.03735","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/enhancing-structure-aware-encoder-with","slug":"enhancing-structure-aware-encoder-with","title":"Enhancing Structure-aware Encoder with Extremely Limited Data for Graph-based Dependency Parsing","date":"2022-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sequence-alignment-ensemble-with-a-single","slug":"sequence-alignment-ensemble-with-a-single","title":"Sequence Alignment Ensemble with a Single Neural Network for Sequence Labeling","date":"2022-07-07","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/sequential-alignment-methods-for-ensemble","slug":"sequential-alignment-methods-for-ensemble","title":"Sequential Alignment Methods for Ensemble Part-of-Speech Tagging","date":"2022-03-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/investigating-non-local-features-for-neural","slug":"investigating-non-local-features-for-neural","title":"Investigating Non-local Features for Neural Constituency Parsing","date":"2021-09-27","arxiv_id":"2109.12814","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/zero-shot-information-extraction-as-a-unified","slug":"zero-shot-information-extraction-as-a-unified","title":"Zero-Shot Information Extraction as a Unified Text-to-Triple Translation","date":"2021-09-23","arxiv_id":"2109.11171","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/n-ary-constituent-tree-parsing-with-recursive","slug":"n-ary-constituent-tree-parsing-with-recursive","title":"N-ary Constituent Tree Parsing with Recursive Semi-Markov Model","date":"2021-07-26","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/autodropout-learning-dropout-patterns-to","slug":"autodropout-learning-dropout-patterns-to","title":"AutoDropout: Learning Dropout Patterns to Regularize Deep Networks","date":"2021-01-05","arxiv_id":"2101.01761","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-associative-inference-using-fast-1","slug":"learning-associative-inference-using-fast-1","title":"Learning Associative Inference Using Fast Weight Memory","date":"2020-11-16","arxiv_id":"2011.07831","rows_on_this_dataset":1,"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":["ischlag/Fast-Weight-Memory-public"],"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/learning-associative-inference-using-fast-1#ran","syntology_url":"https://syntology.ai/paper/2011.07831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07831"}}}},{"paper":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}}}},{"paper":"/paper/improving-constituency-parsing-with-span","slug":"improving-constituency-parsing-with-span","title":"Improving Constituency Parsing with Span Attention","date":"2020-10-15","arxiv_id":"2010.07543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cuhksz-nlp/SAPar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-constituency-parsing-with-span#ran","syntology_url":"https://syntology.ai/paper/2010.07543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07543"}}}},{"paper":"/paper/automated-concatenation-of-embeddings-for-1","slug":"automated-concatenation-of-embeddings-for-1","title":"Automated Concatenation of Embeddings for Structured Prediction","date":"2020-10-10","arxiv_id":"2010.05006","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/second-order-neural-dependency-parsing-with","slug":"second-order-neural-dependency-parsing-with","title":"Second-Order Neural Dependency Parsing with Message Passing and End-to-End Training","date":"2020-10-10","arxiv_id":"2010.05003","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fast-and-accurate-neural-crf-constituency-1","slug":"fast-and-accurate-neural-crf-constituency-1","title":"Fast and Accurate Neural CRF Constituency Parsing","date":"2020-08-09","arxiv_id":"2008.03736","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-and-accurate-neural-crf-constituency-1#ran","syntology_url":"https://syntology.ai/paper/2008.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03736"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"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/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/efficient-second-order-treecrf-for-neural","slug":"efficient-second-order-treecrf-for-neural","title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","date":"2020-05-03","arxiv_id":"2005.00975","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-second-order-treecrf-for-neural#ran","syntology_url":"https://syntology.ai/paper/2005.00975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00975"}}}},{"paper":"/paper/recursive-non-autoregressive-graph-to-graph","slug":"recursive-non-autoregressive-graph-to-graph","title":"Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement","date":"2020-03-29","arxiv_id":"2003.13118","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/accessing-higher-level-representations-in","slug":"accessing-higher-level-representations-in","title":"Addressing Some Limitations of Transformers with Feedback Memory","date":"2020-02-21","arxiv_id":"2002.09402","rows_on_this_dataset":1,"code_links":4,"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":["facebookresearch/transformer-sequential"],"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/accessing-higher-level-representations-in#ran","syntology_url":"https://syntology.ai/paper/2002.09402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09402"}}}},{"paper":"/paper/recurrent-highway-networks-with-grouped","slug":"recurrent-highway-networks-with-grouped","title":"Recurrent Highway Networks with Grouped Auxiliary Memory","date":"2019-12-13","arxiv_id":null,"rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/domain-independent-dominance-of-adaptive-1","slug":"domain-independent-dominance-of-adaptive-1","title":"Domain-independent Dominance of Adaptive Methods","date":"2019-12-04","arxiv_id":"1912.01823","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/gating-revisited-deep-multi-layer-rnns-that-1","slug":"gating-revisited-deep-multi-layer-rnns-that-1","title":"Gating Revisited: Deep Multi-layer RNNs That Can Be Trained","date":"2019-11-25","arxiv_id":"1911.11033","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","slug":"seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","arxiv_id":"1911.06393","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["f90/Seq-U-Net"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for#ran","syntology_url":"https://syntology.ai/paper/1911.06393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06393"}}}},{"paper":"/paper/generalizing-natural-language-analysis-1","slug":"generalizing-natural-language-analysis-1","title":"Generalizing Natural Language Analysis through Span-relation Representations","date":"2019-11-10","arxiv_id":"1911.03822","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/rethinking-self-attention-an-interpretable","slug":"rethinking-self-attention-an-interpretable","title":"Rethinking Self-Attention: Towards Interpretability in Neural Parsing","date":"2019-11-10","arxiv_id":"1911.03875","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["KhalilMrini/LAL-Parser"],"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/rethinking-self-attention-an-interpretable#ran","syntology_url":"https://syntology.ai/paper/1911.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03875"}}}},{"paper":"/paper/deep-independently-recurrent-neural-network","slug":"deep-independently-recurrent-neural-network","title":"Deep Independently Recurrent Neural Network (IndRNN)","date":"2019-10-11","arxiv_id":"1910.06251","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/mogrifier-lstm","slug":"mogrifier-lstm","title":"Mogrifier LSTM","date":"2019-09-04","arxiv_id":"1909.01792","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/deep-equilibrium-models","slug":"deep-equilibrium-models","title":"Deep Equilibrium Models","date":"2019-09-03","arxiv_id":"1909.01377","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["locuslab/deq"],"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/deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/1909.01377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01377"}}}},{"paper":"/paper/hierarchically-refined-label-attention","slug":"hierarchically-refined-label-attention","title":"Hierarchically-Refined Label Attention Network for Sequence Labeling","date":"2019-08-23","arxiv_id":"1908.08676","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["DSE-MSU/R-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}}}},{"paper":"/paper/head-driven-phrase-structure-grammar-parsing","slug":"head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","arxiv_id":"1907.02684","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["DoodleJZ/HPSG-Neural-Parser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/head-driven-phrase-structure-grammar-parsing#ran","syntology_url":"https://syntology.ai/paper/1907.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02684"}}}},{"paper":"/paper/graph-based-dependency-parsing-with-graph","slug":"graph-based-dependency-parsing-with-graph","title":"Graph-based Dependency Parsing with Graph Neural Networks","date":"2019-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-neural-language-modeling-via","slug":"improving-neural-language-modeling-via","title":"Improving Neural Language Modeling via Adversarial Training","date":"2019-06-10","arxiv_id":"1906.03805","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discrete-flows-invertible-generative-models","slug":"discrete-flows-invertible-generative-models","title":"Discrete Flows: Invertible Generative Models of Discrete Data","date":"2019-05-24","arxiv_id":"1905.10347","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/deep-residual-output-layers-for-neural","slug":"deep-residual-output-layers-for-neural","title":"Deep Residual Output Layers for Neural Language Generation","date":"2019-05-14","arxiv_id":"1905.05513","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/tetra-tagging-word-synchronous-parsing-with","slug":"tetra-tagging-word-synchronous-parsing-with","title":"Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference","date":"2019-04-22","arxiv_id":"1904.09745","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/190409408","slug":"190409408","title":"Language Models with Transformers","date":"2019-04-20","arxiv_id":"1904.09408","rows_on_this_dataset":1,"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":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["cgraywang/gluon-nlp-1"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190409408#ran","syntology_url":"https://syntology.ai/paper/1904.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09408"}}}},{"paper":"/paper/left-to-right-dependency-parsing-with-pointer","slug":"left-to-right-dependency-parsing-with-pointer","title":"Left-to-Right Dependency Parsing with Pointer Networks","date":"2019-03-20","arxiv_id":"1903.08445","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"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/partially-shuffling-the-training-data-to-1","slug":"partially-shuffling-the-training-data-to-1","title":"Partially Shuffling the Training Data to Improve Language Models","date":"2019-03-11","arxiv_id":"1903.04167","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/language-models-are-unsupervised-multitask","slug":"language-models-are-unsupervised-multitask","title":"Language Models are Unsupervised Multitask Learners","date":"2019-02-14","arxiv_id":null,"rows_on_this_dataset":1,"code_links":21,"syntology":null},{"paper":"/paper/transformer-xl-attentive-language-models","slug":"transformer-xl-attentive-language-models","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","date":"2019-01-09","arxiv_id":"1901.02860","rows_on_this_dataset":1,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":143,"samples_ran":67,"samples_constructed":37,"samples_ran_checked":49,"samples_ran_instrument_failed":18,"samples_unverified":76,"pointer_only_for_licence":43,"official":{"repos":["kimiyoung/transformer-xl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformer-xl-attentive-language-models#ran","syntology_url":"https://syntology.ai/paper/1901.02860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02860"}}}},{"paper":"/paper/learning-better-internal-structure-of-words","slug":"learning-better-internal-structure-of-words","title":"Learning Better Internal Structure of Words for Sequence Labeling","date":"2018-10-29","arxiv_id":"1810.12443","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/trellis-networks-for-sequence-modeling","slug":"trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","arxiv_id":"1810.06682","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["locuslab/trellisnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/trellis-networks-for-sequence-modeling#ran","syntology_url":"https://syntology.ai/paper/1810.06682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06682"}}}},{"paper":"/paper/semi-supervised-sequence-modeling-with-cross","slug":"semi-supervised-sequence-modeling-with-cross","title":"Semi-Supervised Sequence Modeling with Cross-View Training","date":"2018-09-22","arxiv_id":"1809.08370","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/direct-output-connection-for-a-high-rank","slug":"direct-output-connection-for-a-high-rank","title":"Direct Output Connection for a High-Rank Language Model","date":"2018-08-30","arxiv_id":"1808.10143","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/improved-language-modeling-by-decoding-the","slug":"improved-language-modeling-by-decoding-the","title":"Improved Language Modeling by Decoding the Past","date":"2018-08-14","arxiv_id":"1808.05908","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/contextual-string-embeddings-for-sequence","slug":"contextual-string-embeddings-for-sequence","title":"Contextual String Embeddings for Sequence Labeling","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-improved-neural-network-model-for-joint","slug":"an-improved-neural-network-model-for-joint","title":"An improved neural network model for joint POS tagging and dependency parsing","date":"2018-07-11","arxiv_id":"1807.03955","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-empirical-study-of-building-a-strong","slug":"an-empirical-study-of-building-a-strong","title":"An Empirical Study of Building a Strong Baseline for Constituency Parsing","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","rows_on_this_dataset":1,"code_links":59,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":156,"samples_ran":74,"samples_constructed":30,"samples_ran_checked":59,"samples_ran_instrument_failed":15,"samples_unverified":82,"pointer_only_for_licence":54,"official":{"repos":["quark0/darts"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}}}},{"paper":"/paper/ncrf-an-open-source-neural-sequence-labeling","slug":"ncrf-an-open-source-neural-sequence-labeling","title":"NCRF++: An Open-source Neural Sequence Labeling Toolkit","date":"2018-06-14","arxiv_id":"1806.05626","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiesutd/NCRFpp"],"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/ncrf-an-open-source-neural-sequence-labeling#ran","syntology_url":"https://syntology.ai/paper/1806.05626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05626"}}}},{"paper":"/paper/pushing-the-bounds-of-dropout","slug":"pushing-the-bounds-of-dropout","title":"Pushing the bounds of dropout","date":"2018-05-23","arxiv_id":"1805.09208","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/morphosyntactic-tagging-with-a-meta-bilstm","slug":"morphosyntactic-tagging-with-a-meta-bilstm","title":"Morphosyntactic Tagging with a Meta-BiLSTM Model over Context Sensitive Token Encodings","date":"2018-05-21","arxiv_id":"1805.08237","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/sentence-state-lstm-for-text-representation","slug":"sentence-state-lstm-for-text-representation","title":"Sentence-State LSTM for Text Representation","date":"2018-05-07","arxiv_id":"1805.02474","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sentence-state-lstm-for-text-representation#ran","syntology_url":"https://syntology.ai/paper/1805.02474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.02474"}}}},{"paper":"/paper/stack-pointer-networks-for-dependency-parsing","slug":"stack-pointer-networks-for-dependency-parsing","title":"Stack-Pointer Networks for Dependency Parsing","date":"2018-05-03","arxiv_id":"1805.01087","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/constituency-parsing-with-a-self-attentive","slug":"constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","arxiv_id":"1805.01052","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["nikitakit/self-attentive-parser"],"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/constituency-parsing-with-a-self-attentive#ran","syntology_url":"https://syntology.ai/paper/1805.01052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01052"}}}},{"paper":"/paper/an-analysis-of-neural-language-modeling-at","slug":"an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","arxiv_id":"1803.08240","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["salesforce/awd-lstm-lm"],"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/an-analysis-of-neural-language-modeling-at#ran","syntology_url":"https://syntology.ai/paper/1803.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08240"}}}},{"paper":"/paper/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","rows_on_this_dataset":1,"code_links":11,"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":1,"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"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/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}}}},{"paper":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","rows_on_this_dataset":3,"code_links":35,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["locuslab/TCN"],"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/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}}}},{"paper":"/paper/efficient-neural-architecture-search-via-1","slug":"efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","arxiv_id":"1802.03268","rows_on_this_dataset":1,"code_links":28,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":38,"samples_ran":18,"samples_constructed":10,"samples_ran_checked":12,"samples_ran_instrument_failed":6,"samples_unverified":20,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-neural-architecture-search-via-1#ran","syntology_url":"https://syntology.ai/paper/1802.03268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03268"}}}},{"paper":"/paper/robust-multilingual-part-of-speech-tagging","slug":"robust-multilingual-part-of-speech-tagging","title":"Robust Multilingual Part-of-Speech Tagging via Adversarial Training","date":"2017-11-14","arxiv_id":"1711.04903","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","slug":"breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","arxiv_id":"1711.03953","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":1,"official":{"repos":["zihangdai/mos"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/breaking-the-softmax-bottleneck-a-high-rank#ran","syntology_url":"https://syntology.ai/paper/1711.03953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03953"}}}},{"paper":"/paper/fraternal-dropout","slug":"fraternal-dropout","title":"Fraternal Dropout","date":"2017-10-31","arxiv_id":"1711.00066","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dynamic-evaluation-of-neural-sequence-models","slug":"dynamic-evaluation-of-neural-sequence-models","title":"Dynamic Evaluation of Neural Sequence Models","date":"2017-09-21","arxiv_id":"1709.07432","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":0,"official":{"repos":["benkrause/dynamic-evaluation"],"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/dynamic-evaluation-of-neural-sequence-models#ran","syntology_url":"https://syntology.ai/paper/1709.07432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07432"}}}},{"paper":"/paper/empower-sequence-labeling-with-task-aware","slug":"empower-sequence-labeling-with-task-aware","title":"Empower Sequence Labeling with Task-Aware Neural Language Model","date":"2017-09-13","arxiv_id":"1709.04109","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/gradual-learning-of-recurrent-neural-networks","slug":"gradual-learning-of-recurrent-neural-networks","title":"Gradual Learning of Recurrent Neural Networks","date":"2017-08-29","arxiv_id":"1708.08863","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/regularizing-and-optimizing-lstm-language","slug":"regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","arxiv_id":"1708.02182","rows_on_this_dataset":2,"code_links":45,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["salesforce/awd-lstm-lm"],"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/regularizing-and-optimizing-lstm-language#ran","syntology_url":"https://syntology.ai/paper/1708.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02182"}}}},{"paper":"/paper/in-order-transition-based-constituent-parsing","slug":"in-order-transition-based-constituent-parsing","title":"In-Order Transition-based Constituent Parsing","date":"2017-07-17","arxiv_id":"1707.05000","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/improving-neural-parsing-by-disentangling","slug":"improving-neural-parsing-by-disentangling","title":"Improving Neural Parsing by Disentangling Model Combination and Reranking Effects","date":"2017-07-10","arxiv_id":"1707.03058","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","rows_on_this_dataset":1,"code_links":595,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":946,"samples_ran":610,"samples_constructed":293,"samples_ran_checked":529,"samples_ran_instrument_failed":81,"samples_unverified":336,"pointer_only_for_licence":451,"official":{"repos":["tensorflow/tensor2tensor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"paper":"/paper/fast-slow-recurrent-neural-networks","slug":"fast-slow-recurrent-neural-networks","title":"Fast-Slow Recurrent Neural Networks","date":"2017-05-24","arxiv_id":"1705.08639","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/semi-supervised-multitask-learning-for","slug":"semi-supervised-multitask-learning-for","title":"Semi-supervised Multitask Learning for Sequence Labeling","date":"2017-04-24","arxiv_id":"1704.07156","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/transfer-learning-for-sequence-tagging-with","slug":"transfer-learning-for-sequence-tagging-with","title":"Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks","date":"2017-03-18","arxiv_id":"1703.06345","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["kimiyoung/transfer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transfer-learning-for-sequence-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1703.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06345"}}}},{"paper":"/paper/what-do-recurrent-neural-network-grammars","slug":"what-do-recurrent-neural-network-grammars","title":"What Do Recurrent Neural Network Grammars Learn About Syntax?","date":"2016-11-17","arxiv_id":"1611.05774","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/attending-to-characters-in-neural-sequence","slug":"attending-to-characters-in-neural-sequence","title":"Attending to Characters in Neural Sequence Labeling Models","date":"2016-11-14","arxiv_id":"1611.04361","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/deep-biaffine-attention-for-neural-dependency","slug":"deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","arxiv_id":"1611.01734","rows_on_this_dataset":2,"code_links":26,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-biaffine-attention-for-neural-dependency#ran","syntology_url":"https://syntology.ai/paper/1611.01734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01734"}}}},{"paper":"/paper/a-joint-many-task-model-growing-a-neural","slug":"a-joint-many-task-model-growing-a-neural","title":"A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks","date":"2016-11-05","arxiv_id":"1611.01587","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["hassyGo/charNgram2vec"],"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/a-joint-many-task-model-growing-a-neural#ran","syntology_url":"https://syntology.ai/paper/1611.01587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01587"}}}},{"paper":"/paper/neural-architecture-search-with-reinforcement","slug":"neural-architecture-search-with-reinforcement","title":"Neural Architecture Search with Reinforcement Learning","date":"2016-11-05","arxiv_id":"1611.01578","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["tensorflow/models"],"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/neural-architecture-search-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1611.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01578"}}}},{"paper":"/paper/tying-word-vectors-and-word-classifiers-a","slug":"tying-word-vectors-and-word-classifiers-a","title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling","date":"2016-11-04","arxiv_id":"1611.01462","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/parsing-as-language-modeling","slug":"parsing-as-language-modeling","title":"Parsing as Language Modeling","date":"2016-11-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hypernetworks#ran","syntology_url":"https://syntology.ai/paper/1609.09106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09106"}}}},{"paper":"/paper/distilling-an-ensemble-of-greedy-dependency","slug":"distilling-an-ensemble-of-greedy-dependency","title":"Distilling an Ensemble of Greedy Dependency Parsers into One MST Parser","date":"2016-09-24","arxiv_id":"1609.07561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-multi-task-learning-with-low-level-tasks","slug":"deep-multi-task-learning-with-low-level-tasks","title":"Deep multi-task learning with low level tasks supervised at lower layers","date":"2016-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-highway-networks#ran","syntology_url":"https://syntology.ai/paper/1607.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03474"}}}},{"paper":"/paper/supertagging-with-lstms","slug":"supertagging-with-lstms","title":"Supertagging With LSTMs","date":"2016-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/multilingual-part-of-speech-tagging-with","slug":"multilingual-part-of-speech-tagging-with","title":"Multilingual Part-of-Speech Tagging with Bidirectional Long Short-Term Memory Models and Auxiliary Loss","date":"2016-04-19","arxiv_id":"1604.05529","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["bplank/bilstm-aux"],"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/multilingual-part-of-speech-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1604.05529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.05529"}}}},{"paper":"/paper/globally-normalized-transition-based-neural","slug":"globally-normalized-transition-based-neural","title":"Globally Normalized Transition-Based Neural Networks","date":"2016-03-19","arxiv_id":"1603.06042","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-accurate-dependency-parsing-using","slug":"simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","arxiv_id":"1603.04351","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["elikip/bist-parser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-accurate-dependency-parsing-using#ran","syntology_url":"https://syntology.ai/paper/1603.04351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.04351"}}}},{"paper":"/paper/training-with-exploration-improves-a-greedy","slug":"training-with-exploration-improves-a-greedy","title":"Training with Exploration Improves a Greedy Stack-LSTM Parser","date":"2016-03-11","arxiv_id":"1603.03793","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":24,"samples_constructed":0,"samples_ran_checked":22,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-sequence-labeling-via-bi#ran","syntology_url":"https://syntology.ai/paper/1603.01354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01354"}}}},{"paper":"/paper/recurrent-neural-network-grammars","slug":"recurrent-neural-network-grammars","title":"Recurrent Neural Network Grammars","date":"2016-02-25","arxiv_id":"1602.07776","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["clab/rnng"],"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/recurrent-neural-network-grammars#ran","syntology_url":"https://syntology.ai/paper/1602.07776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07776"}}}},{"paper":"/paper/a-theoretically-grounded-application-of","slug":"a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","arxiv_id":"1512.05287","rows_on_this_dataset":2,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"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/a-theoretically-grounded-application-of#ran","syntology_url":"https://syntology.ai/paper/1512.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.05287"}}}},{"paper":"/paper/syntactic-parse-fusion","slug":"syntactic-parse-fusion","title":"Syntactic Parse Fusion","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"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/bidirectional-lstm-crf-models-for-sequence#ran","syntology_url":"https://syntology.ai/paper/1508.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01991"}}}},{"paper":"/paper/finding-function-in-form-compositional-1","slug":"finding-function-in-form-compositional-1","title":"Finding Function in Form: Compositional Character Models for Open Vocabulary Word Representation","date":"2015-08-09","arxiv_id":"1508.02096","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/structured-training-for-neural-network","slug":"structured-training-for-neural-network","title":"Structured Training for Neural Network Transition-Based Parsing","date":"2015-06-19","arxiv_id":"1506.06158","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unsupervised-dependency-parsing-lets-use","slug":"unsupervised-dependency-parsing-lets-use","title":"Unsupervised Dependency Parsing: Let's Use Supervised Parsers","date":"2015-04-18","arxiv_id":"1504.04666","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/grammar-as-a-foreign-language","slug":"grammar-as-a-foreign-language","title":"Grammar as a Foreign Language","date":"2014-12-23","arxiv_id":"1412.7449","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/grammar-as-a-foreign-language#ran","syntology_url":"https://syntology.ai/paper/1412.7449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.7449"}}}},{"paper":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","rows_on_this_dataset":2,"code_links":21,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["wojzaremba/lstm"],"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/recurrent-neural-network-regularization#ran","syntology_url":"https://syntology.ai/paper/1409.2329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.2329"}}}},{"paper":"/paper/breaking-out-of-local-optima-with-count","slug":"breaking-out-of-local-optima-with-count","title":"Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction","date":"2013-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unsupervised-induction-of-tree-substitution","slug":"unsupervised-induction-of-tree-substitution","title":"Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing","date":"2010-10-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/shared-logistic-normal-distributions-for-soft","slug":"shared-logistic-normal-distributions-for-soft","title":"Shared Logistic Normal Distributions for Soft Parameter Tying in Unsupervised Grammar Induction","date":"2009-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/effective-self-training-for-parsing","slug":"effective-self-training-for-parsing","title":"Effective Self-Training for Parsing","date":"2006-06-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/corpus-based-induction-of-syntactic-structure","slug":"corpus-based-induction-of-syntactic-structure","title":"Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency","date":"2004-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null}],"papers_where_code_ran":41,"papers_where_code_ran_first_page":"/dataset/penn-treebank/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":"archive","page":2,"of":2,"url":"/dataset/penn-treebank/papers/2","json":"/dataset/penn-treebank/papers/2.json","rows":8},{"order":"ran","page":1,"of":1,"url":"/dataset/penn-treebank/papers/ran/1","json":"/dataset/penn-treebank/papers/ran/1.json","rows":41}],"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":42,"samples_harvested":1630,"samples_ran":1031,"samples_constructed":374,"samples_ran_checked":862,"samples_ran_instrument_failed":169,"samples_unverified":599,"pointer_only_for_licence":639,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":41,"papers_with_a_run_with_no_instrument_failure":34,"papers_where_every_run_was_an_instrument_failure":7,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"7e4aaaed3e70d36aeac5aa9cd9973147d7dc0735ef4453124466d64fc6b95739","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}