{"url":"/task/dependency-parsing","name":"Dependency Parsing","slug":"dependency-parsing","description_markdown":"Dependency parsing is the task of extracting a dependency parse of a sentence that represents its grammatical\nstructure and defines the relationships between \"head\" words and words, which modify those heads.\n\nExample:\n\n```\n     root\n      |\n      | +-------dobj---------+\n      | |                    |\nnsubj | |   +------det-----+ | +-----nmod------+\n+--+  | |   |              | | |               |\n|  |  | |   |      +-nmod-+| | |      +-case-+ |\n+  |  + |   +      +      || + |      +      | |\nI  prefer  the  morning   flight  through  Denver\n```\n\nRelations among the words are illustrated above the sentence with directed, labeled\narcs from heads to dependents (+ indicates the dependent).","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1407,"papers_with_code":338,"benchmarks":16,"benchmark_tables_in_archive":16,"benchmark_tables_shown":16,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":15,"subtasks":5,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/dependency-parsing-on-penn-treebank","slug":"dependency-parsing-on-penn-treebank","dataset":"Penn Treebank","dataset_url":"/dataset/penn-treebank","rows_in_archive":22,"metrics":["LAS","UAS","POS"],"first_row_in_archive_order":{"model":"Label Attention Layer + HPSG + XLNet","paper_title":"Rethinking Self-Attention: Towards Interpretability in Neural Parsing","paper_url":"/paper/rethinking-self-attention-an-interpretable","paper_date":"2019-11-10","arxiv_id":"1911.03875","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"}],"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}}},{"leaderboard":"/sota/dependency-parsing-on-universal-dependencies","slug":"dependency-parsing-on-universal-dependencies","dataset":"Universal Dependencies","dataset_url":"/dataset/universal-dependencies","rows_in_archive":6,"metrics":["LAS","UAS","BLEX"],"first_row_in_archive_order":{"model":"UDPipe 2.0 + mBERT + FLAIR","paper_title":"Evaluating Contextualized Embeddings on 54 Languages in POS Tagging, Lemmatization and Dependency Parsing","paper_url":"/paper/evaluating-contextualized-embeddings-on-54","paper_date":"2019-08-20","arxiv_id":"1908.07448","code_links":[],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-genia-las","slug":"dependency-parsing-on-genia-las","dataset":"GENIA - LAS","dataset_url":"/dataset/genia","rows_in_archive":3,"metrics":["F1"],"first_row_in_archive_order":{"model":"BiLSTM-CRF","paper_title":"From POS tagging to dependency parsing for biomedical event extraction","paper_url":"/paper/from-pos-tagging-to-dependency-parsing-for","paper_date":"2018-08-11","arxiv_id":"1808.03731","code_links":[{"title":"datquocnguyen/BioNLP","url":"https://github.com/datquocnguyen/BioNLP"},{"title":"datquocnguyen/BioPosDep","url":"https://github.com/datquocnguyen/BioPosDep"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-genia-uas","slug":"dependency-parsing-on-genia-uas","dataset":"GENIA - UAS","dataset_url":"/dataset/genia","rows_in_archive":3,"metrics":["F1"],"first_row_in_archive_order":{"model":"BiLSTM-CRF","paper_title":"From POS tagging to dependency parsing for biomedical event extraction","paper_url":"/paper/from-pos-tagging-to-dependency-parsing-for","paper_date":"2018-08-11","arxiv_id":"1808.03731","code_links":[{"title":"datquocnguyen/BioNLP","url":"https://github.com/datquocnguyen/BioNLP"},{"title":"datquocnguyen/BioPosDep","url":"https://github.com/datquocnguyen/BioPosDep"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-tweebank","slug":"dependency-parsing-on-tweebank","dataset":"Tweebank","dataset_url":"/dataset/tweebank","rows_in_archive":3,"metrics":["Labelled Attachment Score","Unlabeled Attachment Score"],"first_row_in_archive_order":{"model":"SuPar-BERTweet","paper_title":"Cross-Dialect Social Media Dependency Parsing for Social Scientific Entity Attribute Analysis","paper_url":"/paper/cross-dialect-social-media-dependency-parsing","paper_date":"","arxiv_id":null,"code_links":[{"title":"slanglab/tweetie_wnut2022","url":"https://github.com/slanglab/tweetie_wnut2022"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-conll-2009","slug":"dependency-parsing-on-conll-2009","dataset":"CoNLL-2009","dataset_url":"/dataset/conll-2009","rows_in_archive":2,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CRFPar","paper_title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","paper_url":"/paper/efficient-second-order-treecrf-for-neural","paper_date":"2020-05-03","arxiv_id":"2005.00975","code_links":[{"title":"yzhangcs/parser","url":"https://github.com/yzhangcs/parser"},{"title":"yzhangcs/crfpar","url":"https://github.com/yzhangcs/crfpar"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}}},{"leaderboard":"/sota/dependency-parsing-on-french-gsd","slug":"dependency-parsing-on-french-gsd","dataset":"French GSD","dataset_url":null,"rows_in_archive":2,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CamemBERT","paper_title":"CamemBERT: a Tasty French Language Model","paper_url":"/paper/camembert-a-tasty-french-language-model","paper_date":"2019-11-10","arxiv_id":"1911.03894","code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"Karthik-Bhaskar/Context-Based-Question-Answering","url":"https://github.com/Karthik-Bhaskar/Context-Based-Question-Answering"},{"title":"anaishoareau/french_preprocessing","url":"https://github.com/anaishoareau/french_preprocessing"},{"title":"bourrel/French-News-Clustering","url":"https://github.com/bourrel/French-News-Clustering"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/camembert"},{"title":"hbaflast/bert-sentiment-analysis-pytorch","url":"https://github.com/hbaflast/bert-sentiment-analysis-pytorch"},{"title":"hbaflast/bert-sentiment-analysis-tensorflow","url":"https://github.com/hbaflast/bert-sentiment-analysis-tensorflow"},{"title":"pwc-1/Paper-8","url":"https://github.com/pwc-1/Paper-8/tree/main/camembert"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-partut","slug":"dependency-parsing-on-partut","dataset":"ParTUT","dataset_url":null,"rows_in_archive":2,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CamemBERT","paper_title":"CamemBERT: a Tasty French Language Model","paper_url":"/paper/camembert-a-tasty-french-language-model","paper_date":"2019-11-10","arxiv_id":"1911.03894","code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"Karthik-Bhaskar/Context-Based-Question-Answering","url":"https://github.com/Karthik-Bhaskar/Context-Based-Question-Answering"},{"title":"anaishoareau/french_preprocessing","url":"https://github.com/anaishoareau/french_preprocessing"},{"title":"bourrel/French-News-Clustering","url":"https://github.com/bourrel/French-News-Clustering"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/camembert"},{"title":"hbaflast/bert-sentiment-analysis-pytorch","url":"https://github.com/hbaflast/bert-sentiment-analysis-pytorch"},{"title":"hbaflast/bert-sentiment-analysis-tensorflow","url":"https://github.com/hbaflast/bert-sentiment-analysis-tensorflow"},{"title":"pwc-1/Paper-8","url":"https://github.com/pwc-1/Paper-8/tree/main/camembert"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-sequoia-treebank","slug":"dependency-parsing-on-sequoia-treebank","dataset":"Sequoia Treebank","dataset_url":null,"rows_in_archive":2,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CamemBERT","paper_title":"CamemBERT: a Tasty French Language Model","paper_url":"/paper/camembert-a-tasty-french-language-model","paper_date":"2019-11-10","arxiv_id":"1911.03894","code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"Karthik-Bhaskar/Context-Based-Question-Answering","url":"https://github.com/Karthik-Bhaskar/Context-Based-Question-Answering"},{"title":"anaishoareau/french_preprocessing","url":"https://github.com/anaishoareau/french_preprocessing"},{"title":"bourrel/French-News-Clustering","url":"https://github.com/bourrel/French-News-Clustering"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/camembert"},{"title":"hbaflast/bert-sentiment-analysis-pytorch","url":"https://github.com/hbaflast/bert-sentiment-analysis-pytorch"},{"title":"hbaflast/bert-sentiment-analysis-tensorflow","url":"https://github.com/hbaflast/bert-sentiment-analysis-tensorflow"},{"title":"pwc-1/Paper-8","url":"https://github.com/pwc-1/Paper-8/tree/main/camembert"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-spoken-corpus","slug":"dependency-parsing-on-spoken-corpus","dataset":"Spoken Corpus","dataset_url":null,"rows_in_archive":2,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CamemBERT","paper_title":"CamemBERT: a Tasty French Language Model","paper_url":"/paper/camembert-a-tasty-french-language-model","paper_date":"2019-11-10","arxiv_id":"1911.03894","code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"Karthik-Bhaskar/Context-Based-Question-Answering","url":"https://github.com/Karthik-Bhaskar/Context-Based-Question-Answering"},{"title":"anaishoareau/french_preprocessing","url":"https://github.com/anaishoareau/french_preprocessing"},{"title":"bourrel/French-News-Clustering","url":"https://github.com/bourrel/French-News-Clustering"},{"title":"2024-MindSpore-1/Code2","url":"https://github.com/2024-MindSpore-1/Code2/tree/main/model-1/camembert"},{"title":"hbaflast/bert-sentiment-analysis-pytorch","url":"https://github.com/hbaflast/bert-sentiment-analysis-pytorch"},{"title":"hbaflast/bert-sentiment-analysis-tensorflow","url":"https://github.com/hbaflast/bert-sentiment-analysis-tensorflow"},{"title":"pwc-1/Paper-8","url":"https://github.com/pwc-1/Paper-8/tree/main/camembert"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-ud2-5-test","slug":"dependency-parsing-on-ud2-5-test","dataset":"UD2.5 test","dataset_url":null,"rows_in_archive":2,"metrics":["Macro-averaged F1"],"first_row_in_archive_order":{"model":"Trankit","paper_title":"Trankit: A Light-Weight Transformer-based Toolkit for Multilingual Natural Language Processing","paper_url":"/paper/trankit-a-light-weight-transformer-based","paper_date":"2021-01-09","arxiv_id":"2101.03289","code_links":[{"title":"nlp-uoregon/trankit","url":"https://github.com/nlp-uoregon/trankit"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-100stlye-labelled","slug":"dependency-parsing-on-100stlye-labelled","dataset":"100STLYE-Labelled","dataset_url":"/dataset/100stlye-labelled","rows_in_archive":1,"metrics":["10°5 cm"],"first_row_in_archive_order":{"model":"nlp","paper_title":"The CMU METAL Farsi NLP Approach","paper_url":"/paper/the-cmu-metal-farsi-nlp-approach","paper_date":"2014-05-01","arxiv_id":null,"code_links":[{"title":"wfeely/farsiNLPTools","url":"https://github.com/wfeely/farsiNLPTools"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-chinese-treebank","slug":"dependency-parsing-on-chinese-treebank","dataset":"Chinese Treebank","dataset_url":"/dataset/chinese-treebank","rows_in_archive":1,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"MFVI","paper_title":"Second-Order Neural Dependency Parsing with Message Passing and End-to-End Training","paper_url":"/paper/second-order-neural-dependency-parsing-with","paper_date":"2020-10-10","arxiv_id":"2010.05003","code_links":[{"title":"wangxinyu0922/Second_Order_Parsing","url":"https://github.com/wangxinyu0922/Second_Order_Parsing"}],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-dane","slug":"dependency-parsing-on-dane","dataset":"DaNE","dataset_url":"/dataset/dane","rows_in_archive":1,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"da_dacy_large_tft","paper_title":"DaCy: A Unified Framework for Danish NLP","paper_url":"/paper/dacy-a-unified-framework-for-danish-nlp","paper_date":"2021-07-12","arxiv_id":"2107.05295","code_links":[],"syntology":null}},{"leaderboard":"/sota/dependency-parsing-on-nlpcc-2019","slug":"dependency-parsing-on-nlpcc-2019","dataset":"NLPCC-2019","dataset_url":null,"rows_in_archive":1,"metrics":["LAS","UAS"],"first_row_in_archive_order":{"model":"CRFPar","paper_title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","paper_url":"/paper/efficient-second-order-treecrf-for-neural","paper_date":"2020-05-03","arxiv_id":"2005.00975","code_links":[{"title":"yzhangcs/parser","url":"https://github.com/yzhangcs/parser"},{"title":"yzhangcs/crfpar","url":"https://github.com/yzhangcs/crfpar"}],"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}}},{"leaderboard":"/sota/dependency-parsing-on-universal-dependency","slug":"dependency-parsing-on-universal-dependency","dataset":"Universal Dependency Treebank","dataset_url":"/dataset/universal-dependencies","rows_in_archive":1,"metrics":["Macro F1"],"first_row_in_archive_order":{"model":"Stanza","paper_title":"Stanza: A Python Natural Language Processing Toolkit for Many Human Languages","paper_url":"/paper/stanza-a-python-natural-language-processing","paper_date":"2020-03-16","arxiv_id":"2003.07082","code_links":[{"title":"stanfordnlp/stanza","url":"https://github.com/stanfordnlp/stanza"},{"title":"textflint/textflint","url":"https://github.com/textflint/textflint"},{"title":"astrazeneca/kazu","url":"https://github.com/astrazeneca/kazu"},{"title":"sktwtrg/stanza_ja_test","url":"https://github.com/sktwtrg/stanza_ja_test"},{"title":"rasoolims/stanza","url":"https://github.com/rasoolims/stanza"}],"syntology":{"n":30,"n_ran":16,"n_unverified":14,"n_pointer_only":28}}}],"datasets":[{"url":"/dataset/penn-treebank","name":"Penn Treebank","full_name":"","num_papers_in_archive":1006},{"url":"/dataset/universal-dependencies","name":"Universal Dependencies","full_name":"","num_papers_in_archive":520},{"url":"/dataset/conll-1","name":"CoNLL","full_name":"","num_papers_in_archive":187},{"url":"/dataset/genia","name":"GENIA","full_name":"","num_papers_in_archive":121},{"url":"/dataset/english-web-treebank","name":"English Web Treebank","full_name":"English Web Treebank","num_papers_in_archive":42},{"url":"/dataset/klue","name":"KLUE","full_name":"Korean Language Understanding Evaluation","num_papers_in_archive":21},{"url":"/dataset/tweebank","name":"Tweebank","full_name":"","num_papers_in_archive":20},{"url":"/dataset/100stlye-labelled","name":"100STLYE-Labelled","full_name":"","num_papers_in_archive":15},{"url":"/dataset/gum","name":"GUM","full_name":"Georgetown University Multilayer corpus","num_papers_in_archive":13},{"url":"/dataset/conll-2009","name":"CoNLL-2009","full_name":"CoNLL-2009","num_papers_in_archive":8},{"url":"/dataset/dane","name":"DaNE","full_name":"Danish Dependency Treebank","num_papers_in_archive":6},{"url":"/dataset/amalgum","name":"AMALGUM","full_name":"A Machine Annotated Lookalike of GUM","num_papers_in_archive":5},{"url":"/dataset/chinese-treebank","name":"Chinese Treebank","full_name":"","num_papers_in_archive":5},{"url":"/dataset/wili-2018","name":"WiLI-2018","full_name":"","num_papers_in_archive":3},{"url":"/dataset/conll-2017-shared-task-automatically","name":"CoNLL 2017 Shared Task - Automatically Annotated Raw Texts and Word Embeddings","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/cross-lingual-zero-shot-dependency-parsing","name":"Cross-lingual zero-shot dependency parsing"},{"url":"/task/dependency-grammar-induction","name":"Dependency Grammar Induction"},{"url":"/task/prepositional-phrase-attachment","name":"Prepositional Phrase Attachment"},{"url":"/task/transition-based-dependency-parsing","name":"Transition-Based Dependency Parsing"},{"url":"/task/unsupervised-dependency-parsing","name":"Unsupervised Dependency Parsing"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":338,"tagged_in_all":1407,"items":[{"url":"/paper/deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","arxiv_id":"1611.01734","repositories_listed":26,"syntology":{"n":19,"n_ran":3,"n_unverified":16,"n_pointer_only":2}},{"url":"/paper/camembert-a-tasty-french-language-model","title":"CamemBERT: a Tasty French Language Model","date":"2019-11-10","arxiv_id":"1911.03894","repositories_listed":8,"syntology":null},{"url":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","arxiv_id":"1505.08075","repositories_listed":7,"syntology":{"n":14,"n_ran":1,"n_unverified":13,"n_pointer_only":0}},{"url":"/paper/scibert-pretrained-contextualized-embeddings","title":"SciBERT: A Pretrained Language Model for Scientific Text","date":"2019-03-26","arxiv_id":"1903.10676","repositories_listed":6,"syntology":null},{"url":"/paper/stanza-a-python-natural-language-processing","title":"Stanza: A Python Natural Language Processing Toolkit for Many Human Languages","date":"2020-03-16","arxiv_id":"2003.07082","repositories_listed":5,"syntology":{"n":30,"n_ran":16,"n_unverified":14,"n_pointer_only":28}},{"url":"/paper/klue-korean-language-understanding-evaluation","title":"KLUE: Korean Language Understanding Evaluation","date":"2021-05-20","arxiv_id":"2105.09680","repositories_listed":4,"syntology":null},{"url":"/paper/second-order-semantic-dependency-parsing-with","title":"Second-Order Semantic Dependency Parsing with End-to-End Neural Networks","date":"2019-06-19","arxiv_id":"1906.07880","repositories_listed":4,"syntology":null},{"url":"/paper/generalizing-natural-language-analysis-1","title":"Generalizing Natural Language Analysis through Span-relation Representations","date":"2019-11-10","arxiv_id":"1911.03822","repositories_listed":3,"syntology":null},{"url":"/paper/75-languages-1-model-parsing-universal","title":"75 Languages, 1 Model: Parsing Universal Dependencies Universally","date":"2019-04-03","arxiv_id":"1904.02099","repositories_listed":3,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/linspector-multilingual-probing-tasks-for","title":"LINSPECTOR: Multilingual Probing Tasks for Word Representations","date":"2019-03-22","arxiv_id":"1903.09442","repositories_listed":3,"syntology":null},{"url":"/paper/seq2seq-dependency-parsing","title":"Seq2seq Dependency Parsing","date":"2018-08-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/simpler-but-more-accurate-semantic-dependency","title":"Simpler but More Accurate Semantic Dependency Parsing","date":"2018-07-03","arxiv_id":"1807.01396","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/stack-pointer-networks-for-dependency-parsing","title":"Stack-Pointer Networks for Dependency Parsing","date":"2018-05-03","arxiv_id":"1805.01087","repositories_listed":3,"syntology":null},{"url":"/paper/sparsemap-differentiable-sparse-structured","title":"SparseMAP: Differentiable Sparse Structured Inference","date":"2018-02-12","arxiv_id":"1802.04223","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/dissent-sentence-representation-learning-from","title":"DisSent: Sentence Representation Learning from Explicit Discourse Relations","date":"2017-10-12","arxiv_id":"1710.04334","repositories_listed":3,"syntology":null},{"url":"/paper/how-well-do-llms-generate-code-for-different","title":"Top General Performance = Top Domain Performance? DomainCodeBench: A Multi-domain Code Generation Benchmark","date":"2024-12-24","arxiv_id":"2412.18573","repositories_listed":2,"syntology":null},{"url":"/paper/advancing-hungarian-text-processing-with","title":"Advancing Hungarian Text Processing with HuSpaCy: Efficient and Accurate NLP Pipelines","date":"2023-08-24","arxiv_id":"2308.12635","repositories_listed":2,"syntology":null},{"url":"/paper/cqe-a-comprehensive-quantity-extractor","title":"CQE: A Comprehensive Quantity Extractor","date":"2023-05-15","arxiv_id":"2305.08853","repositories_listed":2,"syntology":null},{"url":"/paper/atp-amrize-then-parse-enhancing-amr-parsing","title":"ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs","date":"2022-04-19","arxiv_id":"2204.08875","repositories_listed":2,"syntology":null},{"url":"/paper/systematic-inequalities-in-language","title":"Systematic Inequalities in Language Technology Performance across the World's Languages","date":"2021-10-13","arxiv_id":"2110.06733","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_unverified":4,"n_pointer_only":6}},{"url":"/paper/tent-text-classification-based-on-encoding","title":"Hierarchical information matters: Text classification via tree based graph neural network","date":"2021-10-05","arxiv_id":"2110.02047","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/revisiting-tri-training-of-dependency-parsers","title":"Revisiting Tri-training of Dependency Parsers","date":"2021-09-16","arxiv_id":"2109.08122","repositories_listed":2,"syntology":null},{"url":"/paper/everything-is-all-it-takes-a-multipronged","title":"Everything Is All It Takes: A Multipronged Strategy for Zero-Shot Cross-Lingual Information Extraction","date":"2021-09-14","arxiv_id":"2109.06798","repositories_listed":2,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/dependency-parsing-as-mrc-based-span-span","title":"Dependency Parsing as MRC-based Span-Span Prediction","date":"2021-05-17","arxiv_id":"2105.07654","repositories_listed":2,"syntology":null},{"url":"/paper/thamizhiudp-a-dependency-parser-for-tamil","title":"ThamizhiUDp: A Dependency Parser for Tamil","date":"2020-12-24","arxiv_id":"2012.13436","repositories_listed":2,"syntology":null},{"url":"/paper/structformer-joint-unsupervised-induction-of-1","title":"StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modeling","date":"2020-12-01","arxiv_id":"2012.00857","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-deep-neural-networks-with","title":"Enhancing deep neural networks with morphological information","date":"2020-11-24","arxiv_id":"2011.12432","repositories_listed":2,"syntology":null},{"url":"/paper/graph-based-universal-dependency-parsing-in","title":"Applying Occam's Razor to Transformer-Based Dependency Parsing: What Works, What Doesn't, and What is Really Necessary","date":"2020-10-23","arxiv_id":"2010.12699","repositories_listed":2,"syntology":null},{"url":"/paper/automated-concatenation-of-embeddings-for-1","title":"Automated Concatenation of Embeddings for Structured Prediction","date":"2020-10-10","arxiv_id":"2010.05006","repositories_listed":2,"syntology":null},{"url":"/paper/a-practical-chinese-dependency-parser-based","title":"A Practical Chinese Dependency Parser Based on A Large-scale Dataset","date":"2020-09-02","arxiv_id":"2009.00901","repositories_listed":2,"syntology":null}],"syntology_records":9,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}