{"url":"/task/transition-based-dependency-parsing","name":"Transition-Based Dependency Parsing","slug":"transition-based-dependency-parsing","description_markdown":null,"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":"derived"},"counts":{"papers_tagged":66,"papers_with_code":12,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":2},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/dependency-parsing","name":"Dependency Parsing"},{"url":"/task/persian-sentiment-anlysis","name":"Persian Sentiment Analysis"}],"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":12,"of":12,"tagged_in_all":66,"items":[{"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/algorithms-for-weighted-pushdown-automata","title":"Algorithms for Weighted Pushdown Automata","date":"2022-10-13","arxiv_id":"2210.06884","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/graph-to-graph-transformer-for-transition","title":"Graph-to-Graph Transformer for Transition-based Dependency Parsing","date":"2019-11-08","arxiv_id":"1911.03561","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-transition-based-dependency","title":"Bidirectional Transition-Based Dependency Parsing","date":"2019-07-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-learning-of-pos-and-dependencies-for","title":"Joint Learning of POS and Dependencies for Multilingual Universal Dependency Parsing","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tree-stack-lstm-in-transition-based","title":"Tree-Stack LSTM in Transition Based Dependency Parsing","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/distilling-knowledge-for-search-based","title":"Distilling Knowledge for Search-based Structured Prediction","date":"2018-05-29","arxiv_id":"1805.11224","repositories_listed":1,"syntology":null},{"url":"/paper/faster-exact-decoding-and-global-training-for","title":"Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set","date":"2017-08-30","arxiv_id":"1708.09403","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-neural-network-model-for-joint-pos","title":"A Novel Neural Network Model for Joint POS Tagging and Graph-based Dependency Parsing","date":"2017-05-16","arxiv_id":"1705.05952","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-graph-based-dependency-parsing","title":"Probabilistic Graph-based Dependency Parsing with Convolutional Neural Network","date":"2016-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-structured-inference-for-transition","title":"Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States","date":"2016-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/template-kernels-for-dependency-parsing","title":"Template Kernels for Dependency Parsing","date":"2015-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":2,"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"}}