13th Annual Conference of the International Speech Communication Association

Portland, OR, USA
September 9-13, 2012

Word Discovery with Beta Process Factor Analysis

Niklas Vanhainen, Giampiero Salvi

KTH, School of Computer Science and Communication, Department for Speech, Music and Hearing, Stockholm, Sweden

We propose the application of a recently developed non-parametric Bayesian method for factor analysis to the problem of word discovery from continuous speech. The method, based on Beta Process priors, has a number of advantages compared to previously proposed methods, such as Non-negative Matrix Factorisation (NMF). Beta Process Factor Analysis (BPFA) is able to estimate the size of the basis, and therefore the number of recurring patterns, or word candidates, found in the data. We compare the results obtained with BPFA and NMF on the TIDigits database, showing that our method is capable of not only finding the correct words, but also the correct number of words. We also show that the method can infer the approximate number of words for different vocabulary sizes by testing on randomly generated sequences of words.

Index Terms: word discovery, beta process factor analysis, Bayesian nonparametric method, non-negative matrix factorisation

Full Paper

Bibliographic reference.  Vanhainen, Niklas / Salvi, Giampiero (2012): "Word discovery with beta process factor analysis", In INTERSPEECH-2012, 799-802.