Stanford typed dependencies manual
Marie-Catherine de Marneffe and Christopher D. Manning
September 2008
Revised for Stanford Parser v. 1.6.2 in February 2010
1 Introduction
The Stanford typed dependencies representation was designed to provide a simple description
of the grammatical relationships in a sentence that can easily be understood and effectively
used by people without linguistic expertise who want to extract textual relations. In particular,
rather than the phrase structure representations that have long dominated in the computational
linguistic community, it represents all sentence relationships uniformly as typed dependency
relations. That is, as triples of a relation between pairs of words, such as “the subject of
distributes is Bell.” Our experience is that this simple, uniform representation is quite accessible
to non-linguists thinking about tasks involving information extraction from text and is quite
effective in relation extraction applications.
Here is an example sentence:
Bell, based in Los Angeles, makes and distributes electronic, computer and building
products.
For this sentence, the Stanford Dependencies (SD) representation is:
nsubj(makes-8, Bell-1)
nsubj(distributes-10, Bell-1)
partmod(Bell-1, based-3)
nn(Angeles-6, Los-5)
prep in(based-3, Angeles-6)
conj and(makes-8, distributes-10)
amod(products-16, electronic-11)
conj and(electronic-11, computer-13)
amod(products-16, computer-13)
conj and(electronic-11, building-15)
amod(products-16, building-15)
dobj(makes-8, products-16)
dobj(distributes-10, products-16)
This maps straightforwardly onto a directed graph representation, in which words in the
sentence are nodes in the graph and grammatical relations are edge labels. Figure 1 gives the
graph representation for the example sentence above.
1
- 1
- 2
- 3
- 4
- 5
- 6
前往页