Public tools
JCLTS
JCLTS is a toolkit which uses joint-multigram model plus CRF to generate predictions of a stream given another stream. The JMM is responsible for a simple model to obtain raw alignment of the two streams, and the CRF is used to train a powerful model based on the alignment. ref to:Dong Wang, Simon King, "Letter-to-Sound Pronunciation Prediction using Conditional Random Field", IEEE Signal Processing Letters, vol 18, no.2, February 2011 , pp 122-125.
GFCC
Time domain gamma tone cepstral coefficient (GFCC) provided by Jun Qi, EE dep. Tsinghua Univ., China. ref to:"Auditory feature based on Gammatone filters for robust speech recognition", ISCAS 2013.
FSTi
This FSTi tookit contains a set of indexing tools developed in CSLT, Tsinghua University. The main purpose of FSTi is to provide a quick and easy way to construct an entire STD system when combining with some standard tools, including: HTK from Cambridge: http://htk.eng.cam.ac.uk/ lattice-tool from SRI: http://www-speech.sri.com/projects/srilm/manpages/lattice-tool.1.html OpenFST: http://www.openfst.org/twiki/bin/view/FST/WebHome
FSTi provides three integration approaches, any can be used to construct a full practical STD system:
1. HTK + lat2fst: standard FST-based indexing[2,3] (liblse from BUT required).
2. HTK + lattice-tool + ridx: standard ngram indexing[4].
3. HTK + lattice-tool + ngram2fst: ngram-based FST indexing[1].
For more details, please refer to the following paper on Interspeech[1]. [1] Chao Liu, Dong Wang, "N-gram FST indexing for spoken term detection", Interspeech 2012.
HCNSC
We publish the heterogeneous CNSC code plus an example task on speech separation. For details please refer to Heterogeneous convolutive non-negative sparse coding. Dong Wang, Javier Tejedor, submiited to Interspeech. This fold contains the following directory: 1. olcnsc. The core of online convolutive non-negative sparse coding, extended with heterogeneous learning 2. utest. An example task for speech separation. This includes a basic invokation example and two scripts that demonstrate how to search for optimal base distributions. 3. util. Some util scripts that assit utest. You can use and distribute this code freely for research purpose. The authors do not take any responsibility for any damage caused by running the code. Any comments, questions, bugs.. are particularly welcome.
Online CNSC
This package contains my matlab code for online learning approach for convolutive non-negative sparse coding (OLCNSC). Refer to the following paper on interspeech 2011: Dong Wang, Nicholas Evans, "Online Pattern Learning for Convolutive Non-negative Sparse Coding"
Crawler based on keywords
This is a crawler which can get the Top-K relevant webpages' contents returned by Search Engine e.g. Bing with keywords e.g. yahoo. This code is implemented by Java. I share the source code in the following website. Please download the jar files, readme document and source code files.
Sina weibo crawler
This is a crawler to get sina weibo's information including body, comments, number of forwards and etc. This code is implemented by Python. I share the source code in the following website. Please download the readme document and source code files.
