Gaussian subtraction (GS) algorithms for word spotting in continuous speech

Avi Faizakov, Arnon Cohen, Tzur Vaich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, a novel approach for the design of cohort models for word spotting in continuous speech is presented. This new approach is based on modifying the probability density function of a conventional filler so that regions in the feature space that are related to the keyword will be reduced or removed. By modifying these regions, the filler and keyword models become more orthogonal in the sense that they represent different areas in the feature space, making the filler appropriate to be used as a cohort model. The algorithms, named Gaussian Subtraction (GS) and Gaussian Removal (GR), may be considered discriminative training algorithms.

Original languageEnglish
Title of host publicationEUROSPEECH 2001 - SCANDINAVIA - 7th European Conference on Speech Communication and Technology
EditorsBorge Lindberg, Henrik Benner, Paul Dalsgaard, Zheng-Hua Tan
PublisherInternational Speech Communication Association
Pages1793-1796
Number of pages4
ISBN (Electronic)8790834100, 9788790834104
StatePublished - 1 Jan 2001
Event7th European Conference on Speech Communication and Technology - Scandinavia, EUROSPEECH 2001 - Aalborg, Denmark
Duration: 3 Sep 20017 Sep 2001

Publication series

NameEUROSPEECH 2001 - SCANDINAVIA - 7th European Conference on Speech Communication and Technology

Conference

Conference7th European Conference on Speech Communication and Technology - Scandinavia, EUROSPEECH 2001
Country/TerritoryDenmark
CityAalborg
Period3/09/017/09/01

ASJC Scopus subject areas

  • Communication
  • Linguistics and Language
  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'Gaussian subtraction (GS) algorithms for word spotting in continuous speech'. Together they form a unique fingerprint.

Cite this