One might want to use the length of the path from the specific word to the target in the dependency tree as the distance, which is a worthwhile option to try in the future work, given the condition that dependency parsing on the input text is effective enough.
the weight for the word at position t is calculated as: where t max is truncation length of the input.