j = 0, until j = s*: $\{A_0 \ldots A_{CAU}, A_{TMP}\} \gets SRL_j$ *$loop \text{ } A_x \in SRL_j \; if \; A_x = modifier$*: $subj \gets A_0$ $A_{x}^{-} \gets \sum (A_3,A_4,... A_{TMP} - A_x)$ $verb \gets \{A_v, modals, negation\}$ $template \gets modifier_{type} \gets A_x$ $QA \gets template(subj, A_x, verb, A_{x}^{-}) $ **close**;

We succinctly describe the steps taken in Algorithm \[srl-algo\]. We first filter out all the predicates which have an *Agent* or a *Patient* and at least one other modifier like *Extent, Manner, Direction,* etc. These modifiers would serve as our short answers. We make use of a set of predefined handwritten templates described in Table \[srl-table\], which rearrange the arguments within the fact to convert it into an interrogative statement depending on the modifier.

In Figure \[fig:srl\_qgen\], the predicate “won” is modified by a *Patient* “New Mexico”, an *Agent* “Obama”, an *Extent* modifier “by a margin of 5%” and a *Temporal* modifier “in 2008”. For *Extent* as a short answer, we fill a pre-defined template “By how much mainAux nsubj otherAux verb obj modifiers ?” to get the above question-answer pair. We keep the order of arguments as they appear in the original sentence. The templates are 