Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
6. Evaluation Results
verfasst von : Ami Moyal, Vered Aharonson, Ella Tetariy, Michal Gishri
Erschienen in: Phonetic Search Methods for Large Speech Databases
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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).