InayofuataMwongozo unaofuata
Uainishaji wa Aina ya Muziki
Sauti AI
MWONGOZO WA AI wa Sauti
Connectionist Temporal Classification (CTC) trains sequence models when input frames are available but frame-to-label alignment is unknown.
Sikiliza mwongozo huuInaonyeshwa na AI · ~2 min
It sums over possible paths that collapse to the target sequence.
Graves et al. introduce CTC for unsegmented sequence labeling. The model predicts a distribution over labels plus blank at each input time step; CTC defines a many-to-one map from frame-level paths to target sequences and sums probabilities over all paths that collapse to the target. The approach avoids explicit alignment labels but assumes conditional independence of output distributions across time steps given the input representation.
Speech frames can be aligned to a transcript without manually labeling each frame.
A blank symbol allows separation between repeated output labels.
CTC collapses repeated labels and then removes blank symbols to form an output.
Beam search with a language model can combine acoustic path scores and linguistic context.
Use CTC when unaligned sequence labels are available and the independence assumption is acceptable. Compare greedy and beam decoding on the target vocabulary and language model. The cited paper does not imply CTC is ideal for all streaming or sequence-transduction tasks.
Jarida halali
Hadithi tatu za AI zilizothibitishwa kila asubuhi ya wiki, zimetengenezwa kwa Kiingereza rahisi. Bila malipo daima, hakuna matangazo.
Barua pepe moja kila siku ya wiki. Jiondoe kwa bonyeza moja. Hatutauza au kushiriki anwani yako.
Jijaribu mwenyewe
Maoni ya haraka juu ya kila jibu, na cheti kinachoweza kushirikishwa na kitambulisho kinachoweza kuthibitishwa baada ya kupita kozi.
Changia elimu ya AI bila malipo. AI Understanding ni 501(c)(3) isiyo na faida — hakuna matangazo, hakuna kizuizi cha malipo, daima. Toa mchango
Connectionist Temporal Classification (CTC) trains sequence models when input frames are available but frame-to-label alignment is unknown. It sums over possible paths that collapse to the target sequence.
CTC huruhusu treni ya mtandao kuwasha (sauti, maandishi) jozi bila mtu yeyote kuweka lebo ni fremu ipi inalingana na herufi ipi, kutatua tatizo la upangaji.
Tokeni tupu huruhusu kielelezo kutoa 'hakuna jipya' kwenye fremu na, kwa umakinifu, hutenganisha marudio ya kweli kama L-mbili katika 'hello' kutoka kwa marudio yaliyoporomoka.
CTC defines the target probability as the sum of probabilities of all frame-level paths that collapse to the target transcription. Dynamic programming computes this sum efficiently; the recurrence is a separate computational detail.
Njia mbichi ya kila fremu hutambulishwa kwa kuunganisha kwanza herufi rudufu na kisha kuondoa tokeni zote tupu.
CTC inachukua uhuru wa masharti kwa kila fremu, ambayo hufanya majumuisho kutambulika lakini inamaanisha kuwa hakuna muundo wa lugha uliojengewa ndani.
Endelea kujifunza
Miongozo zaidi imechaguliwa kwa mada hii
InayofuataMwongozo unaofuata
Uainishaji wa Aina ya Muziki
Sauti AI