Recursive Programs for Document Spanners

DOI10.4230/LIPICS.ICDT.2019.13MaRDI QIDQ5091124zbMATH OpenOpenAlexFDO

Authors Liat Peterfreund, Balder ten Cate, Ronald Fagin, Benny Kimelfeld

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1712.08198

zbMATH Keywords

Datalogdocument spannersinformation extractionpolynomial timerecursionregular expressions

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A logic for document spanners
• A logic for document spanners
• scientific article; zbMATH DE number 7650989
• Document spanners: from expressive power to decision problems
• Document Spanners: From Expressive Power to Decision Problems.
• scientific article; zbMATH DE number 1940296
• Constant-delay enumeration for nondeterministic document spanners
• scientific article; zbMATH DE number 3963179
• Recursive modules for programming

Cited in

(14)

• Formal languages in information extraction and graph databases
• Document Spanners: From Expressive Power to Decision Problems.
• scientific article; zbMATH DE number 7650989 (Why is no real title available?)
• Enumerating grammar-based extractions
• The Complexity of Aggregates over Extractions by Regular Expressions
• A general information extraction framework based on formal languages
• Skyline operators for document spanners
• Refl-spanners: a purely regular approach to non-regular core spanners
• A purely regular approach to non-regular core spanners
• Grammars for document spanners
• The complexity of aggregates over extractions by regular expressions
• The theory of concatenation over finite models
• A framework for extraction and transformation of documents
• FC-Datalog as a framework for efficient string querying

This page was built for publication: Recursive Programs for Document Spanners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091124)