Papers › Training with Exploration Improves a Greedy Stack-LSTM Parser
Training with Exploration Improves a Greedy Stack-LSTM Parser
Miguel Ballesteros, Yoav Goldberg, Chris Dyer, Noah A. Smith
We adapt the greedy Stack-LSTM dependency parser of Dyer et al. (2015) to support a training-with-exploration procedure using dynamic oracles(Goldberg and Nivre, 2013) instead of cross-entropy minimization. This form of training, which accounts for model predictions at training time rather than assuming an error-free action history, improves parsing accuracies for both English and Chinese, obtaining very strong results for both languages. We discuss some modifications needed in order to get training with exploration to work well for a probabilistic neural-network.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
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
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Dependency Parsing | Penn Treebank | Arc-hybrid | LAS | 91.42 | #21 of 22 | Archive leaderboard | report |
| Dependency Parsing | Penn Treebank | Arc-hybrid | POS | 97.3 | #21 of 22 | Archive leaderboard | report |
| Dependency Parsing | Penn Treebank | Arc-hybrid | UAS | 93.56 | #21 of 22 | 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