4. The computerized method of claim 1 , wherein determining candidate pairs comprises sorting terms from a target item representation based on IDF score; and iterating through the sorted terms in a manner such that at each iteration: (1) an aggregate IDF score is determined based on whether a current term and previously iterated terms are shared between the target item representation and a second item representation and (2) the aggregate IDF score is compared against a threshold to determine if the target item representation and second item representation comprise a candidate pair.
4. The computerized method of claim 1 , wherein determining candidate pairs comprises sorting terms from a target item representation based on IDF score; and iterating through the sorted terms in a manner such that at each iteration: (1) an aggregate IDF score is determined based on whether a current term and previously iterated terms are shared between the target item representation and a second item representation and (2) the aggregate IDF score is compared against a threshold to determine if the target item representation and second item representation comprise a candidate pair. 5. The computerized method of claim 4 , wherein determining candidate pairs further comprises, at each iteration, predicting whether it is possible for the target item representation and second item representation to be identified as a candidate pair by assuming remaining terms from the target item representation are shared by the second item representation.