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

IWPT 2011 - Proceedings of the 12th International Conference on Parsing Technologies

Volumn , Issue , 2011, Pages 163-174

  Dunlop, Aaron ^a   Bodenstab, Nathan ^a   Roark, Brian ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CELL CULTURE; CELL PROLIFERATION; EFFICIENCY; ENCODING (SYMBOLS); FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; SIGNAL ENCODING; SYNTACTICS;

CELL POPULATIONS; CONTEXT-FREE GRAMMARS; EFFICIENCY GAIN; FINE-GRAINED PARALLELISM; HIGH-ACCURACY; LEVEL EFFICIENCIES; LOW LATENCY; MATRIX; MATRIX ENCODING; PARALLELIZATION STRATEGIES;

CONTEXT FREE GRAMMARS;

EID: 84896960491     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. Brian Amedro, Denis Caromel, Fabrice Huet, Vladimir Bodnartchouk, Christian Delb, and Guillermo L. Taboada. 2010. HPC in java: experiences in implementing the NAS parallel benchmarks. In Proceedings of the 10th WSEAS international conference on applied informatics and communications and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics, page 221230.
2. Michele Banko. 1999. Open Information Extraction for the Web. PhD dissertation, University of Washington, Seattle, Washington.
3. Nathan Bell and Michael Garland. 2009. Implementing sparse matrix-vector multiplication on throughput-oriented processors. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1–11, Portland, Oregon. ACM.
4. Jari Bjrne, Filip Ginter, Sampo Pyysalo, Jun’ichi Tsujii, and Tapio Salakoski. 2010. Complex event extraction at PubMed scale. Bioinformatics, 26(12):382–390, June.
5. Nathan Bodenstab and Aaron Dunlop. 2011. BUBS parser. http://code.google.com/p/bubsparser/.
6. Nathan Bodenstab, Aaron Dunlop, Brian Roark, and Keith Hall. 2011. Beam-Width prediction for efficient Context-Free parsing. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, pages 440–449, Portland, Oregon, June.
7. Sharon A Caraballo and Eugene Charniak. 1998. New figures of merit for best-first probabilistic chart parsing. Computational Linguistics, 24:275298, June.
8. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference, pages 132–139, Seattle, Washington. Morgan Kaufmann Publishers Inc.
9. Cliff Click, Gil Tene, and Michael Wolf. 2005. The pauseless GC algorithm. Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments, page 4656.
10. Clifford N. Click, Christopher A. Vick, and Michael H. Paleczny. 2007. System and method for range check elimination via iteration splitting in a dynamic compiler, May. US Patent 7,222,337.
11. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. PhD dissertation, University of Pennsylvania.
12. Jonathan Samuel Golan. 1999. Semirings and their Applications. Springer, July.
13. Georgios Goumas, Kornilios Kourtis, Nikos Anastopoulos, Vasileios Karakasis, and Nectarios Koziris. 2008. Understanding the performance of sparse matrix-vector multiplication. In PDP08: Proceedings of the 16th Euromicro International Conference on Parallel, Distributed and Network-based Processing.
14. Susan L. Graham, Michael Harrison Ruzzo, and Walter L. 1980. An improved Context-Free recognizer. ACM Trans. Program. Lang. Syst., 2(3):415–462.
15. Mark Johnson. 1998. PCFG models of linguistic tree representations. Comput. Linguist., 24(4):613–632.
16. Mark Johnson. 2006. lncky. http://www.cog.brown.edu/~mj/Software.htm.
17. Dan Klein and Christopher D. Manning. 2001. Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the penn treebank. In Proceedings of 39th Annual Meeting of the Association for Computational Linguistics, pages 338–345, Toulouse, France, July.
18. Dan Klein and Christopher D. Manning. 2003. A* parsing. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology (NAACL’03), pages 40–47, Edmonton, Canada.
19. Thomas Kotzmann, Christian Wimmer, Hanspeter Mssenbck, Thomas Rodriguez, Kenneth Russell, and David Cox. 2008. Design of the java HotSpot client compiler for java 6. ACM Transactions on Architecture and Code Optimization (TACO), 5:7:1–7:32, May.
20. Werner Kuich and Arto Salomaa. 1985. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Number 5. Springer-Verlag, Berlin, Germany.
21. Lillian Lee. 1997. Fast Context-Free parsing requires fast boolean matrix multiplication. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, pages 9–15, Madrid, Spain, July. ACL.
22. Christopher D. Manning and Hinrich Schuetze. 1999. Foundations of Statistical Natural Language Processing. The MIT Press, June.
23. Mitchell P Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz, and Ann Taylor. 1999. Treebank-3. Linguistic Data Consortium, Philadelphia.
24. Robert C Moore. 2004. Improved left-corner chart parsing for large context-free grammars. New developments in parsing technology, page 185201.
25. Takashi Ninomiya, Kentaro Torisawa, Taura Kinjiro, and Tsujii Jun’ichi. 1997. A parallel CKY parsing algorithm on Large-Scale Distributed-Memory parallel machines. In PACLING’97, pages 223–231, Tokyo, Japan.
26. Michael Paleczny, Christopher Vick, and Cliff Click. 2001. The java hotspot server compiler. Proceedings of the 2001 Symposium on Java Virtual Machine Research and Technology Symposium, pages 1–12.
27. Adam Pauls, Dan Klein, and Chris Quirk. 2010. Top-down k-best a* parsing. In Proceedings of ACL 2010, page 200204, Morristown, NJ, USA.
28. Gerald Penn and Cosmin Munteanu. 2003. A tabulation-based parsing method that reduces copying. In Proceedings of ACL’03, pages 200–207, Sapporo, Japan.
29. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, pages 433–440, Sydney, Australia. ACL.
30. Brian Roark and Kristy Hollingshead. 2009. Linear complexity Context-Free parsing pipelines via chart constraints. In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 647–655, Boulder, Colorado, June. ACL.
31. Brian Roark, Richard Sproat, and Izhak Shafran. 2011. Lexicographic semirings for exact automata encoding of sequence models. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, Portland, Oregon, June. ACL.
32. Xinying Song, Shilin Ding, and Chin-Yew Lin. 2008. Better binarization for the CKY parsing. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pages 167–176, Honolulu, Hawaii, October. ACL.
33. Robert Endre Tarjan and Andrew Chi-Chih Yao. 1979. Storing a sparse table. Commun. ACM, 22(11):606–611.
34. Gil Tene, Jack H. Choquette, Scott Sellers, and Clifford N. Click. 2009. Array access, August. US Patent 7,577,801.
35. Reginald P. Tewarson. 1973. Sparse Matrices. Mathematics in Science and Engineering Volume 99. Academic Press, April.
36. Leslie G. Valiant. 1975. General context-free recognition in less than cubic time. Journal of Computer and System Sciences, 10(2):308–314, April.
37. Samuel Williams, Leonid Oliker, Richard Vuduc, John Shalf, Katherine Yelick, and James Demmel. 2009. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Computing, 35(3):178–194, March.
38. Thomas Wrthinger, Christian Wimmer, and Hanspeter Mssenbck. 2007. Array bounds check elimination for the java HotSpot\ client compiler. Proceedings of the 5th international symposium on Principles and practice of programming in Java, page 125133.
39. Yi Youngmin, Lai Chao-Yue, Slav Patrov, and Kurt Keutzer. 2011. Efficient parallel CKY parsing on GPUs. In Proceedings of the 12th International Conference on Parsing Technologies, Dublin, Ireland, October.