Weighted Finite State Transducer (WFST)

Home > Languages > Formal Language > Finite Automata > Weighted Finite State Transducer (WFST)

It is a type of finite automata that assigns a weight to each transition which helps in language modeling and speech recognition.