Add Search::LexiconfreeRNNTTimesyncBeamSearch#179
Draft
Conversation
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.
Adds a lexiconfree timesynchronous beam-search algorithm for standard (non-monotonic) Transducers. At each timestep, multiple non-blank labels can be predicted (the maximum number is controllable via a hyperparameter), a hypothesis is finished in the current timestep if it has emitted a blank label. In the inner loop of a timestep, first, all active inner hypotheses are extended with blank so they become outer hypotheses. Then, the inner hyps are extended by non-blank tokens and are pruned. If there are already more than max-beam-size outer hyps, all inner hyps which are worse than the worst of the max-beam-size best outer hyps are removed. If no inner hyps are left, the inner loop is stopped. At the end of a timestep, the outer hyps are pruned again based on their length-normalized score.
The implementation is based on PyTorch's RNNTBeamSearch
Major To-Dos: