Line: 1 to 1  

OpenFst Background Material 
Line: 1 to 1  

OpenFst Background Material  
Line: 42 to 42  
Additional references are given with the description of individual algorithms.  
Changed:  
< < 
 
> >  

Line: 1 to 1  

OpenFst Background Material  
Line: 23 to 23  
For a specific application to speech recognition, see:
 
Changed:  
< <  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
> >  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
 
Changed:  
< <  "Speech recognition with weighted finitestate transducers".  
> >  "Speech recognition with weighted finitestate transducers".  
In Larry Rabiner and Fred Juang, editors, Handbook on Speech Processing and Speech Communication, Part E: Speech recognition. SpringerVerlag, 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:  
> > 
 
 
Added:  
> > 

Line: 1 to 1  

OpenFst Background Material  
Line: 23 to 23  
For a specific application to speech recognition, see:
 
Changed:  
< <  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
> >  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
 
Line: 38 to 38  
For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.  
Changed:  
< <  For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted FiniteState Transducer Library".  
> >  For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted FiniteState Transducer Library".  
Additional references are given with the description of individual algorithms. 
Line: 1 to 1  

OpenFst Background Material  
Line: 38 to 38  
For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009.  
Added:  
> >  For the tutorial given at SLT 2010, see: "OpenFst: a General and Efficient Weighted FiniteState Transducer Library".  
Additional references are given with the description of individual algorithms. 
Line: 1 to 1  

OpenFst Background Material  
Line: 40 to 40  
Additional references are given with the description of individual algorithms.  
Deleted:  
< <   Main.Michael Riley  30 Jul 2007  

Line: 1 to 1  

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 FiniteState 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. 1123. 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. 1123. Prague, Czech Republic. Springer.  
For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState Transducer Library and its Applications to Speech and Language", a presentation at NAACL HLT 2009. 
Line: 1 to 1  

OpenFst Background Material  
Line: 12 to 12  
"Rational Series and Their Languages", SpringerVerlag: BerlinNew York, 1988.  
Changed:  
< <  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 213254. Springer, 2009. 
Line: 1 to 1  

OpenFst Background Material  
Line: 12 to 12  
"Rational Series and Their Languages", SpringerVerlag: BerlinNew York, 1988.  
Added:  
> >  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 213254. 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 FiniteState Transducer Library",  
> >  "The Design Principles of a Weighted FiniteState Transducer Library",  
Theoretical Computer Science, 231:1732, 2000.
For a specific application to speech recognition, see:
 
Changed:  
< <  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
> >  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
 
Changed:  
< <  Speech recognition with weighted finitestate transducers.  
> >  "Speech recognition with weighted finitestate transducers".  
In Larry Rabiner and Fred Juang, editors, Handbook on Speech Processing and Speech Communication, Part E: Speech recognition. SpringerVerlag, Heidelberg, Germany, 2008.
The AT&T FSM Library shares many of the same  
Line: 32 to 36  
"OpenFst: A General and Efficient Weighted FiniteState Transducer LIbrary", Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), Lecture Notes in Computer Science, Vol. 4783. pp. 1123. Prague, Czech Republic. Springer.  
Changed:  
< <  For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState Transducer Library and its Applications to Speech and Language", a presentation at HLT 2009.  
> >  For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState 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. 
Line: 1 to 1  

OpenFst Background Material  
Line: 17 to 17  
"The Design Principles of a Weighted FiniteState Transducer Library", Theoretical Computer Science, 231:1732, 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:
 
"Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
Added:  
> > 
 
The AT&T FSM Library shares many of the same goals as the OpenFst Library. 
Line: 1 to 1  

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 FiniteState Transducer LIbrary",  
Changed:  
< <  Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 1123). 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. 1123. Prague, Czech Republic. Springer.  
For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState 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:  
< < 
 
> > 

Line: 1 to 1  

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

OpenFst Background Material  
Line: 30 to 30  
Proceedings of the Ninth International Conference on Implementation and Application of Automata, (CIAA 2007) (pp. 1123). Springer. http://www.openfst.org.  
Added:  
> >  For a tutorial, see: "OpenFst: An OpenSource, Weighted FiniteState 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 
Line: 1 to 1  

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 FiniteState 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. 1123). Springer. http://www.openfst.org.  
Additional references are given with the description of individual algorithms. 
Line: 1 to 1  

OpenFst Background Material  
Line: 33 to 33  
 Main.Michael Riley  30 Jul 2007  
Changed:  
< < 
 
> > 

Line: 1 to 1  

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 FiniteState Transducer LIbrary",  
> >  Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut and Mehryar Mohri, "OpenFst: A General and Efficient Weighted FiniteState Transducer LIbrary",  
Lecture Notes in Computer Science, To appear.
Additional references are given with the description of individual algorithms. 
Line: 1 to 1  

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 FiniteState 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  
> > 

Line: 1 to 1  

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.  
Line: 1 to 1  

 
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 
Line: 1 to 1  

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 FiniteState Transducer Library", Lecture Notes in Computer Science, 1436, 1998.  
> >  Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley, "The Design Principles of a Weighted FiniteState Transducer Library", Theoretical Computer Science, 231:1732, 2000.  
For a specific application to speech recognition, see: Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley,  
Changed:  
< <  "Weighted FiniteState Transducers in Speech Recognition" Computer Speech and Language, 16(1):6988, 2002.  
> >  "Weighted FiniteState Transducers in Speech Recognition", Computer Speech and Language, 16(1):6988, 2002.  
The AT&T FSM Library shares many of the same goals as the OpenFst Library. 
Line: 1 to 1  

FST Background Material  
Line: 22 to 22  
Mohri, Fernando C. N. Pereira, and Michael Riley, "Weighted FiniteState Transducers in Speech Recognition" Computer Speech and Language, 16(1):6988, 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.  
Line: 1 to 1  

Added:  
> > 
FST Background MaterialThe 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 ContextFree Languages", Teubner Studienbucher: Stuttgart, 1979 and Jean Berstel and Christophe Reutenauer, "Rational Series and Their Languages", SpringerVerlag: BerlinNew 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 FiniteState 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 FiniteState Transducers in Speech Recognition" Computer Speech and Language, 16(1):6988, 2002. The AT&T FSM Library shares many of the same goals as the Google FST Library.
 CyrilAllauzen  21 Nov 2006 