Publication | Closed Access
Automatic generation of regular expressions from examples with genetic programming
45
Citations
7
References
2012
Year
Unknown Venue
EngineeringCorpus LinguisticsText MiningNatural Language ProcessingString-searching AlgorithmData ScienceData MiningString ProcessingComputational LinguisticsGrammarLanguage StudiesPractical FeasibilityAutomatic GenerationCode GenerationComputer SciencePattern MatchingInformation ExtractionSemantic ParsingBioinformaticsComputational ScienceProgram AnalysisCombinatorial Pattern MatchingLinguisticsLanguage Generation
We explore the practical feasibility of a system based on genetic programming (GP) for the automatic generation of regular expressions. The user describes the desired task by providing a set of labeled examples, in the form of text lines. The system uses these examples for driving the evolutionary search towards a regular expression suitable for the specified task. Usage of the system should require neither familiarity with GP nor with regular expressions syntax. In our GP implementation each individual represents a syntactically correct regular expression. We performed an experimental evaluation on two different extraction tasks applied to real-world datasets and obtained promising results in terms of precision and recall, even in comparison to an earlier state-of-the-art proposal.
| Year | Citations | |
|---|---|---|
Page 1
Page 1