Final Mcq Answers.docx

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17.

B – The Filter B – 25ms B – Noise D – All of the above B – Baum-Welch Algorithm B–3 C – Hybrid System B – Decision Tree Clustering A – Forced Alignment D – Bidirectional Recurrent Neural Network B – Exploding Gradients D – CE A – Scaled Likelihoods C – The Pronunciation Lexicon B – The HMM State Transducer D – None of the Above A – Minimization, B – Determination 18. A – The token’s score falls outside the beam width 19. A – The initial state in the first line of a WFST description is assumed to be the initial state of the graph B – Weights are assumed to be zero unless otherwise specified 20. E – The path’s string is unaffected by this arc.