TWiki
>
TFlex Web
>
Proposals
>
DeepGRs
>
DepStructureProperties
(revision 4) (raw view)
Edit
Attach
<!-- This is a comment, in the HTML sense of the word, but Wiki directives still work, so you could put access control statements here to restrict access to your new topic, and they won't show up in the published page. Please think carefully when creating a new topic, and use a GoodWikiName --> ---+++ Definition of dependency structures A dependency structure over sentence S = w<sub>1</sub> w<sub>2</sub> ... w<sub>n</sub> is an ordered pair <N,f,R> where: * N is a finite, non-empty set of nodes * f is a function from N to {i | W<sub>i</sub> ∈ S}, i.e. every node is labelled with exactly one token from the sentence (but nothing stops the same token labelling more than one node) * R is an irreflexive, rooted relation on N, i.e. no self-arcs, and there is exactly one element of N which is a source but not a target ---+++ Optional constraints An 'acyclic' dependency structure over sentence S is a dependency structure <N,f,R> over S where: * if there is a sequence of R-arcs from node n<sub>1</sub> to node n<sub>2</sub>, then there is no sequence of R-arcs from n<sub>2</sub> to n<sub>1</sub> A dependency 'tree' over sentence S is an acyclic dependency structure <N,f,R> over S where: * every node is a target of at most one arc, i.e. no re-entrancy A 'surjective' dependency structure over sentence S is a dependency structure <N,f,R> over S where: * f is a surjective function, i.e. every token in S labels at LEAST one node in N An 'injective' dependency structure over sentence S is a dependency structure <N,f,R> over S where: * f is an injective function, i.e. every token in S labels at MOST one node in N A 'bijective' dependency structure over sentence S is a surjective, injective dependency structure <N,f,R> over S, i.e. every token in S labels EXACTLY one node in N Most dependency parsers assume *bijective dependency trees*. Recent work (based on Danish Dependency Treebank) has relaxed the tree constraint i.e. bijective acyclic trees. There are good reasons for relaxing the surjective constraint (expletive pronouns) and the injective constraint (argument cluster coordination, noun modifier coordination). ---+++ Projectivity A 'projective' dependency tree over sentence S = w<sub>1</sub> w<sub>2</sub> ... w<sub>n</sub> is a dependency tree <N,f,R> over S, where: * ---+++ Others *Functionality* - for each word W and each dependency label T, there is no more than one dependency from W labelled with T -- Main.MarkMcConville - 14 Aug 2008
Edit
|
Attach
|
P
rint version
|
H
istory
:
r6
<
r5
<
r4
<
r3
<
r2
|
B
acklinks
|
V
iew topic
|
Raw edit
|
More topic actions...
Topic revision: r4 - 29 Aug 2008 - 14:03:37 -
MarkMcConville
TFlex
TFlex Web
TFlex Web Home
Changes
Index
Search
Webs
ANC
Android4EDU
BDEteam
CSTR
CogsciTeach
ComputingStrategy
DICE
DReaM
DSOClets
DatabaseGroup
DistributedComputing
DiyDice
Dizzy
DocsByUsers
ECCOModelling
ECHOES
EyeTracking
F4K
FC3upgrade
Ftlwiki
INFBase
Inf2aWiki
JastProject
LINCS
LTG
MATCH
MLforNLP
Main
MusIC
PG
Prism
RaviProgress
SDP
SDPGroup1
SDPGroup10
SDPGroup3
SDPGroup5
SDPGroup6
SDPGroup7
SDPGroup8
SDPGroup9
SEOC
Sandbox
SecurityProgramme
SelfManaged
Seminars
StudioLab
TFlex
TWiki
TheBeast
Ug30708
Vademecum
VerbClasses
WebExp
YouTute
My links
My home page
edit
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback
This Wiki uses
Cookies