We map each relation type $R(x,y)$ to at least one parametrized natural-language question $q_x$ whose answer is $y$ . 
 Question: How is the input triple translated to a slot-filling task?
The relation R(x,y) is mapped onto a question q whose answer is y