Web data extraction: the Smallest Extraction Problem
The Smallest Extraction Problem (SEP) consists in finding the grammar that best describes a set of pages generated from the same HTML template, so as to separate the template from the data and extract the data without supervision. Theses can build on an existing implementation of the inference algorithms. Possible directions:
- Incremental model: update the grammar as new pages arrive and as the template changes, recasting the model in probabilistic terms.
- Efficient inference: make the A* search practical on larger sets of pages, also through a probabilistic formulation of the model.
- From index pages to detail pages: among the links of index and section pages, recognize those that lead to content, follow them and infer the model of the pages they reach.
- Grammars and LLMs: let an LLM make the semantic choices that the structure of the pages alone cannot settle, such as deciding whether a repeated text is data or part of the template, or choosing among grammars of similar cost.
References: paper (PVLDB, 2021) · companion website