Why is exact search impractical in a scored sentence-generation system?
0
1
Tags
Data Science
Machine Learning
Deep Learning
Supervised Learning
Dive into Deep Learning @ D2L
Machine Learning Strategy
Machine Learning Yearning @ DeepLearning.AI
Related
Beam Search as an Approximate Search Method
Why is it usually impractical to score every possible output sequence and choose the best one exactly?
True or False: Approximate search methods used during scored inference are guaranteed to return the highest-scoring result.
Because checking every possible output is impractical, a scored inference system must use a(n) _____ method to locate a high-scoring result.
Why is exact search impractical in a scored sentence-generation system?
Approximate search methods in scored inference are guaranteed to return the candidate S with the highest value of Score_A(S).
Search target in scored decoding
Match each inference term to its role in a scored output system.
Order the steps a speech transcription system uses to convert a recorded message into text.
Meaning of a Conditional Score in Classification
If each of N positions can be filled by any one of 50,000 words, then the number of distinct sequences of length N is (50,000)^N.
Approximate Search and Score Maximization
Match each search challenge to the concept that best describes it.
Order the reasoning steps that explain why approximate search is needed in scored inference.
Why exhaustive search is impractical in scored inference
Find out why an approximate decoder missed a better-scoring output.
State the cost of approximate search in large-scale scoring problems.