Empirically, we find that computation time is manageable when limiting the application of s t (•) to candidates that share the same entities as the unlabeled utterance.
the starting point is a user who needs a semantic parser for some domain, but has no data.