Schema-Guided Induction of Monadic Queries

DOI10.1007/978-3-540-88009-7_2zbMath1177.68080OpenAlexW1556908210MaRDI QIDQ3530183

Rémi Gilleron, Aurélien Lemay, Jérôme Champavère, Joachim Niehren

Publication date: 16 October 2008

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

Full work available at URL: https://hal.inria.fr/inria-00309408/file/0.pdf

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Information storage and retrieval of data (68P20)

Related Items (1)

Efficient inclusion checking for deterministic tree automata and XML schemas

Cites Work

• Unnamed Item
• Regular expressions into finite automata
• Corrective feedback and persistent learning for information extraction
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
• Machine Learning: ECML 2004
• Grammatical Inference: Algorithms and Applications
• Rewriting Techniques and Applications
• One-unambiguous regular languages

This page was built for publication: Schema-Guided Induction of Monadic Queries