Therefore, in addition to the top C&C parse, we use the top parse from another recent CCG parser, EasyCCG (Lewis and Steedman 2014).
for a natural language text N T and query N H , we obtain two parses each, say S T1 and S T2 for T and S H1 and S H2 for H, which are transformed to logical forms T 1 , T 2 , H 1 , H 2 .