{"push_id":682559838,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"4c57798843e64db33257151757b8a77a3ae3a5e1","before":"cae6da1e5e67c499068ca4af967f933257a9bf12","commits":[{"sha":"dd0128d652d3b676e2a649301d065fed3655bbe9","author":{"email":"2f21566485068ea8428cc8c14e7f687c9f9cbe2f@gmail.comu","name":"Pablo Jadzinsky"},"message":"Needs testing but first version is finished. I can't mount afs system\nand can't test it right now. We'll do so ASAP","distinct":true,"url":"https://api.github.com/repos/pjadzinsky/TIMIT_to_Fuel/commits/dd0128d652d3b676e2a649301d065fed3655bbe9"},{"sha":"4c57798843e64db33257151757b8a77a3ae3a5e1","author":{"email":"2f21566485068ea8428cc8c14e7f687c9f9cbe2f@gmail.comu","name":"Pablo Jadzinsky"},"message":"Implemented an input parser to control mfcc parameters and an optional\ncomputation (--hist)\n--hist computes a histogram on phoneme duration. Since I'm thinking in\na simple network that will predict the phoneme based on the\ncurrent mfcc, the simplest idea is that mfcc should be computed\non times comparable to the shortest phoneme duration such that\nshort phonemes contribute primarily to one mfcc.","distinct":true,"url":"https://api.github.com/repos/pjadzinsky/TIMIT_to_Fuel/commits/4c57798843e64db33257151757b8a77a3ae3a5e1"}]}