The simplest variation is TESLA-M 2 , based on matching bags of ngrams (BNG) like BLEU.
unlike BLEU, TESLA-M formulates the matching process as a real-valued linear programming problem, thereby allowing the use of weights.