Idanwo ti o sopọ mọ itọsọna · Alabọde Ipele

Ìdánwò titete monotonic Glow-TTS

Check how Glow-TTS uses monotonic alignment search and a duration predictor to synthesize speech in parallel, without an external aligner.

Jẹmọ itọsọna awọn ọnaGlow Tts Monotonic titete
Ibeere 1 ti 8

Kini iṣoro pẹlu TTS ti o da lori akiyesi Glow-TTS ṣe ifọkansi lati ṣatunṣe?

Awotẹlẹ gbogbo ibeere8 ibeere

Awọn idahun ati awọn alaye han bi o ṣe n mu ibeere naa.

  1. Kini iṣoro pẹlu TTS ti o da lori akiyesi Glow-TTS ṣe ifọkansi lati ṣatunṣe?
    • Foju tabi atunwi awọn ọrọ lori awọn gbolohun ọrọ gigun
    • Ohun ti o dakẹ ju
    • Ailagbara lati lo GPU kan
    • Aini koodu koodu
  2. Kini MAS duro fun ni Glow-TTS?
    • Mel Audio Synthesis
    • Iwadi Iṣatunṣe monotonic
    • Olona-Akiyesi System
    • Apọjuwọn akositiki Sampler
  3. Kini idi ti titete nilo lati jẹ monotonic?
    • Lati jẹ ki ohun naa pariwo
    • Lati dinku iwọn faili
    • Nitoripe a ka ọrọ ni aṣẹ osi-si-ọtun lori akoko
    • Lati ṣe atilẹyin ọpọ awọn agbohunsoke
  4. Iru decoder wo ni Glow-TTS lo lati ṣe awoṣe awọn iwoye?
    • Nẹtiwọọki akiyesi loorekoore
    • A convolutional classifier
    • Awoṣe ede transformer
    • A normalizing sisan
  5. Ni akoko itọkasi, bawo ni Glow-TTS ṣe pinnu bawo ni ami-ọrọ ọrọ kọọkan ṣe pẹ to?
    • Iye akoko asọtẹlẹ asọtẹlẹ jade awọn iṣiro fireemu fun ami-ami kan
    • O nṣiṣẹ MAS lẹẹkansi lori ohun
    • O guesses laileto
    • O nlo gbohungbohun
  6. Kini anfani ti o wulo ti Glow-TTS ti kii ṣe autoregressive?
    • Ko nilo igbewọle ọrọ
    • O le ṣe ina gbogbo awọn fireemu ni afiwe fun iṣelọpọ iyara
    • Ko le ṣakoso ipolowo
    • O ṣiṣẹ offline nikan
  7. What does the surjective-alignment assumption mean in Glow-TTS?
    • Each speech frame maps to multiple languages
    • Some text tokens must be skipped
    • Every text token maps to at least one speech frame
    • The output audio has no frame sequence
  8. How does Glow-TTS find a likely alignment during training?
    • A human marks every phoneme-frame pair by hand
    • It randomly permutes the text tokens
    • A waveform classifier chooses a speaker identity
    • Dynamic programming searches for the most probable valid monotonic path