The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
Open accessAbstract
This article describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are “full” parsing models in the sense that probabilities are defined for complete parses, rather than for independent events derived by decomposing the parse tree. Discriminative training is used to estimate the models, which requires incorrect parses for each sentence in the training data as well as the correct parse. The lexicalized grammar formalism used is Combinatory Categorial Grammar (CCG), and the grammar is automatically extracted from CCGbank, a CCG version of the Penn Treebank. The combination of discriminative training and an automatically extracted grammar leads to a significant memory requirement (up to 25 GB), which is satisfied using a parallel implementation of the BFGS optimization algorithm running on a Beowulf cluster. Dynamic programming over a packed chart, in combination with the parallel implementation, allows us to solve one of the largest-scale estimation problems in the statistical parsing literature in under three hours. A key component of the parsing system, for both training and testing, is a Maximum Entropy supertagger which assigns CCG lexical categories to words in a sentence. The supertagger makes the discriminative training feasible, and also leads to a highly efficient parser. Surprisingly, given CCG's “spurious ambiguity,” the parsing speeds are significantly higher than those reported for comparable parsers in the literature. We also extend the existing parsing techniques for CCG by developing a new model and efficient parsing algorithm which exploits all derivations, including CCG's nonstandard derivations. This model and parsing algorithm, when combined with normal-form constraints, give state-of-the-art accuracy for the recovery of predicate-argument dependencies from CCGbank. The parser is also evaluated on DepBank and compared against the RASP parser, outperforming RASP overall and on the majority of relation types. The evaluation on DepBank raises a number of issues regarding parser evaluation. This article provides a comprehensive blueprint for building a wide-coverage CCG parser. We demonstrate that both accurate and highly efficient parsing is possible with CCG.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
The Proposition Bank: An Annotated Corpus of Semantic Roles
Palmer, M., Gildea, D., & Kingsbury, P. (2005) · Computational Linguistics · doi:10.1162/0891201053630264 · Cited by 2,273
A high-performance, portable implementation of the MPI message passing interface standard
Gropp, W., Lusk, E., Doss, N., & Skjellum, A. (1996) · Parallel Computing · doi:10.1016/0167-8191(96)00024-5 · Cited by 2,222
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
Steedman, M. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/6591.001.0001 · Cited by 1,585
(1999) · Cited by 1,521
Shallow parsing with conditional random fields
Sha, F., & Pereira, F. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073473 · Cited by 1,246
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
Recognition and parsing of context-free languages in time n3
Younger, D. H. (1967) · Information and Control · doi:10.1016/s0019-9958(67)80007-x · Cited by 935
Popowich, F. (1999) · Wiley Encyclopedia of Electrical and Electronics Engineering · doi:10.1002/047134608x.w6910 · Cited by 834
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
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
Applications of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1991) · Computer Speech & Language · doi:10.1016/0885-2308(91)90009-f · Cited by 639
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
A Quasi-Arithmetical Notation for Syntactic Description
Bar-Hillel, Y. (1953) · Language · doi:10.2307/410452 · Cited by 536
Statistical parsing with a context-free grammar and word statistics
Eugene Charniak, D. (1997) · Cited by 521
A maximum entropy approach to named entity recognition
Grishman, R., & Borthwick, A. (1999) · Cited by 467
Maximum entropy models for natural language ambiguity resolution
Ratnaparkhi, A., & Marcus, M. P. (1998) · Scholarly Commons (University of Pennsylvania) · Cited by 422
Moortgat, M. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-53726-3.00002-5 · Cited by 415
PCFG models of linguistic tree representations
Johnson, M. (1998) · OLAC - Open Language Archives Community · doi:10.5555/972764.972768 · Cited by 397
Supertagging: an approach to almost parsing
Bangalore, S., & Joshi, A. K. (1999) · Cited by 380
The estimation of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1990) · Computer Speech & Language · doi:10.1016/0885-2308(90)90022-x · Cited by 379
Incremental parsing with the perceptron algorithm
Collins, M., & Roark, B. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1218970 · Cited by 373
The second release of the RASP system
Briscoe, T., Carroll, J. M., & Watson, R. (2006) · doi:10.3115/1225403.1225423 · Cited by 357
A Gaussian Prior for Smoothing Maximum Entropy Models
Chen, S. F., & Rosenfeld, R. (1999) · doi:10.21236/ada360974 · Cited by 345
Corpus Variation and Parser Performance
Gildea, D. (2001) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 295
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
Robust Accurate Statistical Annotation of General Text
Briscoe, T., & Carroll, J. A. (2002) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/2aswu2tg29np · Cited by 246
Learning to Parse Natural Language with Maximum Entropy Models
Ratnaparkhi, A. (1999) · Machine Learning · doi:10.1023/a:1007502103375 · Cited by 242
Taskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. D. (2004) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 229
Parser evaluation: a survey and a new proposal
Carroll, J. A., Briscoe, T., & Sanfilippo, A. P. (1998) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/4a9d5hhswxrb · Cited by 213
Prepositional Phrase Attachment through a Backed-Off Model
Collins, M., & Brooks, J. (1995) · arXiv · doi:10.48550/arxiv.cmp-lg/9506021 · Cited by 166 · cited 2×
“Two possible extensions, which we have not investigated, include defining dependency features which account for all three elements of the triple in a PP-attachment (Collins and Brooks 1995), and defining a rule feature which includes the grandparent node (Johnson 1998).”
BackgroundMethodPrepositional 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
Data and models for statistical parsing with combinatory categorial grammar
Hockenmaier, J. (2003) · ERA · Cited by 157
Parsing algorithms and metrics
Goodman, J. (1996) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981863.981887 · Cited by 139
A classifier-based parser with linear run-time complexity
Sagae, K., & Lavie, A. (2005) · International Workshop/Conference on Parsing Technologies · doi:10.3115/1654494.1654507 · Cited by 135
Lease, M., & Eugene Charniak, D. (2005) · Lecture notes in computer science · doi:10.1007/11562214_6 · Cited by 120
A simple pattern-matching algorithm for recovering empty nodes and their antecedents
Johnson, M. (2001) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1073083.1073107 · Cited by 111
Acquiring Compact Lexicalized Grammars from a Cleaner Treebank
Hockenmaier, J., & Steedman, M. J. (2002) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3ws4qb8xz972 · Cited by 101
Efficient normal-form parsing for combinatory categorial grammar
Eisner, J. M. (1996) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981863.981874 · Cited by 97
Automated Extraction of Tags from the Penn Treebank
Chen, J., & Shanker, V. K. (2004) · Text, speech and language technology · doi:10.1007/1-4020-2295-6_4 · Cited by 82
Chunking with maximum entropy models
Koeling, R. (2000) · Conference on Computational Natural Language Learning · doi:10.3115/1117601.1117634 · Cited by 80
Cascaded Grammatical Relation Assignment
Buchholz, S., Veenstra, J., & Daelemans, W. M. P. (1999) · Research portal (Tilburg University) · doi:10.48550/arxiv.cs/9906004 · Cited by 74
Dynamic programming for parsing and estimation of stochastic unification-based grammars
Geman, S., & Johnson, M. S. (2001) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/1073083.1073130 · Cited by 54
Probabilistic Feature Grammars
Goodman, J. (2000) · Text, speech and language technology · doi:10.1007/978-94-015-9470-7_4 · Cited by 47
A Comparison of Evaluation Metrics for a Broad-Coverage Stochastic Parser
Crouch, R., Kaplan, R. M., King, T. H., & Riezler, S. (2003) · Cited by 19
(1965) · Defense Technical Information Center (DTIC)
Cited by
A Syntactic Neural Model for General-Purpose Code Generation
Yin, P., & Neubig, G. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1041 · Cited by 623
A Syntactic Neural Model for General-Purpose Code Generation
Yin, P., & Neubig, G. (2017) · arXiv · doi:10.48550/arxiv.1704.01696 · Cited by 585
Weakly Supervised Learning of Semantic Parsers for Mapping Instructions to Actions
Artzi, Y., & Zettlemoyer, L. (2013) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00209 · Cited by 406
Combinatory Categorial Grammar
Steedman, M., & Baldridge, J. (2011) · Non‐Transformational Syntax · doi:10.1002/9781444395037.ch5 · Cited by 259
Measuring text similarity based on structure and word embedding
Farouk, M. (2020) · Cognitive Systems Research · doi:10.1016/j.cogsys.2020.04.002 · Cited by 47
Metadata
- Authors
- Clark, S., & Curran, J. R.
- Venue
- Computational Linguistics
- Publisher
- MIT Press - Journals
- Published
- 2007-12
- Volume
- 33
- Issue
- 4
- Pages
- 493-552
- ISSN
- 0891-2017 (ISSN-L)
- 1530-9312
- OpenAlex
- W1969245183
- Cited by
- 410
- References
- 51
- FWCI
- 40.98
- Type
- journal article
- 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.