The Complexity of Aggregates over Extractions by Regular Expressions
Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from text. In turn, the class of regular document spanners is the closure of the regex formulas under the Relational Algebra. We investigate the...
Main Authors: | Johannes Doleschal, Benny Kimelfeld, Wim Martens |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2023-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/8623/pdf |
Similar Items
-
Weight Annotation in Information Extraction
by: Johannes Doleschal, et al.
Published: (2022-01-01) -
A Trichotomy for Regular Trail Queries
by: Wim Martens, et al.
Published: (2023-12-01) -
Most Complex Regular Ideal Languages
by: Janusz Brzozowski, et al.
Published: (2016-10-01) -
Regular Cost Functions, Part I: Logic and Algebra over Words
by: Thomas Colcombet
Published: (2013-08-01) -
Fine-Grained Complexity of Regular Path Queries
by: Katrin Casel, et al.
Published: (2023-11-01)