(r3) DepStructureProperties < TFlex

TFlex Web>Proposals>DeepGRs>DepStructureProperties (revision 3) (raw view)~~EditAttach~~

<!--
  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
-->

---+++ Rootedness, connectedness and unique parenthood

*Rootedness* - there is exactly one word W for which the following two statements are both true:
   * W is the source of at least one dependency
   * W is not the target of any dependency

*Connectedness* - every word is either the source or target of some dependency

*Unique parenthood* - every word which is the target of some dependency, is the target of just the one dependency

---+++ Rootedness, connectedness and unique parenthood are all independent

Rooted + connected + unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,that)
(that,rocks)
(rocks,Mary)
</pre>

Rooted + connected + non-unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,that)
(that,rocks)
(rocks,Mary)
(thinks,rocks)
</pre>

Rooted + non-connected + unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,rocks)
(rocks,Mary)
</pre>

Rooted + non-connected + non-unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,rocks)
(rocks,Mary)
(thinks,Mary)
</pre>

Non-rooted + connected + unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(that,rocks)
(rocks,Mary)
</pre>

Non-rooted + connected + non-unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(that,Mary)
(rocks,Mary)
</pre>

Non-rooted + non-connected + unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(rocks,Mary)
</pre>

Non-rooted + non-connected + non-unique parent
<pre>
John thinks that Mary rocks
(thinks,John)
(rocks,Mary)
(thinks,Mary)
</pre>

---+++ Acyclicity

If there is a sequence of dependencies from word W1 to word W2, then there is no sequence of dependencies from W2 to W1.

---+++ Rooted + unique parent + cyclic is inconsistent

Rooted + connected + unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,that)
(that,rocks)
(rocks,Mary)
</pre>

Rooted + connected + unique parent + cyclic
<pre>
John thinks that Mary rocks
XXX
</pre>

Rooted + connected + non-unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,that)
(that,rocks)
(rocks,Mary)
(thinks,Mary)
</pre>

Rooted + connected + non-unique parent + cyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,that)
(that,rocks)
(rocks,Mary)
(Mary,that)
</pre>

Rooted + non-connected + unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,rocks)
(rocks,Mary)
</pre>

Rooted + non-connected + unique parent + cyclic
<pre>
John thinks that Mary rocks
XXX
</pre>

Rooted + non-connected + non-unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,rocks)
(rocks,Mary)
(thinks,Mary)
</pre>

Rooted + non-connected + non-unique parent + cyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(thinks,rocks)
(rocks,Mary)
(Mary,rocks)
</pre>

Non-rooted + connected + unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(that,rocks)
(rocks,Mary)
</pre>

Non-rooted + connected + unique parent + cyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(that,rocks)
(rocks,Mary)
(Mary,that)
</pre>

Non-rooted + connected + non-unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(that,rocks)
(rocks,Mary)
(that,Mary)
</pre>

Non-rooted + connected + non-unique parent + cyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(that,rocks)
(rocks,Mary)
(Mary,that)
</pre>

Non-rooted + non-connected + unique parent + acyclic
<pre>
John thinks that Mary rocks
(thinks,John)
(rocks,Mary)
</pre>

Non-rooted + non-connected + unique parent + cyclic
<pre>
John thinks that Mary rocks
(that,rocks)
(rocks,Mary)
(Mary,that)
</pre>

Non-rooted + non-connected + non-unique parent + acyclic
<pre>
John thinks that Mary rocks
(that,rocks)
(Mary,rocks)
</pre>

Non-rooted + non-connected + non-unique parent + cyclic
<pre>
John thinks that Mary rocks
(that,rocks)
(Mary,rocks)
(rocks,Mary)
</pre>

i.e. 
   * rooted, unique parent implies acyclic
   * rooted, cyclic implies non-unique parent
   * unique parent, cyclic implies non-rooted

In other words, a "tree" can be defined as a rooted, unique parent dependency structure - acyclicity is implied.

---+++ 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

Topic revision: r3 - 18 Aug 2008 - 23:40:21 - MarkMcConville

TFlex

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