Bibliographic record
Abstract
It is well known that automatic speech recognition (ASR) requires good spectral analysis in order to have successful ASR accuracy. A wideband spectrogram seems to contain all the needed acoustic information to map any given speech signal into its corresponding sequence of phonemes. (For ASR, language models are often used to augment acoustics, but here we will limit ourselves to acoustic analysis.) Various methods beyond the basic Fourier transform have found success in ASR, e.g., linear predictive analysis, wavelets, and mel-frequency cepstra (MFCC). These have all been focussed on extracting an efficient set of spectral parameters to facilitate phonetic discrimination. Part of the difficulty is separating spectral envelope information from excitation parameters, as variations in pitch are largely viewed as orthogonal to phoneme recognition. Another complicating factor is that amplitude and frequency scales in speech production and perception are better modeled as nonlinear (unlike the linear, fixed-bandwidth approach of Fourier transforms). Modern ASR techniques are far from optimal, as the front-end data compression yielding MFCCs, for a basic 80-ms phoneme, typically has more than 100 parameters, to distinguish among approximately 32 phonemes (a 5-bit choice). We will investigate various ways to render ASR analysis more efficient. [Work supported by NSERC-Canada.]
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.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.018 | 0.016 |
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".