In this work, we show that methods developed for SMT can be brought to bear on tasks where logical forms are involved, such as semantic parsing.
we extend the WASP semantic parsing algorithm by adding variable-binding λ-operators to the underlying SCFG.