Can I utilize the GrammarFst scheme in decoding graph built from CTC-topo?
66 views
Skip to first unread message
Lucas Jo
Feb 25, 2022, 11:51:53 PM2/25/22
to kaldi-help
I am trying to use a kaldi decoder by receiving an input from a network trained with ctc loss.
I made a CTC topo instead of H by referring to the method from k2 and CAT project, and using the prepared LG, I succeeded in decoding it into HLG.
However, I want to use GrammarFst here, but I am struggling because there is a left-biphone constraint.
I made a CTC topo instead of H by referring to the method from k2 and CAT project, and using the prepared LG, I succeeded in decoding it into HLG.
However, I want to use GrammarFst here, but I am struggling because there is a left-biphone constraint.
Can I have some guide to do this? Or it is impossible for now?
朱冰清
May 30, 2024, 1:30:26 AMMay 30
to kaldi-help
I have the same problem
Reply all
Reply to author
Forward
0 new messages