In this example, Most previous work on query annotation makes the independence assumption -every annotation z Q ∈ Z Q is done separately from the others.
it is assumed that the optimal linguistic annotation z * (I) Q is the annotation that has the highest probability given the query Q, regardless of the other annotations in the set Z Q .