NLP - Quiz #3
How to get an optimal tag assignment? - answer Viterbi Decoding
Greedy decoding - answer make your tagging decisions left to right, but decide the best
tag immediately at each point (instead of waiting until the end of the sequence)
Viterbi Decoding is ______________ programming - answer DYNAMIC
PROGRAMMING!
What's dynamic programming? - answer An efficient approach to breaking down
problems to make a full solution from partial solutions.
Time complexity for greedy decoding? – answer O(NC)
Viterbi decoding - answer examine all possible tag assignments left to right, at each
point identifying the best previous state for each state and what the resulting score
would be
Time complexity for viterbi decoding? - answerO(N,C^2)
Viterbi decoding data structures? - answerMatrix ; 2D list
Classification - answerassigning one or more classes to each item (AKA instance) by
predicting the best class(es) for the item
Class - answera label that can be assigned to an item
Features - answeroften we convert the item being classified into features before
classifying it
text classification process - answer1. Choose an initial set of features, a representation
of each piece of data (instance)
2. Train a model
3. Tune the model by measuring performance on the devset
Adjust hyperparameters
Change features
Change model if needed
4. When you have a final model or set of models, evaluate performance on the test set
How to get an optimal tag assignment? - answer Viterbi Decoding
Greedy decoding - answer make your tagging decisions left to right, but decide the best
tag immediately at each point (instead of waiting until the end of the sequence)
Viterbi Decoding is ______________ programming - answer DYNAMIC
PROGRAMMING!
What's dynamic programming? - answer An efficient approach to breaking down
problems to make a full solution from partial solutions.
Time complexity for greedy decoding? – answer O(NC)
Viterbi decoding - answer examine all possible tag assignments left to right, at each
point identifying the best previous state for each state and what the resulting score
would be
Time complexity for viterbi decoding? - answerO(N,C^2)
Viterbi decoding data structures? - answerMatrix ; 2D list
Classification - answerassigning one or more classes to each item (AKA instance) by
predicting the best class(es) for the item
Class - answera label that can be assigned to an item
Features - answeroften we convert the item being classified into features before
classifying it
text classification process - answer1. Choose an initial set of features, a representation
of each piece of data (instance)
2. Train a model
3. Tune the model by measuring performance on the devset
Adjust hyperparameters
Change features
Change model if needed
4. When you have a final model or set of models, evaluate performance on the test set
