Skip to content

Docs: Add outline of decode step operations for new search algorithms - #256

Open
SimBe195 wants to merge 1 commit into
label_sync_separate_pruningfrom
search_alg_docs
Open

Docs: Add outline of decode step operations for new search algorithms#256
SimBe195 wants to merge 1 commit into
label_sync_separate_pruningfrom
search_alg_docs

Conversation

@SimBe195

@SimBe195 SimBe195 commented Aug 6, 2026

Copy link
Copy Markdown
Collaborator

This PR adds descriptions of the order of operations in the decode steps of lexiconfree-timesync-beam-search, tree-timesync-beam-search, lexiconfree-labelsync-beam-search and tree-labelsync-beam-search to the documentation.

Depends on #249.

Comment thread doc/search_v2.rst
#. Prune within-word extensions with score-threshold ``s_2``.
#. Recombine equivalent within-word hypotheses (if ``recombination-mode = on``).
#. Prune within-word hypotheses with max-beam-size ``b_2``.
#. Create word-end extension candidates for exits from the surviving within-word hypotheses.

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I'm not sure if it is clear what "exits" means. Maybe we should call it "leaves of the search tree"? Or find another term or way how to describe it.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants