2 The parameters of our probe are exactly the matrix B, which we train to recreate the tree distance between all pairs of words (w i , w j ) in all sentences T in the training set of a parsed corpus.
we approximate through gradient descent: where |s | is the length of the sentence; we normalize by the square since each sentence has |s | 2 word pairs.