Rescoring Keyword Search Confidence Estimates with Graph-Based Re-Ranking Using Acoustic Word Embeddings

Anna Piunova, Eugen Beck, Ralf Schlüter, Hermann Ney


Postprocessing of confidence scores in keyword search (KWS) task is known to be an efficient way of improving retrieval performance. In this paper, we extend the existing graph-based re-ranking algorithm proposed for KWS score calibration. We replace the originally used Dynamic TimeWarping (DTW) distance measure between prospective hits with distances between their Acoustic Word Embeddings (AWEs) learned from Neural Networks. We argue that AWEs trained to discriminate between the same and different words should improve the graph-based re-ranking performance. Experimental results on two languages from IARPA Babel program show that our approach outperforms the DTW and improves the baseline KWS result between 3.0–7.5% relative on the Maximum Term Weighted Value (MTWV) measure. It was previously shown, that enhancing detection lists with keyword exemplars given high confidence, improved the algorithm performance. We additionally expanded the detection lists with negative query exemplars and observed further improvements in MTWV.


 DOI: 10.21437/Interspeech.2019-1817

Cite as: Piunova, A., Beck, E., Schlüter, R., Ney, H. (2019) Rescoring Keyword Search Confidence Estimates with Graph-Based Re-Ranking Using Acoustic Word Embeddings. Proc. Interspeech 2019, 4205-4209, DOI: 10.21437/Interspeech.2019-1817.


@inproceedings{Piunova2019,
  author={Anna Piunova and Eugen Beck and Ralf Schlüter and Hermann Ney},
  title={{Rescoring Keyword Search Confidence Estimates with Graph-Based Re-Ranking Using Acoustic Word Embeddings}},
  year=2019,
  booktitle={Proc. Interspeech 2019},
  pages={4205--4209},
  doi={10.21437/Interspeech.2019-1817},
  url={http://dx.doi.org/10.21437/Interspeech.2019-1817}
}