The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A non-projective dependency parser
Open accessAbstract
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of our new parser. Finally, the parser is evaluated.
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
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
Dependency Theory: A Formalism and Some Observations
Hays, D. G. (1964) · Language · doi:10.2307/411934 · Cited by 603
Garman, M., & Hudson, R. (1993) · The Modern Language Review · doi:10.2307/3730805 · Cited by 297
Constraint grammar as a framework for parsing running text
Karlsson, F. (1990) · Proceedings of the 13th conference on Computational linguistics - · doi:10.3115/991146.991176 · Cited by 206
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
AutoTutor: an intelligent tutoring system with mixed-initiative dialogue.
Graesser, A. C., Chipman, P., Haynes, B. C., & Olney, A. (2005) · IEEE Transactions on Education · doi:10.1109/te.2005.856149 · Cited by 750
A computer-aided environment for generating multiple-choice test items
MITKOV, R., AN HA, L., & KARAMANIS, N. (2006) · Natural Language Engineering · doi:10.1017/s1351324906004177 · Cited by 229
An intrinsic stopping criterion for committee-based active learning
Olsson, F., & Tomanek, K. (2009) · Proceedings of the Thirteenth Conference on Computational Natural Language Learning - CoNLL '09 · doi:10.3115/1596374.1596398 · Cited by 37
Utilizing Temporal Information in Topic Detection and Tracking
Makkonen, J., & Ahonen-Myka, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45175-4_36 · Cited by 9
Metadata
- Authors
- Tapanainen, P., & Järvinen, T.
- Venue
- Proceedings of the fifth conference on Applied natural language processing -
- Published
- 1997
- Pages
- 64-71
- OpenAlex
- W2145211186
- Cited by
- 369
- References
- 6
- FWCI
- 5.74
- 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: A non-projective dependency parser. https://app.cochat.ai/papers/10.3115/974557.974568
- The paper
- Tapanainen, P., & Järvinen, T. (1997). A non-projective dependency parser. Proceedings of the fifth conference on Applied natural language processing -. https://doi.org/10.3115/974557.974568
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.
