docs: greedy correction — tha-g2p-small 2.85% PER; beam decode counterproductive - #36
Merged
Conversation
added 2 commits
August 24, 2026 10:57
…l); beam decode counterproductive Re-measured through the shipped int4 zip and the Python runtime's ONNX KV decode (the exact path users get), true Levenshtein, full 1,219 sentences: greedy 2.85% PER / 88.93% EM vs the published beam-4 12.06% / 87.94%. Beam length-normalization systematically lengthens every non-exact output on this model's flat per-token distributions (top-1 logprob -4.6 vs uniform -5.6): EM barely moves, edit distance quadruples. Greedy is the optimal decode for these students; the runtime keeps greedy as default and exposes num_beams as a verified opt-in (batch-independence of the KV graph asserted against per-beam batch-1 references). All future gates decode greedy.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Test plan