Difference: FstBackground (1 vs. 23)

Revision 232019-03-03 - KyleGorman

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Revision 222016-05-19 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 42 to 42
  Additional references are given with the description of individual algorithms.
Changed:
<
<
  • hbka.pdf: "Speech recognition with weighted finite-state transducers"
>
>
 
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1247533660" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" tmpFilename="/var/tmp/CGItemp12393" user="MichaelRiley" version="4"
META FILEATTACHMENT attachment="hbka.pdf" attr="" comment="" date="1435331920" name="hbka.pdf" path="hbka.pdf" size="330465" user="KyleGorman" version="1"

Revision 212015-06-26 - KyleGorman

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 23 to 23
  For a specific application to speech recognition, see:
  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
Changed:
<
<
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
>
>
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
 
  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley.
Changed:
<
<
"Speech recognition with weighted finite-state transducers".
>
>
"Speech recognition with weighted finite-state transducers".
  In Larry Rabiner and Fred Juang, editors, Handbook on Speech Processing and Speech Communication, Part E: Speech recognition. Springer-Verlag, Heidelberg, Germany, 2008.

The AT&T FSM Library shares many of the same

Line: 42 to 42
  Additional references are given with the description of individual algorithms.
Added:
>
>
  • hbka.pdf: "Speech recognition with weighted finite-state transducers"
 
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1247533660" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" tmpFilename="/var/tmp/CGItemp12393" user="MichaelRiley" version="4"
Added:
>
>
META FILEATTACHMENT attachment="hbka.pdf" attr="" comment="" date="1435331920" name="hbka.pdf" path="hbka.pdf" size="330465" user="KyleGorman" version="1"
META FILEATTACHMENT attachment="csl01.pdf" attr="" comment="" date="1435332614" name="csl01.pdf" path="csl01.pdf" size="319030" user="KyleGorman" version="1"

Revision 202012-03-16 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 23 to 23
  For a specific application to speech recognition, see:
  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
Changed:
<
<
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
>
>
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
 
Line: 38 to 38
  For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.
Changed:
<
<
NEW For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted Finite-State Transducer Library".
>
>
For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted Finite-State Transducer Library".
  Additional references are given with the description of individual algorithms.

Revision 192010-12-12 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 38 to 38
  For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.
Added:
>
>
NEW For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted Finite-State Transducer Library".
 Additional references are given with the description of individual algorithms.

Revision 182010-08-10 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 40 to 40
  Additional references are given with the description of individual algorithms.
Deleted:
<
<
-- Main.Michael Riley - 30 Jul 2007
 
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1247533660" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" tmpFilename="/var/tmp/CGItemp12393" user="MichaelRiley" version="4"

Revision 172010-08-05 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 34 to 34
 For an overview of the design of the OpenFst Library, see: Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary",
Changed:
<
<
Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 11-23. Prague, Czech Republic. Springer.
>
>
Proceedings of the Twelfth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 11-23. Prague, Czech Republic. Springer.
  For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.

Revision 162010-07-30 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 12 to 12
 "Rational Series and Their Languages", Springer-Verlag: Berlin-New York, 1988.
Changed:
<
<
NEW For a survey of weighted automata algorithms see:
>
>
For a survey of weighted automata algorithms see:
 Mehryar Mohri, "Weighted automata algorithms". In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pages 213-254. Springer, 2009.

Revision 152010-01-26 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 12 to 12
 "Rational Series and Their Languages", Springer-Verlag: Berlin-New York, 1988.
Added:
>
>
NEW For a survey of weighted automata algorithms see: Mehryar Mohri, "Weighted automata algorithms". In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pages 213-254. Springer, 2009.
 For a general discussion on the design of an FST library, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
Changed:
<
<
"The Design Principles of a Weighted Finite-State Transducer Library",
>
>
"The Design Principles of a Weighted Finite-State Transducer Library",
 Theoretical Computer Science, 231:17-32, 2000.

For a specific application to speech recognition, see:

  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
Changed:
<
<
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
>
>
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
 
  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley.
Changed:
<
<
Speech recognition with weighted finite-state transducers.
>
>
"Speech recognition with weighted finite-state transducers".
  In Larry Rabiner and Fred Juang, editors, Handbook on Speech Processing and Speech Communication, Part E: Speech recognition. Springer-Verlag, Heidelberg, Germany, 2008.

The AT&T FSM Library shares many of the same

Line: 32 to 36
 "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary", Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 11-23. Prague, Czech Republic. Springer.
Changed:
<
<
NEW For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.
>
>
For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.
  Additional references are given with the description of individual algorithms.

Revision 142009-08-13 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 17 to 17
 "The Design Principles of a Weighted Finite-State Transducer Library", Theoretical Computer Science, 231:17-32, 2000.
Changed:
<
<
For a specific application to speech recognition, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
>
>
For a specific application to speech recognition, see:
  • Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
 "Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
Added:
>
>
  The AT&T FSM Library shares many of the same goals as the OpenFst Library.

Revision 132009-07-14 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 27 to 27
 For an overview of the design of the OpenFst Library, see: Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary",
Changed:
<
<
Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 11-23). Springer. http://www.openfst.org.
>
>
Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 11-23. Prague, Czech Republic. Springer.
  NEW For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.
Line: 36 to 35
  -- Main.Michael Riley - 30 Jul 2007
Changed:
<
<
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1189790409" name="ciaa.pdf" path="ciaa.pdf" size="439327" stream="ciaa.pdf" user="Main.CyrilAllauzen" version="3"
>
>
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1247533660" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" tmpFilename="/var/tmp/CGItemp12393" user="MichaelRiley" version="4"

Revision 122009-06-10 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 30 to 30
 Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 11-23). Springer. http://www.openfst.org.
Changed:
<
<
For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.
>
>
NEW For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.
  Additional references are given with the description of individual algorithms.

Revision 112009-05-31 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 30 to 30
 Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 11-23). Springer. http://www.openfst.org.
Added:
>
>
For a tutorial, see: "OpenFst: An Open-Source, Weighted Finite-State Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.
 Additional references are given with the description of individual algorithms.

-- Main.Michael Riley - 30 Jul 2007

Revision 102008-04-17 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 27 to 27
 For an overview of the design of the OpenFst Library, see: Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary",
Changed:
<
<
Lecture Notes in Computer Science, To appear.
>
>
Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 11-23). Springer. http://www.openfst.org.
  Additional references are given with the description of individual algorithms.

Revision 92007-09-14 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 33 to 33
  -- Main.Michael Riley - 30 Jul 2007
Changed:
<
<
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1186674980" name="ciaa.pdf" path="ciaa.pdf" size="355264" stream="ciaa.pdf" user="Main.CyrilAllauzen" version="2"
>
>
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1189790409" name="ciaa.pdf" path="ciaa.pdf" size="439327" stream="ciaa.pdf" user="Main.CyrilAllauzen" version="3"

Revision 82007-08-09 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 33 to 33
  -- Main.Michael Riley - 30 Jul 2007
Changed:
<
<
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1185832329" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" user="Main.MichaelRiley" version="1"
>
>
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1186674980" name="ciaa.pdf" path="ciaa.pdf" size="355264" stream="ciaa.pdf" user="Main.CyrilAllauzen" version="2"

Revision 72007-07-30 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 25 to 25
 goals as the OpenFst Library.

For an overview of the design of the OpenFst Library, see:

Changed:
<
<
Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojceich Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary",
>
>
Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary",
 Lecture Notes in Computer Science, To appear.

Additional references are given with the description of individual algorithms.

Revision 62007-07-30 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Line: 24 to 24
 The AT&T FSM Library shares many of the same goals as the OpenFst Library.
Changed:
<
<
Additional references are given with the description of individual algorithms.
>
>
For an overview of the design of the OpenFst Library, see: Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojceich Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted Finite-State Transducer LIbrary", Lecture Notes in Computer Science, To appear.
 
Added:
>
>
Additional references are given with the description of individual algorithms.
 
Added:
>
>
-- Main.Michael Riley - 30 Jul 2007
 
Changed:
<
<
-- CyrilAllauzen - 21 Nov 2006
>
>
META FILEATTACHMENT attachment="ciaa.pdf" attr="" comment="" date="1185832329" name="ciaa.pdf" path="ciaa.pdf" size="158250" stream="ciaa.pdf" user="Main.MichaelRiley" version="1"

Revision 52007-06-14 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

OpenFst Background Material

Changed:
<
<
The following material is provided as background reading for those interested in a deeper understanding of finite state transducers. However, it is not necessary to read this material before using the library described here.
>
>
The following material is provided as background reading about finite state transducers. However, it is not necessary to read this material before using the OpenFst Library.
  For the mathematical foundations of the library, the theory of transductions and rational power series, see: Jean Berstel,
Line: 25 to 24
 The AT&T FSM Library shares many of the same goals as the OpenFst Library.
Added:
>
>
Additional references are given with the description of individual algorithms.
 

Revision 42007-06-08 - MichaelRiley

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
Changed:
<
<

FST Background Material

>
>

OpenFst Background Material

  The following material is provided as background reading for those interested in a deeper understanding of finite state transducers. However, it is

Revision 32007-01-17 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

FST Background Material

Line: 14 to 14
 York, 1988.

For a general discussion on the design of an FST library, see:

Changed:
<
<
Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "A Rational Design for a Weighted Finite-State Transducer Library", Lecture Notes in Computer Science, 1436, 1998.
>
>
Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "The Design Principles of a Weighted Finite-State Transducer Library", Theoretical Computer Science, 231:17-32, 2000.
  For a specific application to speech recognition, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,
Changed:
<
<
"Weighted Finite-State Transducers in Speech Recognition" Computer Speech and Language, 16(1):69-88, 2002.
>
>
"Weighted Finite-State Transducers in Speech Recognition", Computer Speech and Language, 16(1):69-88, 2002.
  The AT&T FSM Library shares many of the same goals as the OpenFst Library.

Revision 22006-12-12 - CyrilAllauzen

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

FST Background Material

Line: 22 to 22
 Mohri, Fernando C. N. Pereira, and Michael Riley, "Weighted Finite-State Transducers in Speech Recognition" Computer Speech and Language, 16(1):69-88, 2002.
Changed:
<
<
The AT&T FSM Library shares many of the same goals as the Google FST Library.
>
>
The AT&T FSM Library shares many of the same goals as the OpenFst Library.
 

Revision 12006-11-21 - CyrilAllauzen

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="WebHome"

FST Background Material

The following material is provided as background reading for those interested in a deeper understanding of finite state transducers. However, it is not necessary to read this material before using the library described here.

For the mathematical foundations of the library, the theory of transductions and rational power series, see: Jean Berstel, "Transductions and Context-Free Languages", Teubner Studienbucher: Stuttgart, 1979 and Jean Berstel and Christophe Reutenauer, "Rational Series and Their Languages", Springer-Verlag: Berlin-New York, 1988.

For a general discussion on the design of an FST library, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "A Rational Design for a Weighted Finite-State Transducer Library", Lecture Notes in Computer Science, 1436, 1998.

For a specific application to speech recognition, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "Weighted Finite-State Transducers in Speech Recognition" Computer Speech and Language, 16(1):69-88, 2002.

The AT&T FSM Library shares many of the same goals as the Google FST Library.

-- CyrilAllauzen - 21 Nov 2006

 
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