Statistical Language Models within the Algebra of Weighted Rational Languages

Keywords

Alphabet, Computer science, Finite-state machine, Automaton, Implementation

References

• A weight pushing algorithm for large vocabulary speech recognitionMehryar Mohri, Michael Riley — 2001
• Semirings, Automata and LanguagesWerner Kuich, Arto Salomaa — 1985
• Transducer composition for context-dependent network expansionMichael Riley, Fernando Pereira, Mehryar Mohri — 1997
• On a combinatorical problemC. Hyltén-Cavallius — 1958
• Statistical methods for speech recognitionDon X. Sun, Frederick Jelinek — 1997
• Interpolated estimation of Markov source parameters from sparse dataF. Jelinek — 1980
• Semirings, Automata, LanguagesWerner Kuich, Arto Salomaa — 1985
• A Maximum Likelihood Approach to Continuous Speech RecognitionL.R. Bahl, Frederick Jelinek, Robert L. Mercer — 1983
• Computational analysis of present-day American EnglishHenry Kučera, W. Nelson Francis, W. F. Twaddell — 1967
• Minimization algorithms for sequential transducersMehryar Mohri — 2000
• On transformations of formal power seriesManfred Droste, Guo‐Qiang Zhang — 2003
• Minimisation of Acyclic Deterministic Automata in Linear TimeDominique Revuz — 1992
• Simpler and More General Minimization for Weighted Finite-State AutomataJason Eisner — 2003
• Prediction and Entropy of Printed EnglishClaude E. Shannon — 1951
• An Empirical Study of Smoothing Techniques for Language ModelingStanley F. Chen, Joshua Goodman — 1996
• Efficient string matchingAlfred V. Aho, Margaret J. Corasick — 1975
• The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compressionIan H. Witten, Tim Bell — 1991
• Semiring Frameworks and Algorithms for Shortest-Distance ProblemsMehryar Mohri — 2002
• Generalized Algorithms for Constructing Statistical Language ModelsCyril Allauzen, Mehryar Mohri, Brian Roark — 2003
• Estimation of probabilities from sparse data for the language model component of a speech recognizerSlava M. Katz — 1987

Cited by

• More than Words: Using Token Context to Improve Canonicalization of Historical GermanBryan Jurish — 2010
• Finite-state canonicalization techniques for historical GermanBryan Jurish — 2011
• Bimorphism Machine TranslationDaniel Quernheim — 2016
• fsm2 - A Scripting Language Interpreter for Manipulating Weighted Finite-State AutomataT. Hanneforth — 2009

Related papers

• Context-Free Recognition with Weighted AutomataCorinna Cortes, Mehryar Mohri — 2000
• Handbook of Weighted AutomataManfred Droste, Werner Kuich, Heiko Vogler — 2009
• Rational transductions and complexity of counting problemsChristian Choffrut, Massimiliano Goldwurm — 1992
• Automata Learning: An Algebraic ApproachHenning Urbat, Schröder, Lutz — 2019
• Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, ProceedingsÓscar H. Ibarra, Zhe Dang — 2006
• The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free LanguagesManfred Droste, Heiko Vogler — 2012
• Exploring the Relationship between the Structural and the Actual Similarities of AutomataPetr Grachev, Roman Bezborodov, Ivan Smetannikov — 2019