Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
A flexible learning system for wrapping tables and lists in HTML documents
Proceedings of the 11th international conference on World Wide Web
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Interactive learning of node selecting tree transducer
Machine Learning
Interactive Tuples Extraction from Semi-Structured Data
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Interactive information extraction with constrained conditional random fields
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Wrapper maintenance: a machine learning approach
Journal of Artificial Intelligence Research
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
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Query induction with schema-guided pruning strategies
The Journal of Machine Learning Research
| Hi-index | 0.00 |
The induction of monadic node selecting queries from partially annotated XML-trees is a key task in Web information extraction. We show how to integrate schema guidance into an RPNI-based learning algorithm, in which monadic queries are represented by pruning node selecting tree transducers. We present experimental results on schema guidance by the DTD of HTML.