A Multi-Teraflop Constituency Parser using GPUs
John Canny, David Hall, Dan Klein · Conference on Empirical Methods in Natural Language Processing (EMNLP) · 2013
Constituency parsing with rich grammars remains a computational challenge.Graphics Processing Units (GPUs) have previously been used to accelerate CKY chart evaluation, but gains over CPU parsers were modest.In this paper, we describe a collection of new techniques that enable chart evaluation at close to the GPU's practical maximum speed (a Teraflop), or around a half-trillion rule evaluations per second.Net parser performance on a 4-GPU system is over 1 thousand length-30 sentences/second (1 trillion rules/sec), and 400 general sentences/second for the Berkeley Parser Grammar.The techniques we introduce include grammar compilation, recursive symbol blocking, and cache-sharing.
Cited by 18 works. doi:10.18653/v1/d13-1195 Open-access PDF
Authors
References
- Building a Large Annotated Corpus of English: The Penn Treebank
- Accurate unlexicalized parsing
- Learning accurate, compact, and interpretable tree annotation
- Improved Inference for Unlexicalized Parsing
- Probabilistic CFG with latent annotations
- Efficient Parallel CKY Parsing on GPUs
- Parsing in Parallel on Multiple Cores and GPUs