The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Incrementality in deterministic dependency parsing
Open accessAbstract
Deterministic dependency parsing is a robust and efficient approach to syntactic parsing of unrestricted natural language text. In this paper, we analyze its potential for incremental processing and conclude that strict incrementality is not achievable within this framework. However, we also show that it is possible to minimize the number of structures that require non-incremental processing by choosing an optimal parsing algorithm. This claim is substantiated with experimental evidence showing that the algorithm achieves incremental parsing for 68.9% of the input when tested on a random sample of Swedish text. When restricted to sentences that are accepted by the parser, the degree of incrementality increases to 87.9%.
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
Handbook of mathematical psychology: I.
Luce, R. D., Bush, R. R., & Galanter, E. (1963) · Wiley eBooks · Cited by 1,999
Steedman, M. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/6591.001.0001 · Cited by 1,585
(1999) · Cited by 1,521
Dependency Syntax: Theory and Practice
Mel’čuk, I. (1987) · Medical Entomology and Zoology · Cited by 1,417
Abney, S. P. (1991) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-011-3474-3_10 · Cited by 882
(1963) · Cited by 855
Three generative, lexicalised models for statistical parsing
Collins, M. (1997) · Proceedings of the 35th annual meeting on Association for Computational Linguistics - · doi:10.3115/976909.979620 · Cited by 743
Statistical Dependency Analysis with Support Vector Machines
Yamada, H., & Matsumoto, Y. (2003) · Cited by 600
Syntactic processing: Evidence from dutch
Frazier, L. (1987) · Natural Language and Linguistic Theory · doi:10.1007/bf00138988 · Cited by 539
Linguistic Structure and Speech Shadowing at Very Short Latencies
MARSLEN-WILSON, W. (1973) · Nature · doi:10.1038/244522a0 · Cited by 524
Cited by
Neural Architectures for Named Entity Recognition
Lample, G., Ballesteros, M., Subramanian, S., Kawakami, K., & Dyer, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1030 · Cited by 4,401
A Survey of the Usages of Deep Learning for Natural Language Processing
Otter, D. W., Medina, J. R., & Kalita, J. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2979670 · Cited by 1,836
MaltParser: A language-independent system for data-driven dependency parsing
NIVRE, J., HALL, J., NILSSON, J., CHANEV, A., ERYİGİT, G., KÜBLER, S., MARINOV, S., & MARSI, E. (2007) · Natural Language Engineering · doi:10.1017/s1351324906004505 · Cited by 801
Self-citationSimple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations
Kiperwasser, E., & Goldberg, Y. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00101 · Cited by 615
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
Metadata
- Authors
- Nivre, J.
- Venue
- Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together - IncrementParsing '04
- Published
- 2004
- Pages
- 50-57
- OpenAlex
- W2030904529
- Cited by
- 275
- References
- 15
- FWCI
- 2.60
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Incrementality in deterministic dependency parsing. https://app.cochat.ai/papers/10.3115/1613148.1613156
- The paper
- Nivre, J. (2004). Incrementality in deterministic dependency parsing. Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together - IncrementParsing '04. https://doi.org/10.3115/1613148.1613156
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.
