Learning n-ary node selecting tree transducers from completely annotated examples

Authors:
A. Lemay;J. Niehren;R. Gilleron
Affiliations:
Mostrare project of INRIA Futurs, LIFL, University of Lille 3, Lille, France;Mostrare project of INRIA Futurs, LIFL, INRIA Futurs, Lille, France;Mostrare project of INRIA Futurs, LIFL, University of Lille 3, Lille, France
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 13
Cited 6

Characteristic Sets for Polynomial Grammatical Inference

Machine Learning
Wrapper induction: efficiency and expressiveness

Artificial Intelligence - Special issue on Intelligent internet systems
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Wrapping Web Information Providers by Transducer Induction

EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Regular expression pattern matching for XML

Journal of Functional Programming
Interactive learning of node selecting tree transducer

Machine Learning
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Active learning with strong and weak views: a case study on wrapper induction

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
N-ary queries by tree automata

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Learning (k,l)-contextual tree languages for information extraction

ECML'05 Proceedings of the 16th European conference on Machine Learning
Learning n-ary node selecting tree transducers from completely annotated examples

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Schema-Guided Induction of Monadic Queries

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning n-ary node selecting tree transducers from completely annotated examples

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning twig and path queries

Proceedings of the 15th International Conference on Database Theory
Learning queries for relational, semi-structured, and graph databases

Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Query induction with schema-guided pruning strategies

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first algorithm for learning n-ary node selection queries in trees from completely annotated examples by methods of grammatical inference. We propose to represent n-ary queries by deterministic n-ary node selecting tree transducers (n-NSTTs). These are tree automata that capture the class of monadic second-order definable n-ary queries. We show that n-NSTTs defined polynomially bounded n-ary queries can be learned from polynomial time and data. An application in Web information extraction yields encouraging results.