The DOI matches its Crossref record.
Three new probabilistic models for dependency parsing: an exploration
Open accessAbstract
After presenting a novel O(n3) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model where words fluctuate randomly in their selectional preferences, and (c) a generative model where the speaker fleshes out each word's syntactic and conceptual structure without regard to the implications for the hearer. We also give preliminary empirical results from evaluating the three models' parsing performance on annotated Wall Street Journal training text (derived from the Penn Treebank). In these results, the generative model performs significantly better than the others, and does about equally well at assigning part-of-speech tags.
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
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
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
Simple 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
Algorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 435
Metadata
- Authors
- Eisner, J. M.
- Venue
- Proceedings of the 16th conference on Computational linguistics -
- Published
- 1996
- Volume
- 1
- Pages
- 340
- ISSN
- 1525-2477 (ISSN-L)
- OpenAlex
- W2052449326
- Cited by
- 609
- References
- 0
- FWCI
- 6.18
- 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: Three new probabilistic models for dependency parsing: an exploration. https://app.cochat.ai/papers/10.3115/992628.992688
- The paper
- Eisner, J. M. (1996). Three new probabilistic models for dependency parsing: an exploration. Proceedings of the 16th conference on Computational linguistics -. https://doi.org/10.3115/992628.992688
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.
