Context-free Algorithms
Jonathan Graehl
TL;DR
This paper explores algorithms on grammars and transducers with context-free derivations, focusing on hypergraph reachability, shortest path computation, and pruning of irrelevant arcs to optimize pathfinding.
Contribution
Introduces new algorithms for context-free grammar-based structures, including hypergraph reachability and arc pruning techniques to improve efficiency.
Findings
Effective pruning of useless arcs reduces computational complexity.
Algorithms successfully compute shortest paths in context-free structures.
Enhanced methods outperform previous approaches in specific applications.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Machine Learning and Algorithms · Advanced Database Systems and Queries