In the next stage, the optimal graph alignment is computed based on the node-to-node scores using the Hungarian algorithm. Mohler et al. (2011) also employ a technique they call "question demoting", which refers to the exclusion of words from the alignment process if they already appeared in the question string.