We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Conditional neural text generation models generate high-quality outputs, but often concentrate around a mode when what we really want is a diverse set of options. We present a search algorithm to construct lattices encoding a massive number of generation options. First, we restructure decoding as a best-first search, which explores the space differently than beam search and improves efficiency by avoiding pruning paths. Second, we revisit the idea of hypothesis recombination: we can identify pairs of similar generation candidates during search and merge them as an approximation. On both summarization and machine translation, we show that our algorithm encodes thousands of diverse options that remain grammatical and high-quality into one lattice. This algorithm provides a foundation for building downstream generation applications on top of massive-scale diverse outputs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2112.07660")
get_code_for_paper("2112.07660")
have("2112.07660")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2112.07660.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2112.07660)
Connect an agent — have() is free.