In the next Section, we aim to estimate distributions P (z|ẽ) and P (z|f ) for subdomain z over the source and target phrases respectively.
we aim at projecting phrases onto a compact (K − 1) dimensional simplex of subdomains with vectors: Each of the K elements encodes how well each source and target phrase expresses a specific latent subdomain in the training data.