being solved. Understanding abstract representations, leveraging world knowledge, and reasoning about them is crucial. However, we believe that with an extensible and transparent architecture, it is very much possible to keep improving the system continuously in order to achieve this larger goal.

Acknowledgments {#acknowledgments .unnumbered}
===============

We thank the three anonymous reviewers for their helpful comments and invaluable suggestions. We also thank the members of Amelia Science, RnD IPsoft, India - Manjunath Hegde, Anant Khandelwal, Ashish Shrivastava for their work in QG and especially Viswa Teja Ravi, for helping in replicating  @mazidi2016infusing’s work. We also thank Uday Chinta and IPsoft, India, for supporting and providing access to Amazon Mechanical Turk.

Appendices {#sec:appendix}
==========

$\{d_0 \ldots d_n \} \gets dependency(w_0 \ldots w_n)$ *loop i = 0, until i = n*: $d_v \gets parent(d_i) $ $\{A_0 \ldots A_{CAU}\} \gets SRL(d_v)$ $subj \gets A_0$ $obj \gets A_1$ $obj \gets A_2$ $A_{x} \gets \sum (A_3,A_4,... A_{TMP})$ $verb \gets \{d_v, modals, negation\}$ $template \gets dep_{type} \gets d_i$ $QA \gets template(subj, obj, verb, A_{x}) $ **close**;

$\{SRL_1 \ldots SRL_s \} \gets SRL(w_0 \ldots w_n)$ *loop j = 0, until j = s*: $\{A_0 \ldots A_{CAU}, A_{TMP}\} \gets SRL_j$ *$loop \text{ } A_x \in SRL_j \; if 