Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

122243365486 · Jun 202019922001200920172026
48 results for Word Error Rate

Large speech dataset for commercial use with 9.98% word error rate.

problem Creating a diverse speech recognition dataset for commercial purposes.
method Internet search for licensed audio data with transcriptions, training model on the dataset.
result Model trained on dataset achieves 9.98% word error rate on Librispeech's test-clean test set.

We present a new method for computing ASR word confidences that effectively mitigates the effect of ASR errors for diverse downstream applications, improves the word error rate of the 1-best result, and allows better comparison of scores across different models. We propose 1) a new method for modeling word confidence u…

2019-07-22abs ↗pdf ↗

A hybrid ASR system using conformer architecture improves word-error-rate and training speed.

problem Improving word-error-rate and training efficiency for hybrid ASR systems.
method Used conformer architecture, applied time downsampling, and transposed convolutions.
result Conformer-based hybrid model achieves competitive results and significantly outperforms BLSTM-based hybrid model.

We address the problem of speech enhancement generalisation to unseen environments by performing two manipulations. First, we embed an additional recording from the environment alone, and use this embedding to alter activations in the main enhancement subnetwork. Second, we scale the number of noise environments presen…

2018-10-26abs ↗pdf ↗

TeLeS improves ASR confidence estimation by considering temporal alignment and lexical errors.

problem Inaccurate confidence scores from E2E ASR models, especially for overconfident predictions.
method Proposes TeLeS, a novel confidence score that considers temporal alignment and lexical errors, and uses shrinkage loss to handle data imbalance.
result TeLeS generalizes well across different languages and ASR models, leading to significant WER reduction.

This work compares and evaluates various sampling methods for neural language models.

problem Lack of systematic comparison and myths about sampling methods.
method Monte Carlo sampling, importance sampling, compensated partial summation, noise contrastive estimation.
result All sampling methods can perform equally well if posterior probabilities are corrected.

This paper addresses the robust speech recognition problem as an adaptation task. Specifically, we investigate the cumulative application of adaptation methods. A bidirectional Long Short-Term Memory (BLSTM) based neural network, capable of learning temporal relationships and translation invariant representations, is u…

2019-06-14abs ↗pdf ↗

Graphical lasso models ASR utterance dependencies for consistent WER estimation.

problem Modeling dependent structure among ASR utterances for accurate significance analysis.
method Graphical lasso for dependency modeling, followed by blockwise bootstrap resampling.
result Statistically consistent variance estimator of WER under mild conditions.

The paper introduces a model to measure ASR fairness, addressing key issues.

problem Measuring fairness in ASR systems for different subgroups.
method Mixed-effects Poisson regression to control nuisance factors and handle unobserved heterogeneity.
result The method effectively addresses WER gaps among subgroups and is flexible for practical analyses.

Keyword extraction has received an increasing attention as an important research topic which can lead to have advancements in diverse applications such as document context categorization, text indexing and document classification. In this paper we propose STF-IDF, a novel semantic method based on TF-IDF, for scoring wo…

2020-01-06abs ↗pdf ↗

Study analyzes deep learning's performance on variable exponent Besov space, highlighting adaptivity benefits.

problem Estimation error analysis of deep learning in variable exponent Besov space.
method Analysis of general approximation error and estimation errors of deep learning.
result Adaptivity of deep learning leads to significant improvement in estimation error, especially in high-dimensional spaces.

New ASR system handles multiple languages without needing language-specific encoding.

problem Joint training of data-rich and data-scarce languages in a single model.
method Transforms all languages to a single writing system through transliteration, separating modeling and rendering.
result Language-agnostic multilingual ASR system reduces WER up to 10% over language-dependent models.

We define a large class of abstract Coxeter groups, that we call \infty--spanned, and for which the word growth rate and the geodesic growth rate appear to be Perron numbers. This class contains a fair amount of Coxeter groups acting on hyperbolic spaces, thus corroborating a conjecture by Kellerhals and Perren. We a…

2019-12-11abs ↗pdf ↗

This study improves knowledge distillation for RNN-T models with noisy labels.

problem Challenges in distilling knowledge from RNN-T models with variable quality teachers.
method Full-sum distillation and sequence-level knowledge distillation.
result Full-sum distillation outperforms other methods for RNN-T models, especially for bad teachers.

While humor is often thought to be beyond the reach of Natural Language Processing, we show that several aspects of single-word humor correlate with simple linear directions in Word Embeddings. In particular: (a) the word vectors capture multiple aspects discussed in humor theories from various disciplines; (b) each in…

2019-02-08abs ↗pdf ↗

The study analyzes how machine learning classifiers' error rates decrease exponentially based on large deviations theory.

problem Understanding the convergence rate of machine learning classifiers' error probabilities.
method Large deviations theory applied to machine learning classification techniques.
result The error probability of ML classifiers converges to zero exponentially, with a rate dependent on the training set size.

SapAugment learns adaptive augmentation policies for better model training.

problem Fixed data augmentation methods often apply the same augmentation to all samples, ignoring sample difficulty.
method SapAugment adapts augmentation parameters based on training loss, learning a sample-adaptive policy.
result SapAugment achieves up to 21% relative reduction in word error rate on LibriSpeech dataset.

This work bounds classification error in machine learning for low Bayes error conditions.

problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.

Encoder-decoder based sequence-to-sequence models have demonstrated state-of-the-art results in end-to-end automatic speech recognition (ASR). Recently, the transformer architecture, which uses self-attention to model temporal context information, has been shown to achieve significantly lower word error rates (WERs) co…

2020-01-08abs ↗pdf ↗

Grapheme-based acoustic modeling has recently been shown to outperform phoneme-based approaches in both hybrid and end-to-end automatic speech recognition (ASR), even on non-phonemic languages like English. However, graphemic ASR still has problems with rare long-tail words that do not follow the standard spelling conv…

2019-10-22abs ↗pdf ↗

Compressing word embeddings is important for deploying NLP models in memory-constrained settings. However, understanding what makes compressed embeddings perform well on downstream tasks is challenging---existing measures of compression quality often fail to distinguish between embeddings that perform well and those th…

2019-09-03abs ↗pdf ↗

Transformers' self-attention mechanism is mapped to a generalized Potts model.

problem Uncertainty in what type of data distribution self-attention can efficiently learn.
method Decouple word positions and embeddings, then show self-attention learns a generalized Potts model.
result Training self-attention is equivalent to solving the inverse Potts problem.

Social network analysis (SNA), which is a research field describing and modeling the social connection of a certain group of people, is popular among network services. Our topic words analysis project is a SNA method to visualize the topic words among emails from Obama.com to accounts registered in Columbus, Ohio. Base…

2014-05-15abs ↗pdf ↗