scientific article; zbMATH DE number 7471710

MaRDI QIDQ5028476

Johannes Doleschal, Liat Peterfreund, Benny Kimelfeld, Wim Martens

Publication date: 9 February 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weighted automatainformation extractionprovenance semiringsK-relationsregular document spanners

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (3)

Enumerating grammar-based extractions ⋮ Unnamed Item ⋮ Formal languages in information extraction and graph databases

Uses Software

• ProbLog
• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• A logic for document spanners
• Document Spanners
• An Introduction to Conditional Random Fields
• What’s Decidable about Weighted Automata?
• The Design of Arbitrage-Free Data Pricing Schemes
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Declarative Cleaning of Inconsistencies in Information Extraction
• Semirings and Formal Power Series
• Weighted Automata Algorithms
• Some optimal inapproximability results
• SVM Based Learning System for Information Extraction
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Finding the K Shortest Loopless Paths in a Network
• Probability and Nondeterminism in Operational Models of Concurrency

This page was built for publication: