After token-level matching, we construct a list of potential entity spans in the target sentence that match with a given source entity e S by grouping adjacent target tokens for which a token-level matching score s e (e S , •) is above a threshold δ (to remove spurious matches).
we construct the following set: is the phrase spanning tokens indexed from q to r (1 ≤ q, r ≤ L T ) in the target sentence.