Then, the discriminator is designed to produce a probability distribution over k + 1 classes, which is computed as where c is the context vector from a bi-directional LSTM when taking x as input, U w is a wordspecific parameter and y is the target label.
d φ y = i|x, i ∈ {1, ..., k} denotes the probability that it belongs to the real i-th word sense, while d φ (y = k + 1|x) denotes the probability that it is produced by a pun generator.