Fast context-free grammar parsing requires fast Boolean matrix multiplication
type: Item
instance of: scholarly article
title: Fast context-free grammar parsing requires fast boolean matrix multiplication
zbMATH Open document ID: 1323.68332
DOI: 10.1145/505241.505242
author: Lillian Lee
published in: Journal of the ACM
publication date: 2015-10-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/cs/0112018
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6502279
zbMATH Keywords: Boolean matrix multiplication
zbMATH Keywords: context-free grammar parsing
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2025063099
Wikidata QID: Q55890024
Recommended article: Parsing by matrix multiplication generalized to Boolean grammars
Recommended article: Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
Recommended article: Efficient parallel and incremental parsing of practical context-free languages
Recommended article: Efficient divide-and-conquer parsing of practical context-free languages
Recommended article: Q5203697
description: scientific article; zbMATH DE number 6502279