The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A stochastic parts program and noun phrase parser for unrestricted text
Church, K. W. (1988) · Proceedings of the second conference on Applied natural language processing - · doi:10.3115/974235.974260 · Cited by 957
Parsing English with a Link Grammar
Sleator, D. D., & Temperley, D. (1995) · Cited by 678
A new statistical parser based on bigram lexical dependencies
Collins, M. J. (1996) · Proceedings of the 34th annual meeting on Association for Computational Linguistics - · doi:10.3115/981863.981888 · Cited by 614
Statistical decision-tree models for parsing
Magerman, D. M. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981695 · Cited by 567
Robust part-of-speech tagging using a hidden Markov model
Kupiec, J. (1992) · Computer Speech & Language · doi:10.1016/0885-2308(92)90019-z · Cited by 416
Basic Methods of Probabilistic Context Free Grammars
Jelinek, F., Lafferty, J. D., & Mercer, R. L. (1992) · Speech Recognition and Understanding · doi:10.1007/978-3-642-76626-8_35 · Cited by 193
Towards history-based grammars: using richer models for probabilistic parsing
Black, E. W., Jelinek, F., Lafferty, J., Magerman, D. M., Mercer, R. L., & Roukos, S. (1993) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981574.981579 · Cited by 145
Grammatical Trigrams: A Probabilistic Model of Link Grammar
Lafferty, J., Sleator, S., & Temperley, D. (1992) · doi:10.21236/ada256365 · Cited by 133
Stochastic lexicalized tree-adjoining grammars
Schabes, Y. (1992) · International Conference on Computational Linguistics · doi:10.3115/992133.992136 · Cited by 126
Towards history-based grammars: using richer models for probabilistic parsing
Black, E. W., Jelinek, F., Lafferty, J., Magerman, D. M., Mercer, R. L., & Roukos, S. (1992) · DARPA Workshop on Speech and Natural Language (HLT) · doi:10.3115/1075527.1075557 · Cited by 89
Markov Source Modeling of Text Generation
Jelinek, F. (1985) · Springer eBooks · doi:10.1007/978-94-009-5113-6_28 · Cited by 81
An Empirical Comparison of Probability Models for Dependency GrammarPreprint
Eisner, J. M. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9706004 · Cited by 74
Self-citation
Cited by
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
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
Online large-margin training of dependency parsers
McDonald, R., Crammer, K., & Pereira, F. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219852 · Cited by 791
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
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
- 13
- 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
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.