MCPcopy Create free account
hub / github.com/google-research/language / intersection_op

Function intersection_op

language/emql/module.py:258–273  ·  view source on GitHub ↗

Compute intersection between two sets. Args: set1_embs: dense embeddings of set1. set1_sketch: sparse count-min sketch of set1. set2_embs: dense embeddings of set2. set2_sketch: sparse count-min sketch of set2. Returns: Set embeddings and sketches for intersected set.

(set1_embs, set1_sketch,
                    set2_embs,
                    set2_sketch)

Source from the content-addressed store, hash-verified

256
257
258def intersection_op(set1_embs, set1_sketch,
259 set2_embs,
260 set2_sketch):
261 """Compute intersection between two sets.
262
263 Args:
264 set1_embs: dense embeddings of set1.
265 set1_sketch: sparse count-min sketch of set1.
266 set2_embs: dense embeddings of set2.
267 set2_sketch: sparse count-min sketch of set2.
268 Returns:
269 Set embeddings and sketches for intersected set.
270 """
271 intersection_embs = set1_embs + set2_embs
272 intersection_sketch = tf.minimum(set1_sketch, set2_sketch)
273 return intersection_embs, intersection_sketch
274
275
276def union_op(set1_embs, set1_sketch,

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…