If h is consistent, then the A * algorithm guarantees that whenever an edge comes off the agenda, its weight is its true Viterbi inside cost.
this guarantee implies that the first edge representing the root I(R, 0, n) will be scored with the true Viterbi score for the sentence.