OpenGrm SFst Background Material

The following is provided as background reading about stochastic finite state transducers and related material.

For material on finite state transducers as well as OpenFst, see the compilation here.

For a presentation of algorithms for weighted automata with failure transitions as used by the operations here, see: Cyril Allauzen and Michael Riley, "Algorithms for Weighted Automata with Failure Transitions", Proceedings of the 23rd International Conference on Implementation and Application of Automata, (CIAA 2018), Charloittetown, PEI. Note this paper makes two simplifying assumptions: (1) a successful path can not end in a failure transition and (2) there are no epsilon transitions when failure transitions are present. Neither limitation is required in this library (failure transitions treat epsilons as defined for a canonical FST).

Michael Riley - 2018-07-17

Topic attachments
I Attachment History Action Size Date Who Comment
PDFpdf ciaa18.pdf r1 manage 362.2 K 2018-07-17 - 00:15 MichaelRiley  
Edit | Attach | Watch | Print version | History: r1 | Backlinks | Raw View | WYSIWYG | More topic actions
Topic revision: r1 - 2018-07-17 - MichaelRiley
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback