RegExpMiner: Automatically discovering frequently matching regular expressions - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Poster Year : 2014

RegExpMiner: Automatically discovering frequently matching regular expressions

Abstract

Regular expressions (REs) are a widely used tool when con- sidering textual data. They are, for instance, commonly used as search templates, or to check the validity of a piece of text w.r.t. some formatting requirements. Such applications typically rely on very small amounts of hand-crafted REs. However, automatically constructing REs matching with a large amount of string examples (e.g., a set of attribute values in a database) would help characterizing the formatting rules underlying these strings with no a priori knowledge, and would allow envisaging new RE-based applications. We propose to formulate the problem of dis- covering such REs as a frequent pattern mining problem.
Fichier principal
Vignette du fichier
FinalPosterDMNLP2014.pdf (196.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01054922 , version 1 (21-03-2019)

Identifiers

  • HAL Id : lirmm-01054922 , version 1

Cite

Julien Rabatel, Jérôme Azé, Pascal Poncelet, Mathieu Roche. RegExpMiner: Automatically discovering frequently matching regular expressions. DMNLP 2014 - 1st International Workshop on Interactions between Data Mining and Natural Language Processing, Sep 2014, Nancy, France. , Proceedings of the 1st International Workshop on Interactions between Data Mining and Natural Language Processing co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2014), CEUR Workshop Proceedings (1202), pp.143-144, 2014. ⟨lirmm-01054922⟩
321 View
82 Download

Share

Gmail Facebook X LinkedIn More