{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/breaking-out-of-local-optima-with-count","title":"Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction","arxiv_id":null,"date":"2013-10-01","proceeding":"EMNLP 2013 10","authors":["Valentin I. Spitkovsky","Hiyan Alshawi","Daniel Jurafsky"],"abstract":"","url_abs":"https://aclanthology.org/D13-1204","url_pdf":"https://aclanthology.org/D13-1204.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"dependency-grammar-induction","task_name":"Dependency Grammar Induction"},{"task_slug":"unsupervised-dependency-parsing","task_name":"Unsupervised Dependency Parsing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/unsupervised-dependency-parsing-on-penn","task":"Unsupervised Dependency Parsing","dataset":"Penn Treebank","model":"Combined System","rank_in_archive_order":3,"of":6,"metrics":{"UAS":"64.4"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}