%Aigaion2 BibTeX export from Idiap Publications
%Saturday 21 December 2024 04:00:09 PM

@INPROCEEDINGS{Povey_ICASSP_2012,
         author = {Povey, Daniel and Hannemann, Mirko and Boulianne, Gilles and Burget, Lukas and Ghoshal, Arnab and Janda, Milos and Karafiat, Martin and Kombrink, Stefan and Motlicek, Petr and Qian, Yanmin and Riedhammer, Korbinian and Vesely, Karel and Vu, Ngoc Thang},
       projects = {Idiap},
          month = may,
          title = {Generating Exact Lattices in The WFST Framework},
      booktitle = {Proceedings of 2012 IEEE International Conference on Acoustics, Speech and Signal Processing.},
           year = {2012},
          pages = {4213-4216},
      publisher = {IEEE Signal Processing Societ},
       location = {Kyoto, Japan},
   organization = {The 37th International Conference on Acoustics, Speech, and Signal Processing, Kyoto, JP},
           isbn = {978-1-4673-0044-5},
            doi = {10.1109/ICASSP.2012.6288848},
       abstract = {We describe a lattice generation method that is exact, i.e. it satisfies all the natural properties we would want from a lattice of alterna- tive transcriptions of an utterance. This method does not introduce substantial overhead above one-best decoding. Our method is most directly applicable when using WFST decoders where the WFST is “fully expanded”, i.e. where the arcs correspond to HMM transi- tions. It outputs lattices that include HMM-state-level alignments as well as word labels. The general idea is to create a state-level lattice during decoding, and to do a special form of determinization that retains only the best-scoring path for each word sequence. This spe- cial determinization algorithm is a solution to the following problem: Given a WFST A, compute a WFST B that, for each input-symbol- sequence of A, contains just the lowest-cost path through A.},
            pdf = {https://publications.idiap.ch/attachments/papers/2022/Povey_ICASSP_2012.pdf}
}