Introduce Histogram pruning for SearchV2 algorithms#196
Open
Introduce Histogram pruning for SearchV2 algorithms#196
Conversation
larissakl
reviewed
Mar 19, 2026
hannah220
requested changes
Mar 19, 2026
src/Search/LexiconfreeTimesyncBeamSearch/LexiconfreeTimesyncBeamSearch.cc
Outdated
Show resolved
Hide resolved
hannah220
approved these changes
Mar 19, 2026
larissakl
approved these changes
Mar 19, 2026
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
3 participants
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.
This PR replaces the beam-size-pruning using
std::nth_elementwith histogram pruning. ThebeamSizePruningandscorePruningfunctions ofLexiconfreeTimesyncBeamSearch,LexiconfreeLabelsyncBeamSearchandTreeTimesyncBeamSearchhave been combined into one function that can do both at once by incorporating the histogram.The advantage in terms of speed is only minor; I measured around 1-2% search RTF reduction.