专题研究week3languagemodelanddecoding内容摘要：
Viterbi Decoding Decoding 11 WFST : Introduction (1/3) FSA (or FSM) Finite state automata / Finite state machine An FSA “accepts” a set of strings View FSA as a representation of a possibly infinite set of strings Start state(s) bold。 final/accepting states have extra circle. This example represents the infinite set {ab, aab, aaab , . . .} WFST : Introduction (2/3) FSA with edges weighted Like a normal FSA but with costs on the arcs and finalstates Note: cost es after “/”, For final state, “2/1” means final cost 1 on state 2. This example maps “ ab” to (3 = 1 + 1 + 1). WFST : Introduction (3/3) WFST Like a weighted FSA but with two tapes : input and output. Ex. Input tape : “ac” Output tape : “ xz” Cost = + + = WFST Composition Notation: C = A。 B means, C is A posed with B。阅读剩余 0%
本站所有文章资讯、展示的图片素材等内容均为注册用户上传(部分报媒/平媒内容转载自网络合作媒体)，仅供学习参考。
用户通过本站上传、发布的任何内容的知识产权归属用户或原始著作权人所有。如有侵犯您的版权，请联系我们反馈本站将在三个工作日内改正。