Index Ai Academy
Glossary · Phase 7 · Software engineering

Viterbi algorithm

Also written: Viterbi

A dynamic program that finds the likeliest sequence of hidden states behind a series of observations.

Try it now

Each amount reads the entries 1, 3 and 4 places back. Smaller amounts are filled first, so the answers it needs are always there.

Learn it properly

Dynamic programming in depth · A method in five questions: state, choices, recurrence, base case and order. Coins where greedy fails, rebuilding the solution, packing a token budget, the likeliest path behind noisy readings, and what it costs. About 45 minutes.

Other terms from the same lesson

  • greedy algorithm: A method that takes the best-looking step each time and never reconsiders. It is fast, and for some problems it gives a wrong answer.
Keep learning

More in plain English.

1286 terms in the glossary, each with the lesson that teaches it.

1286 terms

The glossary

Every word you'll meet in AI and machine learning, explained in everyday language.

Phase 7 · lesson 45 min

Dynamic programming in depth

A method in five questions: state, choices, recurrence, base case and order. Coins where greedy fails, rebuilding the solution, packing a token budget, the likeliest path behind noisy readings, and what it costs.

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write