Evaluation Results

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In order to evaluate the performance of the suggested anchor-based algorithm in reducing the computational complexity, the size of the search space and the KWS performance were calculated for the anchor-based search and compared to an exhaustive search. The reduction in computational complexity was determined by measuring the average runtime for processing an input phoneme string and then retrieving the keywords using a standard server. The relative decrease in runtime was measured rather than absolute figures (which may change depending on the server used).

Original languageEnglish
Title of host publicationSpringerBriefs in Speech Technology
PublisherSpringer Science and Business Media B.V.
Pages35-43
Number of pages9
DOIs
Publication statusPublished - 2013
Externally publishedYes

Publication series

NameSpringerBriefs in Speech Technology
ISSN (Print)2191-737X
ISSN (Electronic)2191-7388

Keywords

  • Benchmark Text
  • Exhaustive Search
  • Phoneme String
  • Single Threshold
  • Threshold-based Decision

Fingerprint

Dive into the research topics of 'Evaluation Results'. Together they form a unique fingerprint.

Cite this