Fast context-free grammar parsing requires fast boolean matrix multiplication
Reads0
Chats0
TLDR
It is explained why there has been little progress in developing practical, substantially subcubic general CFG parsers since Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars.Abstract:
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars (CFGs), yielding the asympotically fastest (although not practical) CFG parsing algorithm known. We prove a dual result: any CFG parser with time complexity O(gn3-∈), where g is the size of the grammar and n is the length of the input string, can be efficiently converted into an algorithm to multiply m × m Boolean matrices in time O(m3-∈/3). Given that practical, substantially subcubic Boolean matrix multiplication algorithms have been quite difficult to find, we thus explain why there has been little progress in developing practical, substantially subcubic general CFG parsers. In proving this result, we also develop a formalization of the notion of parsing.read more
Citations
More filters
Proceedings ArticleDOI
Parsing expression grammars: a recognition-based syntactic foundation
TL;DR: PEGs address frequently felt expressiveness limitations of CFGs and REs, simplifying syntax definitions and making it unnecessary to separate their lexical and hierarchical components, and are here proven equivalent in effective recognition power.
Posted Content
Popular conjectures imply strong lower bounds for dynamic problems
TL;DR: In this article, the authors consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms.
Proceedings Article
Dynamic Programming for Linear-Time Incremental Parsing
Liang Huang,Kenji Sagae +1 more
TL;DR: It is shown that, surprisingly, dynamic programming is in fact possible for many shift-reduce parsers, by merging "equivalent" stacks based on feature values, and the final parser outperforms all previously reported dependency parsers for English and Chinese, yet is much faster.
Proceedings ArticleDOI
Packrat parsing: simple, powerful, lazy, linear time, functional pearl
TL;DR: This paper describes packrat parsing informally with emphasis on its use in practical applications, and explores its advantages and disadvantages with respect to the more conventional alternatives.
Proceedings ArticleDOI
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation
Moshe Babaioff,William E. Walsh +1 more
TL;DR: A novel payment rule analogous to Vickrey-Clarke-Groves payments, but adapted to the allocation rule is used, which produces higher efficiency for a broader class of supply chains than any other incentive compatible, individually rational, and budget-balanced auction the authors are aware of.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Compilers: Principles, Techniques, and Tools
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
Book
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Dan Jurafsky,James Martin +1 more
TL;DR: This book takes an empirical approach to language processing, based on applying statistical and other machine-learning algorithms to large corpora, to demonstrate how the same algorithm can be used for speech recognition and word-sense disambiguation.
Journal ArticleDOI
Gaussian elimination is not optimal
TL;DR: In this paper, Cook et al. gave an algorithm which computes the coefficients of the product of two square matrices A and B of order n with less than 4. 7 n l°g 7 arithmetical operations (all logarithms in this paper are for base 2).
Journal ArticleDOI
Matrix multiplication via arithmetic progressions
Don Coppersmith,Shmuel Winograd +1 more
TL;DR: In this article, a new method for accelerating matrix multiplication asymptotically is presented, based on the ideas of Volker Strassen, by using a basic trilinear form which is not a matrix product.