Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paul Greyson

dblp:356/8350 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0002-7986-7098ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 70% Data integration and cleaning · 30%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning
approximate matching
1.012026
Surface-Form Neural Sparse Retrieval: Robust Fuzzy Matching for Industrial Music Search · SIGIR 2026
Information retrieval › multimedia analysis and retrieval
music retrieval
1.012026
Surface-Form Neural Sparse Retrieval: Robust Fuzzy Matching for Industrial Music Search · SIGIR 2026
Information retrieval › retrieval models › sparse retrieval
sparse neural retrieval
1.012026
Surface-Form Neural Sparse Retrieval: Robust Fuzzy Matching for Industrial Music Search · SIGIR 2026

Methods — techniques the papers use, named apart from their topics

subword tokenization · 1.0sparse retrieval · 1.0IDF weighting · 1.0
YearPublicationVenuePosition
2026 Surface-Form Neural Sparse Retrieval: Robust Fuzzy Matching for Industrial Music Search
abstract
Music search at the scale of Amazon Music presents a unique challenge: queries frequently deviate from indexed metadata due to misspellings, transpositions, and phonetic variations, yet the retrieval system must operate under strict millisecond-level latency constraints. Our existing learning-to-retrieve system, the High Confidence Index (HCI), learns query-entity associations from customer behavior, relying on continual "exploration" to choose candidates. Traditional n-gram matching enables this exploration but suffers from poor semantic robustness and high noise, limiting the system's ability to learn from long-tail queries. In this work, we present a robust neural sparse retrieval system designed to maximize exploration efficiency. We adapt a state-of-the-art inference-free sparse retrieval architecture to the music domain, combining it with an effective domain-specific granular subword tokenization strategy. Our approach utilizes short-length token constraints (max 3 chars) to enforce the learning of surface-form robustness over lexical memorization. By pre-computing the neural embeddings and term expansions during the offline indexing phase, online processing is reduced to minimal tokenization and IDF weighting, achieving effectively zero latency overhead for query encoding. Evaluations on a 6M-document production corpus show an aggregate 91.4% recall@10 (vs. 57.7% for trigrams) at comparable throughput. Simulation of the HCI feedback loop demonstrates improved exploration efficiency, with +0.8% higher stabilized recall than production trigrams. Ablation studies indicate that our sparse training methodology drives the performance gains, while domain-specific pretraining provides a cost-effective alternative to large-scale general-purpose pretraining.
Paul Greyson, Zhichao Geng, Yang Yang 0222
SIGIR1
2023 Optimizing Podcast Discovery: Unveiling Amazon Music's Retrieval and Ranking Framework
abstract
This work presents the search and discovery architecture of Amazon Music, a highly efficient system designed to retrieve relevant music content for users. The architecture consists of three key stages: indexing, retrieval, and ranking. During the indexing stage, data is meticulously parsed and processed to create a comprehensive index that contains dense representations and essential information about each document (such as a music or podcast entity) in the collection, including its title, metadata, and relevant attributes. This indexing process enables fast and efficient data access during retrieval. The retrieval stage utilizes multi-faceted retrieval strategies, resulting in improved identification of candidate matches compared to traditional structured search methods. Subsequently, candidates are ranked based on their relevance to the customer’s query, taking into account document features and personalized factors. With a specific focus on the podcast use case, this paper highlights the deployment of the architecture and demonstrates its effectiveness in enhancing podcast search capabilities, providing tailored and engaging content experiences.
Geetha Sai Aluri, Paul Greyson, Joaquin Delgado
RecSys2