Grammars for Document Spanners - Archive ouverte HAL Access content directly
Conference Papers Year :

Grammars for Document Spanners

(1, 2, 3)


We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied formalisms for document spanners are mainly based on regular expressions, we use an extension of context-free grammars, called extraction grammars, to define the new class of context-free spanners. Extraction grammars are simply context-free grammars extended with variables that capture interval positions of the document, namely spans. While regular expressions are efficient for tokenizing and tagging, context-free grammars are also efficient for capturing structural properties. Indeed, we show that context-free spanners are strictly more expressive than their regular counterparts. We reason about the expressive power of our new class and present a pushdown-automata model that captures it. We show that extraction grammars can be evaluated with polynomial data complexity. Nevertheless, as the degree of the polynomial depends on the query, we present an enumeration algorithm for unambiguous extraction grammars that, after quintic preprocessing, outputs the results sequentially, without repetitions, with a constant delay between every two consecutive ones.
Fichier principal
Vignette du fichier
mainArxiv.pdf (706.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03104144 , version 1 (08-01-2021)


  • HAL Id : hal-03104144 , version 1


Liat Peterfreund. Grammars for Document Spanners. ICDT 2021 - 24th International Conference on Extending Database Technology, Mar 2021, Nicosia / Virtual, Cyprus. ⟨hal-03104144⟩
42 View
69 Download


Gmail Facebook Twitter LinkedIn More