Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication

Lillian Lee


Anthology ID:
P97-1002
Volume:
35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics
Month:
July
Year:
1997
Address:
Madrid, Spain
Venues:
ACL | EACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
9–15
Language:
URL:
https://aclanthology.org/P97-1002
DOI:
10.3115/976909.979619
Bibkey:
Cite (ACL):
Lillian Lee. 1997. Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication. In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 9–15, Madrid, Spain. Association for Computational Linguistics.
Cite (Informal):
Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication (Lee, ACL-EACL 1997)
Copy Citation:
PDF:
https://aclanthology.org/P97-1002.pdf