mlsanityData to 14 Oct 2026

Spoken Term Detection and Relevance Score Estimation using Dot-Product of Pronunciation Embeddings

arXiv 2210.11895 ↗First posted 21 Oct 2022cs.CL cs.SD eess.AScited by 5

Not on the map. Why?

Abstract (arXiv)

The paper describes a novel approach to Spoken Term Detection (STD) in large spoken archives using deep LSTM networks. The work is based on the previous approach of using Siamese neural networks for STD and naturally extends it to directly localize a spoken term and estimate its relevance score. The phoneme confusion network generated by a phoneme recognizer is processed by the deep LSTM network which projects each segment of the confusion network into an embedding space. The searched term is projected into the same embedding space using another deep LSTM network. The relevance score is then computed using a simple dot-product in the embedding space and calibrated using a sigmoid function to predict the probability of occurrence. The location of the searched term is then estimated from the sequence of output probabilities. The deep LSTM networks are trained in a self-supervised manner from paired recognition hypotheses on word and phoneme levels. The method is experimentally evaluated on MALACH data in English and Czech languages.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 21 Oct 2022.

Builds on

5 of 24 references.

References · 5

  1. 2015Deep convolutional acoustic word embeddings using word-pair side informationcited by 27
  2. 2016Discriminative Acoustic Word Embeddings: Recurrent Neural Network-Based Approachescited by 25
  3. 2016Multi-view Recurrent Neural Acoustic Word Embeddingscited by 20
  4. 2018Segmental Audio Word2Vec: Representing Utterances as Sequences of Vectors with Applications in Spoken Term Detectioncited by 17
  5. 2020Wake Word Detection with Alignment-Free Lattice-Free MMIcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1.

5 papers.