Efficient Enumeration for Annotated Grammars
Summary: Defines annotated grammars—CFGs with terminal annotations—that extend regular spanners and strictly generalize Peterfreund's extraction grammars; formulates enumeration of all annotations yielding derivable words for a fixed grammar and input string. Main results: unambiguous grammars enumerated with O(n^3) preprocessing and output-linear delay (improves prior quintic); subclasses with single derivation shape admit O(n^2) preprocessing, and spanner-like classes admit O(n) preprocessing, all preserving output-linear delay. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Antoine Amarilli
- 2. Louis Jachiet
- 3. Martín Muñoz
- 4. Cristian Riveros
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,157 | REmatch: a novel regex engine for finding all matches | 2023 | VLDB | 4.380727e-05 |
| 10,351 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 4.1905499e-05 |
| 10,930 | Complex Event Recognition meets Hierarchical Conjunctive Queries | 2024 | PODS | 4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 770 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001686092 |
| 1,054 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00014397587 |
| 3,785 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7658346e-05 |
| 5,052 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.725952e-05 |
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,373 | The Complexity of Maximal Common Subsequence Enumeration | 2025 | PODS | 4.1905499e-05 |
| 6,175 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS | 5.1667995e-05 |
| 9,016 | Marrying Words and Trees | 2007 | PODS | 4.4055344e-05 |
| 3,566 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.9623808e-05 |
| 12,939 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1905499e-05 |
| 12,110 | Deterministic Regular Expressions in Linear Time | 2012 | PODS | 4.1905499e-05 |
| 8,734 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 4.4520434e-05 |
| 10,351 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 4.1905499e-05 |
| 2,297 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 9.0812384e-05 |
| 5,052 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.725952e-05 |