Stack search

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Stack search (also known as Stack decoding algorithm) is a search algorithm similar to beam search. It can be used to explore tree-structured search spaces and is often employed in Natural language processing applications, such as parsing of natural languages, or for decoding of error correcting codes where the technique goes under the name of sequential decoding.

Stack search keeps a list of the best n candidates seen so far. These candidates are incomplete solutions to the search problems, e.g. partial parse trees. It then iteratively expands the best partial solution, putting all resulting partial solutions onto the stack and then trimming the resulting list of partial solutions to the top n candidates, until a real solution (i.e. complete parse tree) has been found.

Stack search is not guaranteed to find the optimal solution to the search problem. The quality of the result depends on the quality of the search heuristic.

References

edit edit source

Example applications of the stack search algorithm can be found in the literature:

Text derived from https://en.wikipedia.org/w/index.php?oldid=1353926506 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001353926506 · captured 1778643948.0 · version history

Cite this page as: encyclopegia.org, “Stack search”, snapshot enwiki-001353926506. https://encyclopegia.org/a/stack-search

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.