Our factorization parser (with best experimental setting) does not utilize a grammar but do use syntactic information in the dependency formalism.
the parser extracts the so-called path features from dependency trees.