Skip to Main content Skip to Navigation
New interface
Conference papers

Efficient enumeration algorithms for annotated grammars

Abstract : We introduce annotated grammars, an extension of context-free grammars which allows annotations on terminals. Our model extends the standard notion of regular spanners, and has the same expressiveness as the extraction grammars recently introduced by Peterfreund. We study the enumeration problem for annotated grammars: fixing a grammar, and given a string as input, enumerate all annotations of the string that form a word derivable from the grammar. Our first result is an algorithm for unambiguous annotated grammars, which preprocesses the input string in cubic time and enumerates all annotations with output-linear delay. This improves over Peterfreund's result, which needs quintic time preprocessing to achieve this delay bound. We then study how we can reduce the preprocessing time while keeping the same delay bound, by making additional assumptions on the grammar. Specifically, we present a class of grammars which only have one derivation shape for all outputs, for which we can enumerate with quadratic time preprocessing. We also give classes generalizing regular spanners for which linear time preprocessing suffices.
Complete list of metadata
Contributor : Antoine Amarilli Connect in order to contact the contributor
Submitted on : Thursday, April 28, 2022 - 4:52:57 PM
Last modification on : Thursday, June 2, 2022 - 5:49:45 PM

Links full text


  • HAL Id : hal-03654592, version 1
  • ARXIV : 2201.00549



Antoine Amarilli, Louis Jachiet, Martín Muñoz, Cristian Riveros. Efficient enumeration algorithms for annotated grammars. PODS 2022, Jun 2022, Philadelphie, United States. ⟨hal-03654592⟩



Record views