Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples

DOI10.1007/11872436_21MaRDI QIDQ3541868zbMATH OpenOpenAlexFDO

Authors Aurélien Lemay, Joachim Niehren, Rémi Gilleron

Publication date 27 November 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11872436_21

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Grammatical Inference: Algorithms and Applications
• Learning sequential tree-to-word transducers
• scientific article; zbMATH DE number 1670727
• Database Programming Languages
• Algorithmic Learning Theory

Cited in

(9)

• On the hardness of learning queries from tree structured data
• scientific article; zbMATH DE number 1670727 (Why is no real title available?)
• Using tree transducers for grammatical inference
• Schema-Guided Induction of Monadic Queries
• Learning dependency transduction models from unannotated examples
• Learning sequential tree-to-word transducers
• Query induction with schema-guided pruning strategies
• Grammatical Inference: Algorithms and Applications
• Learning tree pattern transformations

This page was built for publication: Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541868)