Algorithms for learning regular expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3734 LNAI, Issue , 2005, Pages 297-311

  Fernau, Henning ^a,b  

^a UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; FORMAL LANGUAGES; LEARNING SYSTEMS;

POSITIVE DATA; REGULAR EXPRESSIONS;

LEARNING ALGORITHMS;

EID: 33646519420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564089_24     Document Type: Conference Paper

References (15)

1. H. Ahonen. Disambiguation of SGML content models. In C. Nicholas and D. Wood, eds., Principles of Document Processing PODP'96, volume 1293 of LNCS, pp. 27-37. Springer, 1997.
2. H. Ahonen, H. Mannila, and E. Nikunen. Forming grammars for structured documents: an application of grammatical inference. In R. C. Carrasco and J. Oncina, eds., International Colloquium on Grammatical Inference ICGI'94, volume 862 of LNCS/LNAI, pp. 153-167. Springer, 1994.
3. J. Berstel and L. Boasson. Formal properties of XML grammars and languages. Acta Informatica, 38(9):649-671, August 2002.
4. A.F. Blackwell. SWYN: A visual representation for regular expressions. In H. Lieberman, ed., Your wish is my command: Giving users the power to instruct their software, pp. 245-270. Morgan Kaufmann, 2001.
5. A. Brazma. Efficient learning of regular expressions from approximate examples. In R. Greiner, T. Petsche, and S. J. Hanson, eds., Computational Learning Theory and Natural Learning Systems, Vol. IV: Making Learning Systems Practical, chapter 19, pp. 337-352. Cambridge (MA) USA: MIT Press, 1997.
6. Y. D. Chung, J. W. Kim, and M. H. Kim. Efficient preprocessing of XML queries using structured signatures. Information Processing Letters, 87:257-264, 2003.
7. CZ-Redaktion. Maschinenmenschen plaudern per XML mit der Unternehmens-IT. Computer Zeitung, (50):30, December 2000.
8. H. Fernau. Learning XML grammars. In P. Perner, ed., Machine Learning and Data Mining in Pattern Recognition MLDM'01, volume 2123 of LNCS/LNAI, pp. 73-87. Springer, 2001.
9. M. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, and K. Shim. XTRACT: learning document type descriptors from XML document collections. Data Mining and Knowledge Discovery, 7:23-56, 2003.
10. E. M. Gold. Language identification in the limit. Information and Control (now Information and Computation), 10:447-474, 1967.
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading (MA) USA: Addison-Wesley, 1979.
12. Ph. D. Laird. Learning from Good and Bad Data. Norwell (MA) USA: Kluwer Academic Publishers, 1988.
13. C. G. Nevill-Manning and I. H. Witten. Online and offline heuristics for inferring hierarchies of repetitions in sequences. Proc. IEEE, 88:1745-1755, 2000.
14. T. C. Smith, I. H. Witten, J. G. Cleary, and S. Legg. Objective evaluation of inferred context-free grammars. In Proc. Australian and New Zealand Conference on Intelligent Information Systems, Brisbane, Australia, November 1994.
15. M. van Zaanen. Bootstrapping Structure into Language: Alignment-Based Learning. PhD, School of Computing, University of Leeds, UK, September 2001.