Analogously to how word embeddings are computed, the simplest way to embed paths would be to represent each sequence as a one-hot vector.
this is suboptimal for two reasons: Firstly, we expect only a subset of dependency paths to be attested frequently in our data and therefore many paths will be too sparse to learn reliable embeddings for them.