DependencyRelation relation = path.iterator().next();
// Skip relations that do not have the focusWord as the
// head word in the relation. The inverse relation will
// eventually be encountered and we'll account for it then.
if (!relation.headNode().word().equals(focusWord))
continue;
RelationTuple relationKey = new RelationTuple(
focusIndex, relation.relation().intern());
SparseDoubleVector relationVector = localTuples.get(