Papers › Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in...

Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction

1 Oct 2013EMNLP 2013 10archive 2025-07-28

Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jurafsky

PaperPDF

Code

No code repository is listed for this paper in the archive or in Syntology's graph.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Dependency Grammar InductionUnsupervised Dependency Parsing

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Unsupervised Dependency Parsing Penn Treebank Combined System UAS 64.4 #3 of 6 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections