Enumerating grammar-based extractions

DOI10.1016/j.dam.2023.08.014OpenAlexW4386583072MaRDI QIDQ6069180

Liat Peterfreund

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.014

zbMATH Keywords

regular expressionscontext-free grammarspushdown automatainformation extractiondocument spannersconstant-delay enumeration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of data (68Pxx) Theory of computing (68Qxx)

Cites Work

• General context-free recognition in less than cubic time
• Document spanners: from expressive power to decision problems
• A logic for document spanners
• Characterising REGEX languages by regular languages equipped with factor-referencing
• Document Spanners
• Declarative Cleaning of Inconsistencies in Information Extraction
• Recursive Programs for Document Spanners
• Document Spanners: From Expressive Power to Decision Problems.
• Multiplying matrices faster than coppersmith-winograd
• SVM Based Learning System for Information Extraction
• Semantics of context-free languages
• An efficient context-free parsing algorithm
• Definability in the monadic second-order theory of successor
• Semantics of context-free languages: Correction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating grammar-based extractions