The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Improved Non-monotonic Transition System for Dependency Parsing
Open accessAbstract
Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree.Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to "repair" earlier parsing mistakes by "over-writing" earlier parsing decisions.This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the "garden paths" that can trap monotonic greedy transition-based dependency parsers.We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths.A parser with our new nonmonotonic transition system has 91.85% directed attachment accuracy, an improvement of 0.6% over a comparable parser using the standard monotonic arc-eager transitions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast and Accurate Dependency Parser using Neural Networks
Chen, D., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1082 · Cited by 1,795
Frazier, L., & Rayner, K. (1982) · Cognitive Psychology · doi:10.1016/0010-0285(82)90008-1 · Cited by 1,767
Transition-Based Dependency Parsing with Stack Long Short-Term Memory
Dyer, C., Ballesteros, M., Ling, W., Matthews, A., & Smith, N. A. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1033 · Cited by 553
An efficient algorithm for projective dependency parsing
Nivre, J. (2003) · Cited by 475
Efficient Third-Order Dependency Parsers
Koo, T., & Collins, M. (2010) · Cited by 206
Structured Training for Neural Network Transition-Based Parsing
Weiss, D., Alberti, C., Collins, M., & Petrov, S. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1032 · Cited by 180
A Dynamic Oracle for Arc-Eager Dependency Parsing
Goldberg, Y., & Nivre, J. (2012) · International Conference on Computational Linguistics · Cited by 158
It Depends: Dependency Parser Comparison Using A Web-based Evaluation Tool
Choi, J. D., Tetreault, J., & Stent, A. J. (2015) · doi:10.3115/v1/p15-1038 · Cited by 143
Training Deterministic Parsers with Non-Deterministic Oracles
Goldberg, Y., & Nivre, J. (2013) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00237 · Cited by 112
A Non-Monotonic Arc-Eager Transition System for Dependency Parsing
Honnibal, M., Goldberg, Y., & Johnson, M. (2013) · Cited by 36
Self-citation
Cited by
Opportunities and Challenges for Machine Learning in Materials Science
Morgan, D., & Jacobs, R. (2020) · Annual Review of Materials Research · doi:10.1146/annurev-matsci-070218-010015 · Cited by 549
The Impact of Artificial Intelligence on the Labor Market
Webb, M. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3482150 · Cited by 531
Materials Synthesis Insights from Scientific Literature via Text Extraction and Machine Learning
Kim, E., Huang, K., Saunders, A., McCallum, A., Ceder, G., & Olivetti, E. (2017) · Chemistry of Materials · doi:10.1021/acs.chemmater.7b03500 · Cited by 473
Open Targets Platform: new developments and updates two years on
Carvalho-Silva, D., Pierleoni, A., Pignatelli, M., Ong, C., Fumis, L., Karamanis, N., Carmona, M., Faulconbridge, A., Hercules, A., McAuley, E., et al. (2019) · Nucleic Acids Research · doi:10.1093/nar/gky1133 · Cited by 472
GraphRel: Modeling Text as Relational Graphs for Joint Entity and Relation Extraction
Fu, T.-J., Li, P.-H., & Ma, W.-Y. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1136 · Cited by 447
Metadata
- Authors
- Honnibal, M., & Johnson, M.
- Venue
- Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing
- Published
- 2015
- Pages
- 1373-1378
- OpenAlex
- W2251329024
- Cited by
- 602
- References
- 10
- FWCI
- 23.29
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Improved Non-monotonic Transition System for Dependency Parsing. https://app.cochat.ai/papers/10.18653/v1/d15-1162
- The paper
- Honnibal, M., & Johnson, M. (2015). An Improved Non-monotonic Transition System for Dependency Parsing. Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d15-1162
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.