Profiling relational data: a survey

Z Abedjan, L Golab, F Naumann - The VLDB Journal, 2015 - Springer
Profiling data to determine metadata about a given dataset is an important and frequent
activity of any IT professional and researcher and is necessary for various use-cases. It …

[KNIHA][B] Grammatical inference: learning automata and grammars

C De la Higuera - 2010 - books.google.com
The problem of inducing, learning or inferring grammars has been studied for decades, but
only in recent years has grammatical inference emerged as an independent field with …

[PDF][PDF] Regular expression learning for information extraction

Y Li, R Krishnamurthy, S Raghavan… - Proceedings of the …, 2008 - aclanthology.org
Regular expressions have served as the dominant workhorse of practical information
extraction for several years. However, there has been little work on reducing the manual …

Inference of regular expressions for text extraction from examples

A Bartoli, A De Lorenzo, E Medvet… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
A large class of entity extraction tasks from text that is either semistructured or fully
unstructured may be addressed by regular expressions, because in many practical cases …

Concave penalized estimation of sparse Gaussian Bayesian networks

B Aragam, Q Zhou - The Journal of Machine Learning Research, 2015 - dl.acm.org
We develop a penalized likelihood estimation framework to learn the structure of Gaussian
Bayesian networks from observational data. In contrast to recent methods which accelerate …

Mining input grammars from dynamic control flow

R Gopinath, B Mathis, A Zeller - Proceedings of the 28th acm joint …, 2020 - dl.acm.org
One of the key properties of a program is its input specification. Having a formal input
specification can be critical in fields such as vulnerability analysis, reverse engineering …

Ensuring the correctness of regular expressions: A review

LX Zheng, S Ma, ZX Chen, XY Luo - International Journal of Automation …, 2021 - Springer
Regular expressions are widely used within and even outside of computer science due to
their expressiveness and flexibility. However, regular expressions have a quite compact and …

Synthesizing regular expressions from examples for introductory automata assignments

M Lee, S So, H Oh - Proceedings of the 2016 ACM SIGPLAN …, 2016 - dl.acm.org
We present a method for synthesizing regular expressions for introductory automata
assignments. Given a set of positive and negative examples, the method automatically …

Learning deterministic regular expressions for the inference of schemas from XML data

GJ Bex, W Gelade, F Neven… - ACM Transactions on the …, 2010 - dl.acm.org
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML
documents essentially reduces to learning deterministic regular expressions from sets of …

[PDF][PDF] Inference of concise DTDs from XML data

GJ Bex, F Neven, T Schwentick, K Tuyls - 2006 - documentserver.uhasselt.be
We consider the problem to infer a concise Document Type Definition (DTD) for a given set
of XML-documents, a problem which basically reduces to learning of concise regular …