Fortunately , indirect associations are usually not difficult to identify , because they tend to be weaker than the direct associations on which they are based ( Melamed , 1996c ) .
a geometric approach to mapping bitext correspondencequot
I D Melamed
Models of translational equivalence that are ignorant of indirect associations have `` a tendency ... to be confused by collocates '' ( Dagan et al. , 1993 ) . Fortunately , indirect associations are usually not difficult to identify , because they tend to be weaker than the direct associations on which they are based ( Melamed , 1996c ) . The majority of indirect associations can be filtered out by a simple competition heuristic : Whenever several word tokens ui in one half of the bitext co-occur with a particular word token v in the other half of the bitext , the word that is most likely to be v 's translation is the one for which the likelihood L ( u , v ) of translational equivalence is highest .
Fortunately , indirect associations are usually not difficult to identify , because they tend to be weaker than the direct associations on which they are based ( @@CITATIONc ) .