Challenge: Existing methods for extracting product information are resource-intensive and computationally prohibitive due to website structure differences and numerous non-product pages.
Approach: They propose a modular method that leverages low-cost classification models to filter out company web pages.
Outcome: The proposed method improves on a new dataset of 7000 product and non-product web pages and reduces computational time and costs.

Similar Papers

PLAtE: A Large-scale Dataset for List Page Web Extraction (2023.acl-industry)

Copied to clipboard

Challenge: Existing methods for web extraction are limited by the limited number of available large-scale datasets.
Approach: They introduce a dataset that focuses on shopping data and a list page web extraction task.
Outcome: The proposed dataset is the first large-scale list page web extraction dataset . it contains 52,898 items and 156,014 attributes, making it the first dataset based on this task .
Is it out yet? Automatic Future Product Releases Extraction from Web Data (2022.emnlp-industry)

Copied to clipboard

Challenge: Identifying product releases in advance is valuable for E-Commerce marketplaces and retailers.
Approach: They propose a ML-powered pipeline to automatically identify future product releases from web data.
Outcome: The proposed pipeline can identify future product releases and rank their predicted demand from unstructured web pages.
Beyond a Single Extractor: Re-thinking HTML-to-Text Extraction for LLM Pre-training (2026.findings-eacl)

Copied to clipboard

Challenge: Existing open-source datasets predominantly apply a single fixed extractor to all webpages.
Approach: They propose to take a Union over different extractors to improve model performance . they show that extractor choice can significantly impact downstream task performance based on content type .
Outcome: The proposed approach can increase the token yield of DCLM-Baseline by 71% while maintaining benchmark performance.
Extracting Shopping Interest-Related Product Types from the Web (2023.findings-acl)

Copied to clipboard

Challenge: Existing e-commerce products are limited in their ability to assist customers in interest-oriented shopping.
Approach: They propose to extract PTs from Web pages containing hand-crafted PT recommendations for SIs . they propose to use tree-transformer encoders for node classification to improve inter-node dependency modeling .
Outcome: The proposed model outperforms the best baseline model by 2.37 F1 points on a WebPT dataset.
Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)

Copied to clipboard

Challenge: Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers.
Approach: They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT.
Outcome: The proposed model has been successfully integrated into a commercial web search engine as of February 2024.
LMDX: Language Model-based Document Information Extraction and Localization (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models have revolutionized Natural Language Processing but their application in extracting information from visually rich documents has not been successful.
Approach: They propose a language model-based document information extraction and localization methodology to reframe the document information extract task for a LLM.
Outcome: The proposed method enables extraction of singular, repeated, and hierarchical entities with and without training data.
Multi-modal Information Extraction from Text, Semi-structured, and Tabular Data on the Web (2020.acl-tutorials)

Copied to clipboard

Challenge: a tutorial explores the commonalities in the challenges and solutions developed to address information extraction from the World Wide Web.
Approach: This tutorial examines methods for extracting information from the World Wide Web . it explores the commonalities in the challenges and solutions developed to address these different forms of text .
Outcome: This paper examines the commonalities in the challenges and solutions developed to address the World Wide Web.
Neural Network based Extreme Classification and Similarity Models for Product Matching (N18-3)

Copied to clipboard

Challenge: Matching a seller listed item to an appropriate product has become a fundamental step for e-commerce platforms.
Approach: They propose to use a shallow neural network to match a seller's item to an appropriate product . they also propose a similarity approach based on deep siamese network to train and infer product information.
Outcome: The proposed models outperform the baseline models by more than 5% in terms of accuracy and are capable of efficient training and inference.
Small Models, Big Insights: Leveraging Slim Proxy Models To Decide When and What to Retrieve for LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to determine the knowledge an LLM already possesses and the knowledge that requires the help of a search engine are expensive and require excessive computational costs.
Approach: They propose a slim proxy model that detects missing knowledge in LLMs with a proxy model and use it to perform retrieval for the missing knowledge.
Outcome: The proposed approach detects missing knowledge in LLMs with a slim proxy model and takes its answers as heuristic answers.
Schema-Driven Information Extraction from Heterogeneous Tables (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing work on information extraction from tables has focused on developing custom pipelines for each table collection.
Approach: They propose a task that transforms tabular data into structured records following a human-authored schema.
Outcome: The proposed task achieves F1 scores ranging from 74.2 to 96.1 while maintaining cost efficiency.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations