Computer Science – Computation and Language
Scientific paper
1994-04-06
Computer Science
Computation and Language
9 pages, LaTeX (PostScript version available by ftp from ai.uga.edu)
Scientific paper
Dependency grammar is usually interpreted as equivalent to a strict form of X--bar theory that forbids the stacking of nodes of the same bar level (e.g., N' immediately dominating N' with the same head). But adequate accounts of _one_--anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reinterpreting its claims about phrase structure, so that modifiers map onto binary--branching X--bar trees rather than ``flat'' ones.
No associations
LandOfFree
An Empirically Motivated Reinterpretation of Dependency Grammar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Empirically Motivated Reinterpretation of Dependency Grammar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Empirically Motivated Reinterpretation of Dependency Grammar will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-400766