Toward better automatic speech recognition
Bibliographic record
Abstract
Automatic speech recognition (ASR) performs best when there is a strong correspondence between system training and operating conditions, e.g., when one tests on speech data that is similar in style to that used for training.Mismatch (different environment speakers, or vocabulary) degrades performance.We have developed new model techniques able to adapt to various speech environments without modifying the basic ASR systems: an appropriate feature transformation scheme for the Mel-frequency cepstral coefficients (MFCC), a new speech-processing front-end feature that performs better than the existing MFCC, a log-energy dynamic range normalization technique for ASR in adverse conditions, and a continuous ASR method that exploits the advantages o f syllable and phoneme-based sub-word unit models.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.012 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.007 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.005 | 0.004 |
| Insufficient payload (model declined to judge) | 0.018 | 0.025 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".