The TEED problem is essentially the same as that of Parallel Corpus Filtering (PCF), discussed in the previous section.
the usage scenario is quite different: in PCF, one is typically dealing with a very large collection of segment pairs, only a fraction of which are true translations; the PCF task is then to filter out pairs which are not proper translations, possibly with some tolerance for pairs of segments that do share partial meaning.