Learning \((k,l)\)-contextual tree languages for information extraction from web pages

DOI10.1007/S10994-008-5049-7zbMath1470.68160OpenAlexW2126183407MaRDI QIDQ1009259

Jan Van den Bussche, Maurice Bruynooghe, Stefan Raeymaekers

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-008-5049-7

zbMATH Keywords

tree languagesinformation extractionwrapper induction

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Internet topics (68M11)

Related Items (3)

Tree size reduction with keeping distinguishability ⋮ On the Complexity of Extracting Subtree with Keeping Distinguishability ⋮ Learning Tree Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning information extraction rules for semi-structured and free text
• Improved boosting algorithms using confidence-rated predictions
• Inference of Reversible Languages
• Algebraic decision procedures for local testability
• Grammatical Inference: Algorithms and Applications
• Language identification in the limit

This page was built for publication: Learning \((k,l)\)-contextual tree languages for information extraction from web pages