HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

CUNY Systems for the Query-by-Example Search on Speech Task at MediaEval 2015

{Andrew Rosenberg Min Ma}

CUNY Systems for the Query-by-Example Search on Speech Task at MediaEval 2015

Abstract

This paper describes two query-by-example systems developed by Speech Lab, Queens College (CUNY). Our systems aimed to respond with quick search results from the selected reference files. Three phonetic recognizers (Czech, Hungarian and Russian) were utilized to get phoneme sequences of both query and reference speech files. Each query sequence were compared with all the reference sequences using both global and local aligners. In the first system, we predicted the most probable reference files based on the sequence alignment results; In the second system, we pruned out the subsequences from the reference sequences that yielded best local symbolic alignments, then 39-dimension MFCC features were extracted for both query and the subsequences. Both the two systems employed an optimized DTW, and obtained Cnxe of 0.9989 and 1.0674 on the test data respectively.

Benchmarks

BenchmarkMethodologyMetrics
keyword-spotting-on-quesstCUNY [SMO+iSAX] (dev)
ATWV: 0.0011
Cnxe: 0.9988
MTWV: 0.0067
MinCnxe: 0.9872
keyword-spotting-on-quesstCUNY [Subseq+MFCC] (eval)
ATWV: -4.0205
Cnxe: 1.0674
MTWV: 0.0006
MinCnxe: 0.9853
keyword-spotting-on-quesstCUNY [Subseq+MFCC] (dev)
ATWV: -3.9820
Cnxe: 1.0658
MTWV: 0.0123
MinCnxe: 0.9823
keyword-spotting-on-quesstCUNY [SMO+iSAX] (eval)
ATWV: 0.0006
Cnxe: 0.9989
MTWV: 0.0010
MinCnxe: 0.9870

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp