Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/26392

Title: Fast learning of restricted regular expressions and DTDs
Authors: Freydenberger, Dominik D.
Kotzing, Timo
Issue Date: 2013
Publisher: © Association for Computing Machinery, Inc.
Citation: FREYDENBERGER, D.D. and KÖTZING, T., 2013. Fast learning of restricted regular expressions and DTDs. ACM International Conference Proceeding Series, pp.45-56
Abstract: We study the problem of generalizing from a finite sample to a language taken from a predefined language class. The two language classes we consider are subsets of the regular languages and have significance in the specification of XML documents (the classes corresponding to so called chain regular expressions, Chares, and to single occurrence regular expressions, Sores). The previous literature gave a number of algorithms for generalizing to Sores providing a trade off between quality of the solution and speed. Furthermore, a fast but nonoptimal algorithm for generalizing to Chares is known. For each of the two language classes we give an efficient algorithm returning a minimal generalization from the given finite sample to an element of the fixed language class; such generalizations are called descriptive. In this sense, both our algorithms are optimal. Copyright 2013 ACM.
Description: This paper is closed access.
Version: Published
DOI: 10.1145/2448496.2448504
URI: https://dspace.lboro.ac.uk/2134/26392
Publisher Link: http://dx.doi.org/10.1145/2448496.2448504
ISBN: 9781450315982
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
SubregularLearning-Conf.pdfPublished version342.7 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.