Efficient Enumeration for Annotated Grammars-Reference-Cited by-同舟云学术

Efficient Enumeration for Annotated Grammars

Published:2022-06-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Amarilli Antoine¹,Jachiet Louis¹,Muñoz Martín²,Riveros Cristian²

Affiliation:

1. LTCI, Télécom Paris, Institut Polytechnique de Paris, Paris, France

2. Pontificia Universidad Católica de Chile, Santiago, Chile

Funder

Agencia Nacional de Investigación y Desarrollo

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3517804.3526232

Reference30 articles.

1. If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser

2. Alfred V. Aho , John E. Hopcroft , and Jeffrey D . Ullman . 1974 . The design and analysis of computer algorithms. Addison-Wesley . Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley.

3. Rajeev Alur and Parthasarathy Madhusudan. 2004. Visibly pushdown languages. In STOC. Rajeev Alur and Parthasarathy Madhusudan. 2004. Visibly pushdown languages. In STOC.

4. Antoine Amarilli Pierre Bourhis Louis Jachiet and Stefan Mengel. 2017. A circuit-based approach to efficient enumeration. In ICALP. Antoine Amarilli Pierre Bourhis Louis Jachiet and Stefan Mengel. 2017. A circuit-based approach to efficient enumeration. In ICALP.

5. Antoine Amarilli Pierre Bourhis Stefan Mengel and Matthias Niewerth. 2019. Constant-delay enumeration for nondeterministic document spanners. In ICDT. Antoine Amarilli Pierre Bourhis Stefan Mengel and Matthias Niewerth. 2019. Constant-delay enumeration for nondeterministic document spanners. In ICDT.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerating m-Length Walks in Directed Graphs with Constant Delay;Lecture Notes in Computer Science;2024

2. The Information Extraction Framework of Document Spanners - A Very Informal Survey;Lecture Notes in Computer Science;2024

3. Enumerating grammar-based extractions;Discrete Applied Mathematics;2023-12

4. REmatch: A Novel Regex Engine for Finding All Matches;Proceedings of the VLDB Endowment;2023-07

5. Efficient Enumeration for Annotated Grammars;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12