An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time

DOI10.1007/978-3-319-30000-9_41zbMath1443.68078arXiv1406.3405OpenAlexW1575289106MaRDI QIDQ2798747

Marius Nicolae, Sanguthevar Rajasekaran

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3405

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Approximation algorithms (68W25)

Related Items (2)

If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

This page was built for publication: An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time