We write LLCFRL.k/ for the class of all dependency languages generated by lexicalized lcfrs with a fan-out of at most k. Proposition 4.
rEGD.k/ D LLCFrL.k C 1/ the class rEGD.0/ of regular dependency languages over projective structures is exactly the class of dependency languages generated by lexicalized context-free grammars.