Context-free Algorithms
Formal Languages and Automata Theory
2015-02-10 v1 Data Structures and Algorithms
Authors:
Jonathan Graehl
Abstract
Algorithms on grammars/transducers with context-free derivations: hypergraph reachability, shortest path, and inside-outside pruning of 'relatively useless' arcs that are unused by any near-shortest paths.
Cite
@article{arxiv.1502.02328,
title = {Context-free Algorithms},
author = {Jonathan Graehl},
journal= {arXiv preprint arXiv:1502.02328},
year = {2015}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
A representation of context-free grammars with the help of finite digraphs
Krasimir Yordzhev
2013-05-30
Formal Languages and Automata Theory · Computer Science
On some representations of context-free languages
Krasimir Yordzhev
2020-10-13
Logic in Computer Science · Computer Science
Random Graph Generation in Context-Free Graph Languages
Federico Vastarini, Detlef Plump
2024-10-02
Data Structures and Algorithms · Computer Science
Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
Faruk Alpay, Levent Sarioglu
2026-03-02
Formal Languages and Automata Theory · Computer Science
Context-Free Grammars with Storage
Joost Engelfriet
2014-08-05
Logic in Computer Science · Computer Science
Graph representation of context-free grammars
Alex Shkotin
2007-05-23
Formal Languages and Automata Theory · Computer Science
On the Comparison of Context-Free Grammars
J. Joao Almeida, Eliana Grande, Georgi Smirnov
2018-04-23
Formal Languages and Automata Theory · Computer Science
Parsing Hypergraphs using Context-Free Positional Grammars
Gennaro Costagliola, Federico Vastarini
2026-01-08
Computation and Language · Computer Science
Practical experiments with regular approximation of context-free languages
Mark-Jan Nederhof
2007-05-23
Formal Languages and Automata Theory · Computer Science
Ordered Context-Free Grammars Revisited
Brink van der Merwe
2023-09-19
Formal Languages and Automata Theory · Computer Science
Relational parsing: a clean, fast parsing strategy for all context-free languages
Grzegorz Herman
2019-02-19
Databases · Computer Science
Context-Free Path Querying by Matrix Multiplication
Rustam Azimov, Semyon Grigorev
2023-02-21
Formal Languages and Automata Theory · Computer Science
Context-Free Languages of String Diagrams
Matt Earnshaw, Mario Román
2024-04-17
Formal Languages and Automata Theory · Computer Science
P(Expression|Grammar): Probability of deriving an algebraic expression with a probabilistic context-free grammar
Urh Primožič, Ljupčo Todorovski, Matej Petković
2022-12-05
Formal Languages and Automata Theory · Computer Science
Iterative method of generating artificial context-free grammars
Olgierd Unold, Agnieszka Kaczmarek, Łukasz Culer
2019-11-15
Other Computer Science · Computer Science
Confluent Orthogonal Drawings of Syntax Diagrams
Michael J. Bannister, David A. Brown, David Eppstein
2015-09-03
cmp-lg · Computer Science
Bayesian Grammar Induction for Language Modeling
Stanley F. Chen
2008-02-03
cmp-lg · Computer Science
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
Jose F. Quesada
2007-05-23
Formal Languages and Automata Theory · Computer Science
Detecting and Explaining (In-)equivalence of Context-Free Grammars
Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer +2
2026-04-09
Optimization and Control · Mathematics
Derivative-Free Optimization Algorithms based on Non-Commutative Maps
Jan Feiling, Amelie Zeller, Christian Ebenbauer
2018-05-21
Formal Languages and Automata Theory · Computer Science
Language Approximation With One-Counter Automata
Alexander Sakharov
2017-07-26
Formal Languages and Automata Theory · Computer Science
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi +1
2013-11-27
Formal Languages and Automata Theory · Computer Science
Normal forms for linear displacement context-free grammars
Alexey Sorokin
2015-07-31
Databases · Computer Science
Grammars for Document Spanners
Liat Peterfreund
2023-01-25
Formal Languages and Automata Theory · Computer Science
Grammars with two-sided contexts
Mikhail Barash, Alexander Okhotin
2014-05-23