We assume that X is a substring of Y , i.e., that the source sentence can be obtained by deleting words from Y , so for a fixed observed sentence there are only a finite number of possible source sentences.
the number of source sentences grows exponentially with the length of Y , so exhaustive search is probably infeasible.