It is infeasible to run the ITG biparsing algorithm on n 2 candidate sentence pairs.
a multi-stage algorithm is needed that first generates likely candidates using faster heuristics, and then biparses the candidates to obtain the final high-precision results.