I come from a computer science perspective and am trying to understand dependency parsing.
What is the formal (computational) model for dependency parsing? The computational model for constituency parsing is a CFG; anything that can be generated from the rules of the CFG (like NP -> (Det) N (PP)) is a valid sentence/parse. How is the set of valid sentences/parses in dependency parsing described?
It seems like dependency parses and constituency parses give different kinds of information and that in general a constituency parse gives more information than a dependency parse. Why is this the case? What are examples where a sentence where a dependency parse can correspond to multiple constituency parses, so has less information (or vice versa)?
References are also appreciated. Thanks!