The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
Open accessAbstract
Discriminative reranking is one method for constructing high-performance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50-best parses based on a coarse-to-fine generative parser (Charniak, 2000). This method generates 50-best lists that are of substantially higher quality than previously obtainable. We used these parses as the input to a MaxEnt reranker (Johnson et al., 1999; Riezler et al., 2002) that selects the best parse from the set of parses for each sentence, obtaining an f-score of 91.0% on sentences of length 100 or less.
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
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
(1999) · Cited by 1,521
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
Discriminative Reranking for Natural Language Parsing
Collins, M., & Koo, T. (2005) · Computational Linguistics · doi:10.1162/0891201053630273 · Cited by 710
A comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
Probabilistic Top-Down Parsing and Language Modeling
Roark, B. (2001) · Computational Linguistics · doi:10.1162/089120101750300526 · Cited by 329
Huang, L., & Chiang, D. (2005) · Proceedings of the Ninth International Workshop on Parsing Technology - Parsing '05 · doi:10.3115/1654494.1654500 · Cited by 291
Riezler, S., King, T. H., Kaplan, R. M., Crouch, R., Maxwell, J. T., & Johnson, M. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073129 · Cited by 279
Self-citationIntricacies of Collins' Parsing Model
Bikel, D. M. (2004) · Computational Linguistics · doi:10.1162/0891201042544929 · Cited by 265
Schwartz, R. M., & Chow, Y.-L. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1990.115542 · Cited by 192
Three generative, lexicalised models for statistical parsing
Collins, M. (1997) · Proceedings of the eighth conference on European chapter of the Association for Computational Linguistics - · doi:10.3115/979617.979620 · Cited by 188
Efficient parsing for bilexical context-free grammars and head automaton grammars
Eisner, J., & Satta, G. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034748 · Cited by 158
Global Thresholding and Multiple Pass ParsingPreprint
Goodman, J. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9708006 · Cited by 46
Cited by
Wang, X., Peng, Y., Lu, L., Lu, Z., Bagheri, M., & Summers, R. M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.369 · Cited by 4,616
Recurrent Convolutional Neural Networks for Text Classification
Lai, S., Xu, L., Liu, K., & Zhao, J. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9513 · Cited by 2,280
Neural Network Methods for Natural Language Processing
Goldberg, Y. (2017) · Synthesis Lectures on Human Language Technologies · doi:10.1007/978-3-031-02165-7 · Cited by 821
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
Learning Accurate, Compact, and Interpretable Tree Annotation
Petrov, S., Barrett, L., Thibaux, R., & Klein, D. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220230 · Cited by 793
Metadata
- Authors
- Charniak, E., & Johnson, M.
- Venue
- Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05
- Published
- 2005
- Pages
- 173-180
- OpenAlex
- W2125712079
- Cited by
- 872
- References
- 13
- FWCI
- 41.97
- 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.