The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Pseudo-projective dependency parsing
Open accessAbstract
In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. We show how a data-driven deterministic dependency parser, in itself restricted to projective structures, can be combined with graph transformation techniques to produce non-projective structures. Experiments using data from the Prague Dependency Treebank show that the combined system can handle non-projective constructions with a precision sufficient to yield a significant improvement in overall parsing accuracy. This leads to the best reported performance for robust non-projective parsing of Czech.
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
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
(1999) · Cited by 1,521
Dependency Syntax: Theory and Practice
Mel’čuk, I. (1987) · Medical Entomology and Zoology · Cited by 1,417
Parsing English with a Link Grammar
Sleator, D. D., & Temperley, D. (1995) · Cited by 678
Three new probabilistic models for dependency parsing: an exploration
Eisner, J. M. (1996) · Proceedings of the 16th conference on Computational linguistics - · doi:10.3115/992628.992688 · Cited by 609
Statistical Dependency Analysis with Support Vector Machines
Yamada, H., & Matsumoto, Y. (2003) · Cited by 600
An efficient algorithm for projective dependency parsing
Nivre, J. (2003) · Cited by 475
Self-citationThe Prague Dependency Treebank
Böhmová, A., Hajič, J., Hajičová, E., & Hladká, B. (2003) · Text, Speech and Language Technology · doi:10.1007/978-94-010-0201-1_7 · Cited by 409
A non-projective dependency parser
Tapanainen, P., & Järvinen, T. (1997) · Proceedings of the fifth conference on Applied natural language processing - · doi:10.3115/974557.974568 · Cited by 369
Oflazer, K., Say, B., Hakkani-Tür, D. Z., & Tür, G. (2003) · Text, Speech and Language Technology · doi:10.1007/978-94-010-0201-1_15 · Cited by 228
Cited by
CoNLL-X shared task on multilingual dependency parsing
Buchholz, S., & Marsi, E. (2006) · Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06 · doi:10.3115/1596276.1596305 · Cited by 963
Non-projective dependency parsing using spanning tree algorithms
McDonald, R., Pereira, F., Ribarov, K., & Hajič, J. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220641 · Cited by 847
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-citationUniversal Stanford dependencies: A cross-linguistic typology
de Marneffe, M.-C., Dozat, T., Silveira, N., Haverinen, K., Ginter, F., Nivre, J., & Manning, C. D. (2014) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/4ok3zdjx8t96 · Cited by 456
Self-citationAlgorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 435
Self-citation
Metadata
- Authors
- Nivre, J., & Nilsson, J.
- Venue
- Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05
- Published
- 2005
- Pages
- 99-106
- OpenAlex
- W2161795601
- Cited by
- 292
- References
- 16
- FWCI
- 17.41
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Pseudo-projective dependency parsing. https://app.cochat.ai/papers/10.3115/1219840.1219853
- The paper
- Nivre, J., & Nilsson, J. (2005). Pseudo-projective dependency parsing. Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05. https://doi.org/10.3115/1219840.1219853
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.