(2015) and use the Euclidean The WMD is then the solution to the linear program: ×V is a nonnegative matrix, where each T i,j denotes how much of word i (across all its tokens) in A is assigned to tokens of word j in B, and the constraints ensure the flow of a given word cannot exceed its weight.
wMD ensures that the entire outgoing flow from word i Additionally, the amount of incoming flow to word j must match .