Finally, we present the incremental surface realisation algorithm supporting the verbalisation of the possible query extensions.
conversely, those trees with c wo > 0 get a score that is the word order cost proportional to the covered input.