Efficient matrix-encoded grammars and low latency parallelization strategies for CYK

Authors:
Aaron Dunlop;Nathan Bodenstab;Brian Roark
Affiliations:
Oregon Health & Science University, Portland, OR;Oregon Health & Science University, Portland, OR;Oregon Health & Science University, Portland, OR
Venue:
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Year:
2011

Citing 31
Cited 3

Foundations of statistical natural language processing

Foundations of statistical natural language processing
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Storing a sparse table

Communications of the ACM
Semirings, Automata and Languages

Semirings, Automata and Languages
Head-driven statistical models for natural language parsing

Head-driven statistical models for natural language parsing
New figures of merit for best-first probabilistic chart parsing

Computational Linguistics
PCFG models of linguistic tree representations

Computational Linguistics
A maximum-entropy-inspired parser

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Fast context-free parsing requires fast Boolean matrix multiplication

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
The pauseless GC algorithm

Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments
Parsing with treebank grammars: empirical bounds, theoretical models, and the structure of the Penn Treebank

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A parsing: fast exact Viterbi parse selection

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
A tabulation-based parsing method that reduces copying

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Improved left-corner chart parsing for large context-free grammars

New developments in parsing technology
Learning accurate, compact, and interpretable tree annotation

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
The java hotspotTM server compiler

JVM'01 Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1
Array bounds check elimination for the Java HotSpot™ client compiler

Proceedings of the 5th international symposium on Principles and practice of programming in Java
Understanding the Performance of Sparse Matrix-Vector Multiplication

PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Design of the Java HotSpot™ client compiler for Java 6

ACM Transactions on Architecture and Code Optimization (TACO)
Optimization of sparse matrix-vector multiplication on emerging multicore platforms

Parallel Computing
Better binarization for the CKY parsing

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Linear complexity context-free parsing pipelines via chart constraints

NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Implementing sparse matrix-vector multiplication on throughput-oriented processors

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
General context-free recognition in less than cubic time

Journal of Computer and System Sciences
Open information extraction for the web

Open information extraction for the web
Complex event extraction at PubMed scale

Bioinformatics
Top-down k-best A* parsing

ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Beam-width prediction for efficient context-free parsing

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Lexicographic semirings for exact automata encoding of sequence models

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
HPC in Java: experiences in implementing the NAS parallel benchmarks

AIC'10/BEBI'10 Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics
Efficient parallel CKY parsing on GPUs

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies

Efficient parallel CKY parsing on GPUs

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Parser showdown at the wall street corral: an empirical investigation of error types in parser output

EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Finite-state chart constraints for reduced complexity context-free parsing pipelines

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a matrix encoding of context-free grammars, motivated by hardware-level efficiency considerations. We find efficiency gains of 2.5--9x for exhaustive inference and approximately 2x for pruned inference, resulting in high-accuracy parsing at over 20 sentences per second. Our grammar encoding allows fine-grained parallelism during chart cell population; we present a controlled study of several methods of parallel parsing, and find near-optimal latency reductions as core-count increases.