Distant-Supervised Slot-Filling for E-Commerce Queries
Saurav Manchanda, Mohit Sharma, George Karypis

TL;DR
This paper introduces distant-supervised probabilistic models for slot-filling in e-commerce queries, eliminating the need for manual annotation by leveraging query logs and purchase data, resulting in improved retrieval and classification performance.
Contribution
The paper presents novel distant-supervised probabilistic models that utilize query logs and purchase data for slot-filling without manual labels in e-commerce.
Findings
Achieved up to 156% improvement over Okapi BM25 in retrieval performance.
Leveraging co-occurrence information enhances both retrieval and slot classification.
Models effectively identify product characteristics without manual annotation.
Abstract
Slot-filling refers to the task of annotating individual terms in a query with the corresponding intended product characteristics (product type, brand, gender, size, color, etc.). These characteristics can then be used by a search engine to return results that better match the query's product intent. Traditional methods for slot-filling require the availability of training data with ground truth slot-annotation information. However, generating such labeled data, especially in e-commerce is expensive and time-consuming because the number of slots increases as new products are added. In this paper, we present distant-supervised probabilistic generative models, that require no manual annotation. The proposed approaches leverage the readily available historical query logs and the purchases that these queries led to, and also exploit co-occurrence information among the slots in order to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
