Learning (k, L)-Contextual Tree Languages for Information Extraction
Abstract
This paper introduces a novel method for learning a wrapper for extraction of text nodes from web pages based upon ( k , l )-contextual tree languages. It also introduces a method to learn good values of k and l based on a few positive and negative examples. Finally, it describes how the algorithm can be integrated in a tool for information extraction.
Cite
Text
Raeymaekers et al. "Learning (k, L)-Contextual Tree Languages for Information Extraction." European Conference on Machine Learning, 2005. doi:10.1007/11564096_31Markdown
[Raeymaekers et al. "Learning (k, L)-Contextual Tree Languages for Information Extraction." European Conference on Machine Learning, 2005.](https://mlanthology.org/ecmlpkdd/2005/raeymaekers2005ecml-learning/) doi:10.1007/11564096_31BibTeX
@inproceedings{raeymaekers2005ecml-learning,
title = {{Learning (k, L)-Contextual Tree Languages for Information Extraction}},
author = {Raeymaekers, Stefan and Bruynooghe, Maurice and Van den Bussche, Jan},
booktitle = {European Conference on Machine Learning},
year = {2005},
pages = {305-316},
doi = {10.1007/11564096_31},
url = {https://mlanthology.org/ecmlpkdd/2005/raeymaekers2005ecml-learning/}
}