{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/unsupervised-dependency-parsing","name":"Unsupervised Dependency Parsing","slug":"unsupervised-dependency-parsing","description_markdown":"Unsupervised dependency parsing is the task of inferring the dependency parse of sentences without any labeled training data.\r\n\r\nDescription from [NLP Progress](http://nlpprogress.com/english/dependency_parsing.html)","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":24,"papers_with_code":5,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/unsupervised-dependency-parsing-on-penn","slug":"unsupervised-dependency-parsing-on-penn","dataset":"Penn Treebank","dataset_url":"/dataset/penn-treebank","rows_in_archive":6,"metrics":["UAS"],"first_row_in_archive_order":{"model":"Ensemble (selected w/ society entropy)","paper_title":"Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing","paper_url":"/paper/error-diversity-matters-an-error-resistant","paper_date":"2024-12-16","arxiv_id":"2412.11543","code_links":[{"title":"manga-uofa/ed4udp","url":"https://github.com/manga-uofa/ed4udp"}],"syntology":null}}],"datasets":[{"url":"/dataset/penn-treebank","name":"Penn Treebank","full_name":"","num_papers_in_archive":1006}],"subtasks":[],"parent_tasks":[{"url":"/task/dependency-parsing","name":"Dependency Parsing"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":24,"of":24,"of_with_code":5,"tagged_in_all":24,"counts":{"archive_papers_tagged":24,"with_a_code_link":5,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":24,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/structformer-joint-unsupervised-induction-of-1","slug":"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/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","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-dependency-graph-network-1","slug":"unsupervised-dependency-graph-network-1","title":"Unsupervised Dependency Graph Network","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-of-syntactic-structure","slug":"unsupervised-learning-of-syntactic-structure","title":"Unsupervised Learning of Syntactic Structure with Invertible Neural Projections","date":"2018-08-28","arxiv_id":"1808.09111","repositories_listed":1,"syntology":null},{"url":"/paper/crf-autoencoder-for-unsupervised-dependency","slug":"crf-autoencoder-for-unsupervised-dependency","title":"CRF Autoencoder for Unsupervised Dependency Parsing","date":"2017-08-03","arxiv_id":"1708.01018","repositories_listed":1,"syntology":null},{"url":null,"slug":"unsupervised-dependency-graph-network","title":"Unsupervised Dependency Graph Network","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-unsupervised-dependency-parsing","title":"A Survey of Unsupervised Dependency Parsing","date":"2020-10-04","arxiv_id":"2010.01535","repositories_listed":0,"syntology":null},{"url":"/paper/enhancing-unsupervised-generative-dependency","slug":"enhancing-unsupervised-generative-dependency","title":"Enhancing Unsupervised Generative Dependency Parser with Contextual Information","date":"2019-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-generative-and-discriminative-1","title":"Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition","date":"2017-08-02","arxiv_id":"1708.00790","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-transfer-for-unsupervised","title":"Cross-lingual Transfer for Unsupervised Dependency Parsing Without Parallel Data","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/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","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-dependency-parsing-with","title":"Unsupervised Dependency Parsing with Transferring Distribution via Parallel Guidance and Entropy Regularization","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/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,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stop-probability-estimates-computed-on-a","title":"Stop-probability estimates computed on a large corpus improve Unsupervised Dependency Parsing","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-dependency-parsing-with-acoustic","title":"Unsupervised Dependency Parsing with Acoustic Cues","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-reducibility-in-unsupervised","title":"Exploiting Reducibility in Unsupervised Dependency Parsing","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"concavity-and-initialization-for-unsupervised","title":"Concavity and Initialization for Unsupervised Dependency Parsing","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"turning-the-pipeline-into-a-loop-iterated","title":"Turning the pipeline into a loop: Iterated unsupervised dependency parsing and PoS induction","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-baselines-for-unsupervised-dependency","title":"Two baselines for unsupervised dependency parsing","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-dependency-parsing-using","title":"Unsupervised Dependency Parsing using Reducibility and Fertility features","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-unsupervised-dependency-parsing-with-arc","title":"Fast Unsupervised Dependency Parsing with Arc-Standard Transitions","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/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,"repositories_listed":0,"syntology":null},{"url":"/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,"repositories_listed":0,"syntology":null},{"url":"/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,"repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"af864d25d54aa439f93de72cef6d49bfce587aa4affa7c1fa83faafd3bf37664","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}