The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A new statistical parser based on bigram lexical dependencies
Open accessAbstract
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street Journal data show that the method performs at least as well as SPATTER (Magerman 95; Jelinek et al. 94), which has the best published results for a statistical parser on this task. The simplicity of the approach means the model trains on 40,000 sentences in under 15 minutes. With a beam search strategy parsing speed can be improved to over 200 sentences a minute with negligible loss in accuracy.
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
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Text Chunking Using Transformation-Based Learning
Ramshaw, L. A., & Marcus, M. P. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_10 · Cited by 1,460
A Maximum Entropy Model for Part-Of-Speech Tagging
Ratnaparkhi, A. (1996) · Cited by 1,317
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
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
Structural ambiguity and lexical relations
Hindle, D., & Rooth, M. (1990) · Proceedings of the workshop on Speech and Natural Language - HLT '90 · doi:10.3115/116580.116664 · Cited by 503
Procedure for quantitatively comparing the syntactic coverage of English grammars
Klavans, J., Liberman, M., Marcus, M., Roukos, S., Santorini, B., Strzalkowski, T., Abney, S., Flickenger, S., Gdaniec, C., Grishman, C., et al. (1991) · Proceedings of the workshop on Speech and Natural Language - HLT '91 · doi:10.3115/112405.112467 · Cited by 432
SELF-ORGANIZED LANGUAGE MODELING FOR SPEECH RECOGNITION
Jelinek, F. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50045-0 · Cited by 427
Inside-outside reestimation from partially bracketed corpora
Pereira, F., & Schabes, Y. (1992) · Proceedings of the 30th annual meeting on Association for Computational Linguistics - · doi:10.3115/981967.981984 · Cited by 284
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Briscoe, T., & Carroll, J. M. (1993) · Cited by 188
Prepositional Phrase Attachment through a Backed-Off Model
Collins, M., & Brooks, J. (1995) · arXiv · doi:10.48550/arxiv.cmp-lg/9506021 · Cited by 166
Self-citationPrepositional Phrase Attachment Through a Backed-off Model
Collins, M., & Brooks, J. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_11 · Cited by 166
Self-citationGrammatical Trigrams: A Probabilistic Model of Link Grammar
Lafferty, J., Sleator, S., & Temperley, D. (1992) · doi:10.21236/ada256365 · Cited by 133
Magerman, D. M., & Marcus, M. P. (1991) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.3115/977180.977184 · Cited by 72
Decision tree parsing using a hidden derivation model
Jelinek, F., Lafferty, J., Magerman, D. M., Mercer, R. L., Ratnaparkhi, A., & Roukos, S. (1994) · DARPA Workshop on Speech and Natural Language (HLT) · doi:10.3115/1075812.1075873 · Cited by 71
Cited by
Accurate unlexicalized parsing
Klein, D., & Manning, C. D. (2003) · Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03 · doi:10.3115/1075096.1075150 · Cited by 3,008
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
Self-citationCoNLL-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
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
Self-citationTwo decades of statistical language modeling: where do we go from here?
Rosenfeld, R. (2000) · Proceedings of the IEEE · doi:10.1109/5.880083 · Cited by 735
Metadata
- Authors
- Collins, M. J.
- Venue
- Proceedings of the 34th annual meeting on Association for Computational Linguistics -
- Published
- 1996
- Pages
- 184-191
- OpenAlex
- W2110882317
- Cited by
- 614
- References
- 15
- FWCI
- 38.45
- 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.