Fetching the paper…
Reading the bibliography…
Weighted finite automata (WFA) are often used to represent probabilistic models, such as $n$-gram language models, since they are efficient for recognition tasks in time and space.
Language identification in the limit
E. Mark Gold · 1967
Earlier work this paper cites.
Efficient string matching: an aid to bibliographic search
Alfred V. Aho and Margaret J. Corasick · 1975
Earlier work this paper cites.
Maximum likelihood from incomplete data via the EM algorithm
Arthur P. Dempster, Nan M. Laird, and Donald B. Rubin · 1977
Earlier work this paper cites.
Complexity of automaton identification from given data
E. Mark Gold · 1978
Earlier work this paper cites.
Learning regular sets from queries and counterexamples
Dana Angluin · 1987
Earlier work this paper cites.
Estimation of probabilities from sparse data for the language model component of a speech recogniser
Slava M. Katz · 1987
Earlier work this paper cites.
Identifying languages from stochastic examples
Dana Angluin · 1988
Earlier work this paper cites.
Inductive inference, DFAs, and computational complexity
Leonard Pitt · 1989
Earlier work this paper cites.
Learning and extracting finite state automata with second-order recurrent neural networks
C. Lee Giles, Clifford B. Miller, Dong Chen, Hsing-Hen Chen, Guo-Zheng Sun, and Yee-Chun Lee · 1992
Earlier work this paper cites.
Identifying regular languages in polynomial time
José Oncina and Pedro Garcia · 1992
Earlier work this paper cites.
Learning stochastic regular grammars by means of a state merging method
Rafael C. Carrasco and José Oncina · 1994
Earlier work this paper cites.
Incremental regular inference
Pierre Dupont · 1996
Earlier work this paper cites.
Accurate computation of the relative entropy between stochastic regular grammars
Rafael C. Carrasco · 1997
Earlier work this paper cites.
String-matching with automata
Mehryar Mohri · 1997
Earlier work this paper cites.
Extracting stochastic machines from recurrent neural networks trained on complex symbolic sequences
Peter Tiño and Vladimir Vojtek · 1997
Earlier work this paper cites.
An empirical study of smoothing techniques for language modeling
Stanley Chen and Joshua Goodman · 1998
Earlier work this paper cites.
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Richard Durbin, Sean R. Eddy, Anders Krogh, and Graeme J. Mitchison · 1998
Earlier work this paper cites.
Learning deterministic regular grammars from stochastic samples in polynomial time
Rafael C. Carrasco and Jose Oncina · 1999
Earlier work this paper cites.
DC programming: overview
Reiner Horst and Nguyen V. Thoai · 1999
Earlier work this paper cites.
Minimization algorithms for sequential transducers
Mehryar Mohri · 2000
Earlier work this paper cites.
Grammar inference, automata induction, and language acquisition
Rajesh Parekh and Vasant Honavar · 2000
Cited alongside, same era.
Entropy-based pruning of backoff language models
Andreas Stolcke · 2000
Cited alongside, same era.
Expectation semirings: Flexible EM for learning finite-state transducers
Jason Eisner · 2001
Cited alongside, same era.
Protecting respondents identities in microdata release
Pierangela Samarati · 2001
Cited alongside, same era.
Semiring frameworks and algorithms for shortest-distance problems
Mehryar Mohri · 2002
Cited alongside, same era.
Generalized algorithms for constructing language models
Cyril Allauzen, Mehryar Mohri, and Brian Roark · 2003
Cited alongside, same era.
Conversion of recurrent neural network language models to weighted finite state transducers for automatic speech recognition
Gwénolé Lecorvé and Petr Motlicek · 2012
Later among the works it cites.
The OpenGrm open-source finite-state grammar software libraries
Brian Roark, Richard Sproat, Cyril Allauzen, Michael Riley, Jeffrey Sorensen, and Terry Tai · 2012
Later among the works it cites.
LSTM neural networks for language modeling
Martin Sundermeyer, Ralf Schlüter, and Hermann Ney · 2012
Later among the works it cites.
Failure transitions for joint n-gram models and g2p conversion
Josef R. Novak, Nobuaki Minematsu, and Keikichi Hirose · 2013
Later among the works it cites.
Comparing approaches to convert recurrent neural networks into backoff language models for efficient decoding
Heike Adel, Katrin Kirchhoff, Ngoc Thang Vu, Dominic Telaar, and Tanja Schultz · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Inducing grammars from sparse data sets: a survey of algorithms and results
Orlando Cicchello and Stefan C. Kremer · 2003
Cited alongside, same era.
Rule extraction from recurrent neural networks: A taxonomy and review
Henrik Jacobsson · 2005
Cited alongside, same era.
Europarl: A parallel corpus for statistical machine translation
Philipp Koehn · 2005
Cited alongside, same era.
OpenFst Library
Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, and Mehryar Mohri · 2007
Cited alongside, same era.
The OCRopus open source OCR system
Thomas M. Breuel · 2008
Cited alongside, same era.
On the computation of the relative entropy of probabilistic automata
Corinna Cortes, Mehryar Mohri, Ashish Rastogi, and Michael Riley · 2008
Cited alongside, same era.
Converting neural network language models into back-off language models for efficient decoding in automatic speech recognition
Ebru Arisoy, Stanley F. Chen, Bhuvana Ramabhadran, and Abhinav Sethy · 2014
Later among the works it cites.
Spectral learning of weighted automata
Borja Balle, Xavier Carreras, Franco M. Luque, and Ariadna Quattoni · 2014
Later among the works it cites.
The Kestrel TTS text normalization system
Peter Ebden and Richard Sproat · 2015
Later among the works it cites.
Federated learning: Strategies for improving communication efficiency
Jakub Konečnỳ, H. Brendan McMahan, Felix X. Yu, Peter Richtárik, Ananda Theertha Suresh, and Dave Bacon · 2016
Later among the works it cites.
Transliterated mobile keyboard input via weighted finite-state transducers
Lars Hellsten, Brian Roark, Prasoon Goyal, Cyril Allauzen, Françoise Beaufays, Tom Ouyang, Michael Riley, and David Rybach · 2017
Later among the works it cites.
Communication-efficient learning of deep networks from decentralized data
Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas · 2017
Later among the works it cites.
Mobile keyboard input decoding with finite-state transducers
Tom Ouyang, David Rybach, Françoise Beaufays, and Michael Riley · 2017
Later among the works it cites.
Algorithms for weighted finite automata with failure transitions
Cyril Allauzen and Michael D. Riley · 2018
Later among the works it cites.
Federated learning for mobile keyboard prediction
Andrew Hard, Kanishka Rao, Rajiv Mathews, Françoise Beaufays, Sean Augenstein, Hubert Eichner, Chloé Kiddon, and Daniel Ramage · 2018
Later among the works it cites.
Extracting automata from recurrent neural networks using queries and counterexamples
Gail Weiss, Yoav Goldberg, and Eran Yahav · 2018
Later among the works it cites.
Federated learning of N-gram language models
Mingqing Chen, Ananda Theertha Suresh, Rajiv Mathews, Adeline Wong, Françoise Beaufays, Cyril Allauzen, and Michael Riley · 2019
Closest in time.
Distilling weighted finite automata from arbitrary probabilistic models
Ananda Theertha Suresh, Brian Roark, Michael Riley, and Vlad Schogol · 2019
Closest in time.
Learning deterministic weighted automata with queries and counterexamples
Gail Weiss, Yoav Goldberg, and Eran Yahav · 2019
Closest in time.
Latin script keyboards for south asian languages with finite-state normalization
Lawrence Wolf-Sonkin, Vlad Schogol, Brian Roark, and Michael Riley · 2019
Closest in time.
Weighted automata extraction from recurrent neural networks via regression on state spaces
Takamasa Okudono, Masaki Waga, Taro Sekiyama, and Ichiro Hasuo · 2020
Closest in time.