Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM

Volumn 49, Issue 1, 2002, Pages 1-15

  Lee, Lillian ^a,b  

^a Department of Obstetrics Gynecology   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Boolean matrix multiplication; Context free grammar parsing

Indexed keywords

BIOLOGICAL DATA; LANGUAGE PARSING; NUCLEOTIDES; STRING LENGTH;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; NATURAL LANGUAGE PROCESSING SYSTEMS; THEOREM PROVING;

CONTEXT FREE GRAMMARS;

EID: 0012524644     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/505241.505242     Document Type: Article

References (32)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
2. ARLAZAROV, V. L., DINIC, E. A., KRONROD, M. A., AND FARADŽEV, I. A. 1970. On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl. 11, 1209-1210. (English translation of Russian article in Dokl. Akad. Nauk SSSR 194 (1970).)
3. ARLAZAROV, V. L., DINIC, E. A., KRONROD, M. A., AND FARADŽEV, I. A. 1970. On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl. 11, 1209-1210. (English translation of Russian article in Dokl. Akad. Nauk SSSR 194 (1970).)
4. BAILEY, D. 1988. Extra high speed matrix multiplication on the Cray-2. SIAM J. Sci. Stat. Comput. 9, 3, 603-607.
5. CHOMSKY, N. 1956. Three models for the description of language. IRE Trans. Inf. Theory 2, 3, 113-124.
6. COPPERSMITH, D., AND WINOGRAD, S. 1987. Matrix multiplication via arithmetic progression. In Proceedings of the ACM Annual Symposium on the Theory of Computing. ACM, New York, pp. 1-6.
7. COPPERSMITH, D., AND WINOGRAD, S. 1990. Matrix multiplication via arithmetic progression. J. Symb. Comput. 9, 3, 251-280 (Special Issue on Computational Algebraic Complexity).
8. DURBIN, R., EDDY, S., KROGH, A., AND MITCHISON, G. 1998. Biological Sequence Analysis. Cambridge University Press, Cambridge, Mass.
9. BARLEY, J. 1970. An efficient context-free parsing algorithm. Communi. ACM 13, 2 (Feb.), 94-102.
10. GALLAIRE, H. 1969. Recognition time of context-free languages by on-line Turing machines. Inf. Cont. 15, 3 (Sept.), 288-295.
11. GRAHAM, S. L., HARRISON, M. A., AND RUZZO, W. L. 1980. An improved context-free recognizer. ACM Trans. Prog. Lang. Syst. 2, 3, 415-462.
12. HARRISON, M., AND HAVEL, I. 1974. On the parsing of deterministic languages. J. ACM 21, 4 (Oct.), 525-548.
13. HARRISON, M. A. 1978. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass.
14. HARTMANIS, J., AND STEARNS, R. E. 1965. On the computational complexity of algorithms. Trans. AMS 117, 285-306.
15. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
16. JOHNSON, M. 1998. PCFG models of linguistic tree representations. Computat. Ling. 24, 4, 613-632.
17. JOSHI, A. 1997. Parsing techniques. In Survey of the State of the Art in Human Language Technology, Ronald Cole, Joseph Mariani, Hans Uszkoreit, Giovanni Battista Varile, Annie. Zaenen, Antonio. Zampolli, and Victor Zue, Eds. Studies in Natural Language Processing. Cambridge University Press, Cambridge, Mass, pp. 351-356.
18. JOSHI, A. K., LEVY, L. S., AND TAKAHASHI, M. 1975. Tree adjunct grammars. J. Comput. Syst. Sci. 10, 1, 136-163.
19. JURAFSKY, D., AND MARTIN, J. H. 2000. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall series in Artificial Intelligence. Prentice-Hall, Englewood Cliffs, N. J.
20. KASAMI, T. 1965. An efficient recognition and syntax algorithm for context-free languages. Scientific Rep. AFCRL-65-758. Air Force Cambridge Research Lab, Bedford, Mass.
21. NEDERHOF, M. J., AND SATTA, G. 1996. Efficient tabular LR parsing. In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, pp. 239-246.
22. 2)) time. J. Comput. Syst. Sci. 56, 1, 83-89.
23. RUZZO, W. L. 1979. On the complexity of general context-free language parsing and recognition. In Proceedings of the 6th Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 71. Springer-Verlag, New York, pp. 489-497.
24. RYTTER, W. 1985. Fast recognition of pushdown automaton and context-free languages. Inf. Cont. 67, 12-22.
25. RYTTER, W. 1995. Context-free recognition via shortest paths computation: A version of Valiant's algorithm. Theoret. Comput. Sci. 143, 2, 343-352.
26. SATTA, G. 1994. Tree-adjoining grammar parsing and Boolean matrix multiplication. Comput. Ling. 20, 2, 173-191.
27. SEIFERAS, J. 1986. A simplified lower bound for context-free-language recognition. Inf. Cont. 69: 255-260.
28. STRASSEN, V. 1969. Gaussian elimination is not optimal. Num. Math. 14, 3, 354-356.
29. STRASSEN, V. 1990. Algebraic complexity theory. In Handbook of Theoretical Computer Science, vol. A, Jan van Leeuwen, Ed. Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 633-672.
30. THOTTETHODI, MITHUNA, T., CHATTERJEE, S., AND LEBECK, A. R. 1998. Tuning Strassen's matrix multiplication for memory efficiency. In SC98: High Performance Networking and Computing Conference.
31. VALIANT, L. G. 1975. General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10, 308-315.
32. 3. Inf. Cont. 10, 2, 189-208.