The prediction of the dependency topology and labels through P l means that the full RDLM has the highest perplexity of all models.
for unknown words, we back-off to a special unk token for the sequence models and P l , and to the pre-terminal symbol for the other dependency models.