Kvíz spojený s průvodcem · Střední úroveň
Wav2Letter konvoluční ASR kvíz
Posuďte akustický design wav2letter a cíl ASG s rozdíly mezi původními experimenty, pozdějšími nástroji C++ a receptivními poli.
Otázka 1 z 8
Which architecture defines the original wav2letter acoustic network?
Náhled každé otázky8 otázky
Odpovědi a vysvětlení se zobrazují, jak budete v kvízu.
- Which architecture defines the original wav2letter acoustic network?
- A recurrent-only network
- A decision-tree ensemble
- A Gaussian-mixture-only acoustic network
- A convolutional network without recurrent acoustic connections
- Which research organization is associated with the original 2016 wav2letter paper?
- Google Mozek
- Microsoft Výzkum
- Facebook AI Research
- NVIDIA
- Which output representation does the original wav2letter acoustic model predict from its studied speech inputs?
- Only an intermediate human-labeled phoneme transcript
- Letters or graphemes
- Only a list of speaker names
- Only a global tempo value
- Jak se liší původní ztráta AutoSegCriterion (ASG) od běžnější ztráty CTC?
- Odstraňuje prázdný symbol a přímo modeluje přechody písmen
- Vyžaduje ruční zarovnání po jednotlivých snímcích
- Funguje pouze s RNN
- Neumí zpracovat sekvence s proměnnou délkou
- What computation difference does a convolutional acoustic stack offer compared with a conventional recurrent dependency across time?
- Every complete speech decoder becomes fully parallel
- No labeled transcription data is needed for its supervised objective
- Convolution operations can be evaluated across positions without that recurrent chain
- Every workload necessarily obtains zero transcription error
- Which C++ machine-learning library documents ASR applications formerly associated with the wav2letter project?
- scikit-learn only
- An audio-compression format
- A required spelling dictionary standard
- Svítilna
- Which tensor library does the later wav2letter++ paper identify for its C++ framework?
- ArrayFire
- A required Java virtual machine
- Only the original Torch7 runtime
- A fixed spreadsheet engine
- For two length-three temporal convolutions at stride one and dilation one with no padding or intervening operation, how many original positions can one second-layer output depend on?
- tři
- Pět
- Šest
- Devět