Optimal Alignment Score (OAS)

• Optimal Alignment Score (OAS) is a metric that determines the maximum score from valid alignment paths using substitution matrices and gap penalties in sequence comparison and attention analysis.
• It incorporates rigorous statistical methods, employing distributions like Gumbel and Gamma to assess the significance of alignment scores under varying conditions.
• In decoder-only text-to-speech systems, OAS serves as a diagnostic tool by quantifying the attention mass on a Viterbi-derived monotonic path, thereby aiding in performance improvement.

Optimal Alignment Score (OAS) denotes, in its most general use, the score obtained by optimizing an alignment objective over an admissible family of alignments. In classical sequence comparison, this is the maximum score of pairwise or multiple local or global alignments under substitution and gap penalties. In recent decoder-only text-to-speech work, by contrast, OAS is the explicit name of a path-based attention metric that measures how much attention mass lies on a Viterbi-derived monotonic text–speech alignment path. The term therefore spans both a long-established optimization quantity in sequence alignment and a newer diagnostic for latent alignment quality in autoregressive speech generation (Fieth et al., 2015, Wang et al., 24 Sep 2025).

1. Terminology and formal scope

In the sequence-comparison literature considered here, the underlying quantity is usually written as $L_n$ or $R^*$ rather than abbreviated OAS. For $m$ random words, the optimal alignment score is

$$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$

where the maximum ranges over admissible increasing index sequences. For pairwise alignments with gaps, the corresponding object is

$$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$

In the TTS setting, OAS instead denotes a normalized score of an optimal monotonic path through an attention submatrix. The surrounding alignment literature also contains adjacent objectives that are not named OAS: a music audio-to-score system minimizes an accumulated dynamic-programming cost $D[i,j]$, while a scored NFA accelerator reports the highest cumulative score among valid automaton paths (Gong et al., 2015, Hauser et al., 2014, Wang et al., 24 Sep 2025, Peter et al., 19 May 2026, Karbowniczak et al., 4 Jan 2025).

Context	Formal object	Optimization sense
Sequence comparison	$L_n$, $R^*$	Maximum score over admissible alignments
Decoder-only TTS	OAS ratio on attention matrix	Maximum monotonic path mass
Audio-to-score alignment	$D[i,j]$	Minimum accumulated cost
Scored NFA hardware	Best match score	Maximum path score

This terminological spread matters because the same phrase can refer either to a null-model random variable, a statistic on a set of optimal alignments, an internal attention diagnostic, or a hardware-implemented weighted-path objective. A plausible implication is that any use of OAS must be interpreted together with the alignment formalism, the admissible path constraints, and the sign convention of the objective.

2. Classical alignment formulations

For molecular sequence analysis, the optimal alignment score is defined by a scoring system and an admissible alignment class. In gapped multiple local alignment, the score is given in the standard sum-of-pairs framework,

$$S(A,\{x^{(i)}\})=\sum_{i<j}\left(\sum_k s(x^{(i)}_{l^{(i)}_k},x^{(j)}_{l^{(j)}_k})-\sum_g g(M_g)\right),$$

with affine gap penalty

$R^*$0

Local alignment takes the maximum over all subsequences and all alignments of those subsequences, whereas global alignment optimizes over full-length alignments. The same paper studies pairwise and multiple, local and global, score distributions; for multiple global alignment it compares both an exact algorithm and a progressive heuristic (Fieth et al., 2015).

Within the more abstract probabilistic formulation for $R^*$1 random words, the score function

$R^*$2

is assumed to be non-negative, bounded, permutation-invariant, and subject to a bounded differences condition. The score of an alignment of common length $R^*$3 is

$R^*$4

and the longest common subsequence appears as the special case

$R^*$5

This formulation extends the optimal-score notion beyond any specific substitution matrix or biological heuristic and isolates the combinatorial optimization problem itself (Gong et al., 2015).

A separate line of work studies optimal alignments relative to one scoring function $R^*$6, then evaluates those $R^*$7-optimal alignments under a second scoring function $R^*$8. The extremal $R^*$9-scores over the $m$0-optimal set $m$1 define a “second functional,” which probes the microstructure of the optimal set rather than only the primary optimum. In that setting, the score pairs generated by all alignments are embedded in a convex geometric object,

$m$2

and linear combinations $m$3 are recovered as supporting functionals of that set (Hauser et al., 2014).

3. Distributional theory and significance assessment

The biological importance of the optimal alignment score is tied to significance testing. For random sequences, what matters is not merely the bulk of the null distribution but the extreme high-score tail, because that tail determines whether an observed score is surprising in database search or protein comparison. For local pairwise gapless alignment of infinitely long sequences, the classical reference law is Gumbel,

$m$4

and a Gaussian-corrected form has also been studied,

$m$5

For global alignment, prior work suggested a Gamma distribution, with a Gaussian-corrected variant for improved empirical fit (Fieth et al., 2015).

The key empirical result is that these standard forms are only approximate in the finite-length, gapped regime of practical interest. Rare-event simulation based on statistical mechanics extends measurement of the score distribution down to probabilities as small as $m$6, far below the range of ordinary sampling, which reaches only about $m$7. The method treats a sequence set as a configuration $m$8 with energy $m$9, uses a Metropolis transition

$$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$0

and combines multiple temperatures with parallel tempering. In this regime, strong deviations from the Gumbel law occur for finite lengths, the Gaussian correction improves but does not fully capture the distribution, and for global alignment the Gamma fit works reasonably well only in the high-probability region (Fieth et al., 2015).

A central scaling result is that much of the sequence-length dependence can be approximately removed by rescaling both the score and the log-probability: $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$1 This produces a good collapse of distributions for fixed numbers of sequences in the low-probability region. However, pairwise and multiple-alignment distributions do not collapse onto the same curve. For local multiple alignment, the distribution shows stronger curvature than in the pairwise case; for global multiple alignment, the behavior under progressive heuristics differs from exact pairwise results, and the Gaussian correction term can become much smaller or nearly negligible. The practical consequence is that multiple-alignment significance cannot be inferred reliably from pairwise null models alone (Fieth et al., 2015).

4. Probabilistic asymptotics and alignment microstructure

For $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$2 independent random words over a finite alphabet, the optimal alignment score has a law of large numbers and, under a variance lower bound, a central limit theorem. By superadditivity,

$$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$3

and under

$$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$4

the normalized score converges to a standard normal distribution with Kolmogorov distance bounded by

$$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$5

The proof combines bounded-differences concentration, a high-probability “closeness to the diagonal” property for optimal alignments in multi-dimensional alignment space, and a Stein-method normal approximation due to Lachièze-Rey and Peccati. The model also admits a directed last-passage percolation interpretation (Gong et al., 2015).

The second-functional framework adds geometric control over the set of optimal alignments. If the limit shape $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$6 has a unique maximizer $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$7 of the first coordinate and the boundary has positive curvature there, then the $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$8-score of $$L_n=L_n\!\left(X^{(1)}_n;\dots;X^{(m)}_n\right)=\max_{(\pi^{(1)},\dots,\pi^{(m)})}U(\pi^{(1)},\dots,\pi^{(m)}),$$9-optimal alignments converges to $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$0 with normalized deviation of order $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$1, equivalently unnormalized deviation $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$2. The same work shows that when $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$3 and $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$4 are sampled i.i.d. from the Frobenius-unit sphere of symmetric scoring functions, uniqueness and a linear small-curvature tail are generic almost surely. This result quantifies the microstructure of optimal alignments beyond the primary optimum itself (Hauser et al., 2014).

For binary alphabets, the fluctuation picture can be more intricate. One decomposition of the five-dimensional space of symmetric scoring functions isolates two components, $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$5 and $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$6, that contribute an alignment-independent part to the optimal score; this part is asymptotically normal on the $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$7 scale. Under a restricted-gap regime with exactly $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$8 gaps inserted only in one sequence, the remaining alignment-dependent component has Tracy–Widom behavior after appropriate centering and rescaling. In that setting, the optimal score splits into a normal, alignment-independent term and a smaller Tracy–Widom term, and the alignment-independent Gaussian part can be removed when the score is used as a relatedness statistic (Duan et al., 2017).

Two further strands refine this asymptotic picture. One develops lower bounds on generalized central moments and exponential moments of the optimal score for two independent i.i.d. sequences, using an auxiliary statistic $$R^*(x_{[1,n]},y_{[1,n]}) := \max R_v(x_{[1,n]},y_{[1,n]}).$$9 and a random transformation that tends to increase the score; in the binary LCS case this yields moment lower bounds of order $D[i,j]$0 and a local quadratic upper bound on the associated rate function (Gong et al., 2015). Another studies random letter changes in low-gap binary alignments and proves that if the gap proportion is small, optimal alignments are locally unique in most places with high probability; the argument exploits the fact that a random bit flip preserves the mean score change, yet many locally nonunique sites would induce a positive bias in score increase (Hauser et al., 2013).

5. OAS as a latent alignment metric in decoder-only TTS

In decoder-only LLM-based text-to-speech, OAS is a named metric rather than a generic label for a maximum score. The motivating problem is stability hallucination: repetition, omission, or endless speech in systems such as CosyVoice2. The underlying claim is that these failures are tied to poor text–speech alignment in self-attention. Let $D[i,j]$1 be an attention-probability submatrix from speech tokens to text tokens. The model assumes that valid text–speech alignment should form a continuous and monotonic path, and uses a Viterbi algorithm to compute an optimal path $D[i,j]$2. OAS is then defined as

$D[i,j]$3

so it measures the fraction of attention mass concentrated on a globally optimal monotonic path (Wang et al., 24 Sep 2025).

The dynamic program is defined by

$D[i,j]$4

followed by backtracking from

$D[i,j]$5

This recurrence permits either staying at the same text token or advancing monotonically as speech tokens progress. OAS differs from forced-alignment labels, raw attention entropy, and word error rate: it is path-based, monotonic, derived directly from attention probabilities, and intended for decoder-only TTS without explicit cross-attention (Wang et al., 24 Sep 2025).

The metric is used both diagnostically and as a training signal. Average OAS values identify layers 8 and 9 as the main alignment layers in CosyVoice2, and half of the heads in those layers are designated as alignment heads. After masking attention to the alignment region, the denominator of the OAS ratio becomes constant and the regularizer simplifies to

$D[i,j]$6

On 400 hard-text examples from Seed-TTS-Eval synthesized by CV2, the correlation coefficient between OAS and WER is reported as $D[i,j]$7. The OAS-regularized model improves WER on hard text from $D[i,j]$8 to $D[i,j]$9 on Seed-TTS-Eval and from $L_n$0 to $L_n$1 on CV3-Eval; on common text, WER drops from $L_n$2 to $L_n$3 and from $L_n$4 to $L_n$5, while SIM and UTMOS do not decrease. MOS on common-text scenarios changes from $L_n$6 to $L_n$7 on Seed-TTS-Eval and from $L_n$8 to $L_n$9 on CV3-Eval (Wang et al., 24 Sep 2025).

6. Related objectives, non-uses, and implementation contexts

Not every alignment paper with a score-maximization or path-optimization objective uses the name OAS. In a 2026 music information retrieval system for audio-to-score alignment, the optimization target is the minimum accumulated dynamic-programming cost $R^*$0, with backpointers $R^*$1 and a local beat-period estimate $R^*$2. The transition combines an onset term, a stretch term, and a spectral term,

$R^*$3

and lower cost corresponds to better alignment. The paper explicitly states that it does not define or use an Optimal Alignment Score by that name; evaluation is instead reported through alignment error in milliseconds, including mean error, median error, and percentages below $R^*$4, $R^*$5, $R^*$6, and $R^*$7 ms (Peter et al., 19 May 2026).

In hardware acceleration, however, the OAS interpretation reappears naturally. NAPOLY+ extends an NFA overlay so that each processing element stores a score register, a weight or edge-cost register, and an arithmetic unit. This turns a match-detection-only architecture into a score-aware alignment engine capable of tracking the highest cumulative score over competing paths. The weighted-automaton viewpoint is summarized by

$R^*$8

with the implied recurrence

$R^*$9

Here the “best match” is the alignment path with the highest accumulated score, which is precisely the optimal alignment score in the weighted-automaton sense. The design therefore bridges plain pattern recognition and score-based sequence alignment (Karbowniczak et al., 4 Jan 2025).

These neighboring cases clarify a common misconception. “Optimal Alignment Score” is not a universal evaluation benchmark that appears automatically in every alignment system. In some literatures it is a primary random variable or test statistic; in decoder-only TTS it is a named monotonic-path metric; in other systems the corresponding object may be a minimum cost rather than a maximum score, or the best-path score may exist without being labeled OAS. This suggests that the technical content of the term lies less in the acronym itself than in the underlying alignment geometry, path constraints, and score or cost semantics.