, L} such that the syntax path r(w) can be recovered from its embedding r(w) almost surely for sufficiently large K. This lemma (proof given in Appendix) suggests that as long as we choose a sufficiently large embedding dimension K, the above introduced encoding for syntax paths is essentially lossless.
for a given n-word sentence s = (w 1 , w 2 , .