An explicit representation of the model would have required nearly a terabyte of memory, but its implicit representation using the parallel text required only a few gigabytes.
second, we propose novel data structures and algorithms for phrase extraction ( §4) and scoring ( §5) that are amenable to GPU par-allelization.