| Document Date: 2002-04-18 09:29:25
Open Document File Size: 184,39 KBShare Result on Facebook
Company MCA / / IndustryTerm speech recognition systems / subcubic parsing algorithms / tabular algorithms / faster parsing algorithms / matrix multiplication algorithm / c-parsing algorithm / query processing / matrix product / canonical parsing algorithms / real time / subcubic algorithms / natural language processing / recognition algorithm / generative systems / matrix multiplication algorithms / recognition algorithms / successive applications / / Organization Boolean Matrix Multiplication Lillian Lee Department of Computer Science / Cornell University / / Person Lillian Lee / / Position algorithm designer / VP / BMM algorithm MP / List VP / VP NP N0 DET / MP / / PublishedMedium Journal of the ACM / / Technology speech recognition / Asymptotically faster parsing algorithms / natural language processing / CFG recognition algorithms / substantially sub-cubic Boolean matrix multiplication algorithms / Boolean matrix multiplication algorithm / parsing algorithm / c-parsing algorithm / subcubic parsing algorithms / BMM algorithm / parsing algorithms / 5 BMM algorithm / subcubic algorithms / CKY algorithm / CFG recognition algorithm / canonical parsing algorithms / matrix multiplication algorithms / matrix multiplication algorithm / /
SocialTag |
Journal of the ACM 49(1), pp[removed], 2002 Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication Lillian Lee Department of Computer Science, Cornell University