Document spanners: from expressive power to decision problems
From MaRDI portal
Recommendations
Cites work
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- A logic for document spanners
- Bad news on decision problems for patterns
- Decision problems for patterns
- Declarative cleaning of inconsistencies in information extraction
- Descriptional complexity -- an introductory survey
- Document spanners: a formal approach to information extraction
- Document Spanners: From Expressive Power to Decision Problems.
- Expressiveness and static analysis of extended conjunctive regular path queries
- Extended regular expressions: succinctness and decidability
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Inclusion problems for patterns with a bounded number of variables
- On Context-Free Languages
- On Goedel speed-up and succinctness of language representations
- On the equivalence problem for E-pattern languages
- On the parameterised complexity of string morphism problems
- Parametrized complexity theory.
- Pattern languages with and without erasing
- Pattern matching with variables: a multivariate complexity analysis
- Pattern matching with variables: fast algorithms and new hardness results
- Patterns with bounded treewidth
- Semigroups, Presburger formulas, and languages
- The expressibility of languages and relations by word equations
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- Theory of computation.
Cited in
(27)- Deterministic regular expressions with back-references
- A logic for document spanners
- Document spanners: a formal approach to information extraction
- A logic for document spanners
- Weight annotation in information extraction
- Recursive Programs for Document Spanners
- Constant-delay enumeration for nondeterministic document spanners
- Document Spanners: From Expressive Power to Decision Problems.
- scientific article; zbMATH DE number 7650989 (Why is no real title available?)
- Enumerating grammar-based extractions
- Languages generated by conjunctive query fragments of FC[REG]
- Matching patterns with variables under edit distance
- A closer look at the expressive power of logics based on word equations
- On the structure of solution-sets to regular word equations
- Matching patterns with variables under Simon's congruence
- Languages generated by conjunctive query fragments of FC[REG]
- On the structure of solution sets to regular word equations
- A general information extraction framework based on formal languages
- Regular expressions with backreferences: polynomial-time matching techniques
- 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 theory of concatenation over finite models
- A framework for extraction and transformation of documents
- FC-Datalog as a framework for efficient string querying
- The equivalence problem of E-pattern languages with length constraints is undecidable
- The equivalence problem of E-pattern languages with regular constraints is undecidable
This page was built for publication: Document spanners: from expressive power to decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650917)
