This algorithm can cover 98.5% arguments while reducing about 60% of the training samples, according to our statistics.
this is achieved at the price of including a syntactic parse tree as part of the input for semantic parsing.