Document Spanners
From MaRDI portal
Publication:2796400
DOI10.1145/2699442zbMath1333.68098OpenAlexW2141456009MaRDI QIDQ2796400
Stijn Vansummeren, Ronald Fagin, Frederick Reiss, Benny Kimelfeld
Publication date: 24 March 2016
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2699442
Formal languages and automata (68Q45) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Document spanners: from expressive power to decision problems, Enumerating grammar-based extractions, Languages generated by conjunctive query fragments of FC[REG], Matching patterns with variables under edit distance, Counting and enumerating preferred database repairs, The Complexity of Aggregates over Extractions by Regular Expressions, Synchronizing relations on words, Unnamed Item, Document Spanners, Closure properties of synchronized relations, Deterministic regular expressions with back-references, A new text information extraction algorithm of video image under multimedia environment, A logic for document spanners, Formal languages in information extraction and graph databases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Prioritized repairing and consistent query answering in relational databases
- Rewriting of regular expressions and regular path queries
- On the intersection of regex languages with regular languages
- Transductions des langages de Chomsky
- Regular sequence operations and their use in database queries
- Sequences, datalog, and transducers
- Query automata over finite trees
- Parameterized regular expressions and their languages
- Document Spanners
- Graph Logics with Rational Relations and the Generalized Intersection Problem
- Extended Regular Expressions: Succinctness and Decidability
- Expressiveness of structured document query languages based on attribute grammars
- Definable relations and first-order query languages over strings
- Variable Automata over Infinite Alphabets
- On Extended Regular Expressions
- Answer sets for consistent query answering in inconsistent databases
- Database Theory - ICDT 2005
- On Relations Defined by Generalized Finite Automata
- Semantics of context-free languages
- Semantics of context-free languages: Correction
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
