|
From: Paul D. <pau...@gm...> - 2013-11-06 18:00:53
|
Determinization in the log semiring On Wednesday, 6 November 2013, Lahiru Samarakoon wrote: > Hi Dan, > > I read about avoiding weight pushing in the Kaldi website but I couldn't > find which stage of the graph creation compensates for that. > > My question is How to make them pushed without pushing? and What stage of > graph creation (C++ binary) does it? > > Thanks, > Lahiru > > > On Tue, Nov 5, 2013 at 8:17 PM, Daniel Povey <dp...@gm...> wrote: > >> It's not an encoding change, it's a change in the graph creation >> algorithm so the weights are "already pushed". It has no effect on >> the graph size. The quality should be the same in general (although >> it will be better under some almost-pathological cases). It means >> that you don't have to worry about weight pushing failing. >> Dan >> >> >> On Tue, Nov 5, 2013 at 5:56 AM, Lahiru Samarakoon <lah...@gm...> >> wrote: >> > Hi All, >> > >> > Can anyone briefly explain me the encoding mechanism used in Kaldi >> instead >> > of weight pushing in the decoding graph creation? >> > >> > What is the effect of this change to the final graph size? Is it bigger >> when >> > compared with a graph which uses weight pushing? >> > >> > Thanks, >> > Lahiru >> > >> > >> > >> > >> > >> > >> ------------------------------------------------------------------------------ >> > November Webinars for C, C++, Fortran Developers >> > Accelerate application performance with scalable programming models. >> Explore >> > techniques for threading, error checking, porting, and tuning. Get the >> most >> > from the latest Intel processors and coprocessors. See abstracts and >> > register >> > >> http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk >> > _______________________________________________ >> > Kaldi-users mailing list >> > Kal...@li... >> > https://lists.sourceforge.net/lists/listinfo/kaldi-users >> > >> > > |