| E2E Segmenter: Joint Segmenting and Decoding for Long-Form ASR | 0 | 0.34 | 2022 |
| An Efficient Streaming Non-Recurrent On-Device End-to-End Model with Improvements to Rare-Word Modeling. | 0 | 0.34 | 2021 |
| Contextual Recovery of Out-of-Lattice Named Entities in Automatic Speech Recognition | 1 | 0.37 | 2019 |
| Federated Learning of N-Gram Language Models | 0 | 0.34 | 2019 |
| Transliterated Mobile Keyboard Input via Weighted Finite-State Transducers. | 0 | 0.34 | 2017 |
| Composition-Based On-The-Fly Rescoring For Salient N-Gram Biasing | 1 | 0.39 | 2015 |
| Rapid Vocabulary Addition To Context-Dependent Decoder Graphs | 0 | 0.34 | 2015 |
| Bringing Contextual Information To Google Speech Recognition | 7 | 0.59 | 2015 |
| Improved Recognition Of Contact Names In Voice Commands | 5 | 0.65 | 2015 |
| Pushdown automata in statistical machine translation | 8 | 0.53 | 2014 |
| Language model verbalization for automatic speech recognition | 7 | 0.61 | 2013 |
| Mixture Of Mixture N-Gram Language Models | 0 | 0.34 | 2013 |
| Smoothed marginal distribution constraints for language modeling. | 4 | 0.37 | 2013 |
| The OpenGrm open-source finite-state grammar software libraries | 13 | 0.68 | 2012 |
| A pushdown transducer extension for the openfst library | 4 | 0.53 | 2012 |
| General Algorithms For Testing The Ambiguity Of Finite Automata And The Double-Tape Ambiguity Of Finite-State Transducers | 5 | 0.51 | 2011 |
| Bayesian Language Model Interpolation For Mobile Speech Input | 16 | 1.11 | 2011 |
| Hierarchical phrase-based translation representations | 14 | 0.63 | 2011 |
| A Dual Coordinate Descent Algorithm For Svms Combined With Rational Kernels | 1 | 0.35 | 2011 |
| A Filter-Based Algorithm For Efficient Composition Of Finite-State Transducers | 1 | 0.35 | 2011 |
| Unary Data Structures For Language Models | 4 | 0.39 | 2011 |
| Filters for efficient composition of weighted finite-state transducers | 8 | 0.73 | 2010 |
| Expected Sequence Similarity Maximization | 2 | 0.39 | 2010 |
| Large-scale training of SVMs with automata kernels | 1 | 0.37 | 2010 |
| Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton | 4 | 0.44 | 2009 |
| A Generalized Composition Algorithm For Weighted Finite-State Transducers | 5 | 0.62 | 2009 |
| N-Way Composition Of Weighted Finite-State Transducers | 6 | 0.52 | 2009 |
| OpenFst: an open-source, weighted finite-state transducer library and its applications to speech and language | 9 | 0.61 | 2009 |
| Sequence kernels for predicting protein essentiality | 8 | 0.47 | 2008 |
| General Algorithms for Testing the Ambiguity of Finite Automata | 8 | 0.74 | 2008 |
| 3-Way Composition of Weighted Finite-State Transducers | 9 | 0.66 | 2008 |
| OpenFst: a general and efficient weighted finite-state transducer library | 242 | 12.29 | 2007 |
| A unified construction of the glushkov, follow, and antimirov automata | 21 | 1.03 | 2006 |
| Robust access to large structured data using voice form-filling | 2 | 0.38 | 2005 |
| The Design Principles And Algorithms Of A Weighted Grammar Library | 4 | 0.51 | 2005 |
| An optimal pre-determinization algorithm for weighted transducers | 3 | 0.40 | 2004 |
| A general weighted grammar library | 11 | 1.20 | 2004 |
| A generalized construction of integrated speech recognition transducers | 29 | 1.81 | 2004 |
| Statistical modeling for unit selection in speech synthesis | 12 | 0.90 | 2004 |
| Generalized algorithms for constructing statistical language models | 67 | 3.83 | 2003 |
| An efficient pre-determinization algorithm | 1 | 0.36 | 2003 |
| Efficient algorithms for testing the twins property | 34 | 1.55 | 2003 |
| Finitely Subsequential Transducers | 4 | 0.50 | 2003 |
| Efficient Experimental String Matching by Weak Factor Recognition | 25 | 1.48 | 2001 |
| Simple optimal string matching algorithm | 12 | 0.61 | 2000 |
| Factor Oracle: A New Structure for Pattern Matching | 72 | 5.16 | 1999 |
