Fast context-free parsing requires fast boolean matrix multiplication

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1997-July, Issue , 1997, Pages 9-15

  Lee, Lillian ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

BOOLEAN MATRIX; BOOLEAN MATRIX MULTIPLICATION; CONTEXT-FREE; FORMAL DEFINITION; MATRIX MULTIPLICATION ALGORITHM; RUNNING-IN;

MATRIX ALGEBRA;

EID: 85085550256     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Arlazarov, V. L., E. A. Dinic, M. A. Kronrod, and I. A. Farad~ev. 1970. On economical construction of the transitive closure of an oriented graph. Soviet Math. Dokl., 11:1209-1210. English translation of the Russian article in Dokl. Akad. Nauk SSSR 194 (1970).
2. Coppersmith, Don and Shmuel Winograd. 1990. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9(3):251-280. Special Issue on Computational Algebraic Complexity.
3. Earley, Jay. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102.
4. Gallaire, Herv& 1969. Recognition time of context-free languages by on-line turing machines. Information and Control, 15(3):288-295, September.
5. Graham, Susan L., Michael A. Harrison, and Walter L. Ruzzo. 1980. An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2(3):415-462.
6. Harrison, Michael and Ivan Havel. 1974. On the parsing of deterministic languages. Journal of the ACM, 21(4):525-548, October.
7. Kasami, Tadao. 1965. An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MA.
8. Lang, Bernard. 1994. Recognition can be harder than parsing. Computational Intelligence, 10(4):486-494, November.
9. Satta, Giorgio. 1994. Tree-adjoining grammar parsing and boolean matrix multiplication. Computational Linguistics, 20(2):173-191, June.
10. Seiferas, Joel. 1986. A simplified lower bound for context-free-language recognition. Information and Control, 69:255-260.
11. Strassen, Volker. 1969. Gaussian elimination is not optimal. Numerische Mathematik, 14(3):354-356.
12. Strassen, Volker. 1990. Algebraic complexity theory. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A. Elsevier Science Publishers, chapter 11, pages 633-672.
13. Valiant, Leslie G. 1975. General context-free recognition in less than cubic time. Journal of Computer and System Sciences, 10:308-315.
14. Younger, Daniel H. 1967. Recognition and parsing of context-free languages in time n3. Information and Control, 10(2):189-208.